Reducing one class of machine learning algorithms to logical operations of plausible reasoning
From MaRDI portal
(Redirected from Publication:2017512)
Recommendations
- scientific article; zbMATH DE number 798660
- Logic-based machine learning
- Inductive logic, verisimilitude, and machine learning
- A logic for binary classifiers and their explanation
- scientific article; zbMATH DE number 44997
- scientific article; zbMATH DE number 5842448
- scientific article; zbMATH DE number 1934579
- scientific article; zbMATH DE number 1931861
Cites work
- scientific article; zbMATH DE number 4162849 (Why is no real title available?)
- scientific article; zbMATH DE number 4066397 (Why is no real title available?)
- scientific article; zbMATH DE number 53712 (Why is no real title available?)
- A fast algorithm for building lattices
- A study of relevance for learning in deductive databases
- Algorithms for inferring functional dependencies from relations
- Attributive concept descriptions with complements
- Comparing performance of algorithms for generating concept lattices
- Concept lattices and conceptual knowledge systems
- Galois Connexions
- Inducing multi-level association rules from multiple relations
- Inductive Logic Programming: Theory and methods
- On the complexity of inferring functional dependencies
- On the irredundant generation of knowledge spaces
- Partition semantics for relations
- Relations binaires, fermetures, correspondances de Galois
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Cited in
(2)
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)