Related references
Note: Only part of the references are listed.Krimp: mining itemsets that compress
Jilles Vreeken et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2011)
INAPPROXIMABILITY RESULTS FOR MAXIMUM EDGE BICLIQUE, MINIMUM LINEAR ARRANGEMENT, AND SPARSEST CUT
Christoph Ambuehl et al.
SIAM JOURNAL ON COMPUTING (2011)
Identifying the components
Matthijs van Leeuwen et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2009)
On data mining, compression, and Kolmogorov complexity
Christos Faloutsos et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
Compression-based data mining of sequential data
Eamonn Keogh et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2007)
Clustering by compression
R Cilibrasi et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
Network motifs: Simple building blocks of complex networks
R Milo et al.
SCIENCE (2002)
Share Paper
