Related references
Note: Only part of the references are listed.One in a million: picking the right patterns
Bjorn Bringmann et al.
KNOWLEDGE AND INFORMATION SYSTEMS (2009)
Approximating the number of frequent sets in dense data
Mario Boley et al.
KNOWLEDGE AND INFORMATION SYSTEMS (2009)
Maximum entropy based significance of itemsets
Nikolaj Tatti
KNOWLEDGE AND INFORMATION SYSTEMS (2008)
A new concise representation of frequent itemsets using generators and a positive border
Guimei Liu et al.
KNOWLEDGE AND INFORMATION SYSTEMS (2008)
Efficient mining of understandable patterns from multivariate interval time series
Fabian Moerchen et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
On data mining, compression, and Kolmogorov complexity
Christos Faloutsos et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
Discovering significant patterns
Geoffrey I. Webb
MACHINE LEARNING (2007)
Non-derivable itemset mining
Toon Calders et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
Extending the state-of-the-art of constraint-based pattern discovery
Francesco Bonchi et al.
DATA & KNOWLEDGE ENGINEERING (2007)
Compression-based data mining of sequential data
Eamonn Keogh et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
On mining instance-centric classification rules
Jianyong Wang et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2006)
On condensed representations of constrained frequent patterns
F Bonchi et al.
KNOWLEDGE AND INFORMATION SYSTEMS (2006)
Fast and memory efficient mining of frequent closed itemsets
C Lucchese et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2006)
Mining non-redundant association rules
MJ Zaki
DATA MINING AND KNOWLEDGE DISCOVERY (2004)
Share Paper
