Mining all non-derivable frequent itemsets

DOI10.1007/3-540-45681-3_7MaRDI QIDQ4406010zbMATH OpenFDO

Authors Toon Calders, Bart Goethals

Publication date 25 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2431/24310074.htm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Database Support for Data Mining Applications
• Knowledge Discovery in Inductive Databases
• Meta itemset: a new concise representation of frequent itemset
• The closed keys base of frequent itemsets
• On concise representations of frequent patterns admitting negation

Cited in

(14)

• Sampling frequent and minimal Boolean patterns: theory and application in classification
• A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
• Discovering significant patterns
• Interpretation of association rules in multi-tier structures
• The complexity of satisfying constraints on databases of transactions
• Itemset frequency satisfiability: complexity and axiomatization
• Frequency-based views to pattern collections
• Safe projections of binary data sets
• Meta itemset: a new concise representation of frequent itemset
• Krimp: mining itemsets that compress
• Expressive generalized itemsets
• Database Support for Data Mining Applications
• Knowledge Discovery in Inductive Databases
• What to expect from a set of itemsets?

This page was built for publication: Mining all non-derivable frequent itemsets

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