Reducing one class of machine learning algorithms to logical operations of plausible reasoning
From MaRDI portal
Publication:2017512
DOI10.1134/S1064230709030083zbMATH Open1308.68100MaRDI QIDQ2017512FDOQ2017512
Publication date: 23 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Comparing performance of algorithms for generating concept lattices
- Galois Connexions
- On the complexity of inferring functional dependencies
- Algorithms for inferring functional dependencies from relations
- Attributive concept descriptions with complements
- Inductive Logic Programming: Theory and methods
- A study of relevance for learning in deductive databases
- Relations binaires, fermetures, correspondances de Galois
- A fast algorithm for building lattices
- On the irredundant generation of knowledge spaces
- Concept lattices and conceptual knowledge systems
- Partition semantics for relations
- Inducing multi-level association rules from multiple relations
Cited In (1)
Uses Software
Recommendations
- Logic-based machine learning 👍 👎
- A logic for binary classifiers and their explanation 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Reducing one class of machine learning algorithms to logical operations of plausible reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017512)
