Database Reference
In-Depth Information
Acknowledgments
Matthijs van Leeuwen is supported by a Post-doctoral Fellowship of the
Research Foundation Flanders (FWO). Jilles Vreeken is supported by the Cluster of Excellence
“Multimodal Computing and Interaction” within the Excellence Initiative of the German Federal
Government.
References
1. P. Adriaans and P. Vitányi. Approximation of the two-part MDL code.
IEEE TIT
, 55(1):444-457,
2009.
2. H. Akaike. A new look at the statistical model identification.
IEEE TAC
, 19(6):716-723, 1974.
3. L. Akoglu, H. Tong, J. Vreeken, and C. Faloutsos. CompreX: Compression based anomaly
detection. In
CIKM
. ACM, 2012.
4. L. Akoglu, J. Vreeken, H. Tong, N. Tatti, and C. Faloutsos. Mining connection pathways for
marked nodes in large graphs. In
SDM
. SIAM, 2013.
5. R. Bathoorn, A. Koopman, and A. Siebes. Reducing the frequent pattern set. In
ICDM-
Workshop
, pages 1-5, 2006.
6. C. Böhm, C. Faloutsos, J.-Y. Pan, and C. Plant. Robust information-theoretic clustering. In
KDD
, pages 65-75, 2006.
7. F. Bonchi, M. van Leeuwen, and A. Ukkonen. Characterizing uncertain data using compression.
In
SDM
, pages 534-545, 2011.
8. S. Chakrabarti, S. Sarawagi, and B. Dom. Mining surprising patterns using temporal description
length. In VLDB, pages 606-617. Morgan Kaufmann, 1998.
9. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-
associations. In
KDD
, pages 79-88, 2004.
10. V. Chandola and V. Kumar. Summarization - compressing data into an informative represen-
tation.
Knowl. Inf. Sys.
, 12(3):355-378, 2007.
11. R. Cilibrasi and P. Vitányi. Clustering by compression.
IEEE TIT
, 51(4):1523-1545, 2005.
12. T. M. Cover and J. A. Thomas.
Elements of Information Theory
. Wiley-Interscience New York,
2006.
13. T. De Bie. An information theoretic framework for data mining. In
KDD
, pages 564-572.
ACM, 2011.
14. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM
algorithm.
J. R. Statist. Soc. B
, 39(1):1-38, 1977.
15. C. Faloutsos and V. Megalooikonomou. On data mining, compression and Kolmogorov
complexity.
Data Min. Knowl. Disc.
, 15(1):3-20, 2007.
16. U. Fayyad and K. Irani. Multi-interval discretization of continuous-valued attributes for
classification learning. In
UAI
, pages 1022-1027, 1993.
17. R. A. Fisher. On the interpretation of
χ
2
from contingency tables, and the calculation of P.
Journal of the Royal Statistical Society
, 85(1):87-94, 1922.
18. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In
DS
, pages 278-289, 2004.
19. A. Gionis, H. Mannila, and J. K. Seppänen. Geometric and combinatorial tiles in 0-1 data. In
PKDD
, pages 173-184. Springer, 2004.
20. P. Grünwald.
The Minimum Description Length Principle
. MIT Press, 2007.
21. T. Guns, S. Nijssen, and L. D. Raedt. Itemset mining: A constraint programming perspective.
Artif. Intell.
, 175(12-13):1951-1983, 2011.
22. E. Halperin and R. M. Karp. The minimum-entropy set cover problem.
TCS
, 348(2-3):240-250,
2005.
23. H. Heikinheimo, J. K. Seppänen, E. Hinkkanen, H. Mannila, and T. Mielikäinen. Finding
low-entropy sets and trees from binary data. In
KDD
, pages 350-359, 2007.
24. H. Heikinheimo, J. Vreeken, A. Siebes, and H. Mannila. Lowentropy set selection. In
SDM
,
pages 569-580, 2009.
