Approximate computation of exact association rules

DOI10.1007/978-3-030-77867-5_7OpenAlexW3173743893MaRDI QIDQ2117123

Sriram Kailasam, Sergei Obiedkov, Saurabh Bansal

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77867-5_7

zbMATH Keywords

implicationassociation rulePAC learning

Mathematics Subject Classification ID

Knowledge representation (68T30)

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction and learnability of canonical Horn formulas
• Learning conjunctions of Horn clauses
• Horn approximations of empirical data
• Queries and concept learning
• Optimizations in computing the Duquenne-Guigues basis of implications
• Probably approximately correct learning of Horn envelopes from queries
• Learning implications from data and from queries
• Attribute-incremental construction of the canonical implication basis
• On the usability of probably approximately correct implication bases
• From equivalence queries to PAC learning: the case of implication theories
• Conceptual Exploration
• Two Basic Algorithms in Concept Analysis