A structure function for transaction data

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Volumn , Issue , 2011, Pages 558-569

  Siebes, Arno ^a   Kersten, René ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

COMPLEX CODES; MINIMUM DESCRIPTION LENGTH PRINCIPLE; MODEL AND ALGORITHMS; NATURAL NUMBER; PARTIAL FUNCTIONS; STRUCTURE FUNCTIONS; TRANSACTION DATA; TRANSACTION DATABASE;

DATA MINING;

EID: 84878535675     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.48     Document Type: Conference Paper

References (10)

1. P.W. Adriaans and P.M.B. Vitányi. The power and perils of mdl. In Proceedings IEEE International Symposium on Information Theory, pages 2216-2220, 2007.
2. Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI, 1996.
3. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007.
4. Frans Coenen. The LUCS-KDD discre-tised/normalised ARM and CARM data library. 2003.
5. Christos Faloutsos and Vasileios Megalooikonomou. On data mining, compression and kolmogorov complexity. In Data Mining and Knowledge Discovery, volume 15, pages 3-20. Springer Verlag, 2007.
6. Peter D. Grünwald. Minimum description length tutorial. In P.D. Grünwald and I.J. Myung, editors, Advances in Minimum Description Length. MIT Press, 2005.
7. Jorma Rissanen. Information and Complexity in Statistical Modeling. Springer-Verlag, 2007.
8. Arno Siebes, Jilles Vreeken, and Matthijs van Leeuwen. Item sets that compress. In Proceedings of the SIAM Conference on Data Mining, pages 393-404, 2006.
9. Matthijs van Leeuwen, Jilles Vreeken, and Arno Siebes. Compression picks item sets that matter. In Proceedings PKDD 2006, pages 585-592, 2006.
10. N.K. Vereschagin and P.M.B. Vitányi. Kolmogorov's structure function and model selection. IEEE Transactions on Information Theory, 50:3265-3290, 2004.