Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

DOI10.2168/LMCS-6(2:4)2010zbMath1191.68488MaRDI QIDQ3575303

José L. Balcázar

Publication date: 27 July 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

data miningredundancyassociation rulesimplicationsoptimum basesdeductive calculus

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)

Related Items

Complex concept lattices for simulating human prediction in sport ⋮ A tutorial on statistically sound pattern discovery ⋮ Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Conditional probability in the light of qualitative belief change ⋮ Closed-Set-Based Discovery of Representative Association Rules ⋮ Unnamed Item ⋮ Quantitative Redundancy in Partial Implications ⋮ Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies