From equivalence queries to PAC learning: the case of implication theories

DOI10.1016/J.IJAR.2020.08.011MaRDI QIDQ2658016zbMATH OpenOpenAlexFDO

Authors Ramil Yarullin, Sergei Obiedkov

Publication date 18 March 2021

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2020.08.011

zbMATH Keywords

attribute explorationconcept learningformal concept analysisimplicationsPAC learningquery learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Queries and concept learning
• scientific article; zbMATH DE number 67615
• Asking questions to minimize errors
• How many queries are needed to learn?
• On the usability of probably approximately correct implication bases

Cites work

• A theory of the learnable
• Conceptual exploration
• Construction and learnability of canonical Horn formulas
• Horn approximations of empirical data
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 861622 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Learning conjunctions of Horn clauses
• Learning definite Horn formulas from closure queries
• Learning implications from data and from queries
• Learning regular sets from queries and counterexamples
• On the complexity of enumerating pseudo-intents
• On the intractability of computing the Duquenne-Guigues base
• On the usability of probably approximately correct implication bases
• Probably approximately correct learning of Horn envelopes from queries
• Queries and concept learning
• Two basic algorithms in concept analysis
• Worst case and a distribution-based case analyses of sampling for rule discovery based on generality and accuracy

Cited in

(5)

• Editorial. Formal concept analysis, rough sets, and three-way decisions
• Approximate computation of exact association rules
• Algebraic machine learning: emphasis on efficiency
• On the usability of probably approximately correct implication bases
• Pac learning of concept inclusions for ontology-mediated query answering

Describes a project that uses

Uses Software

• UCI

This page was built for publication: From equivalence queries to PAC learning: the case of implication theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658016)