Item sets that compress

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 395-406

  Siebes, Arno ^a   Vreeken, Jilles ^a   Van Leeuwen, Matthijs ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Frequent Item Sets; MDL

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA REDUCTION; DATABASE SYSTEMS; PROBLEM SOLVING; SET THEORY;

EXPLOSION; FREQUENT ITEM SETS; HEURISTIC ALGORITHMS; ITEM SETS; MDL PRINCIPLE;

DATA MINING;

EID: 33745462292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.35     Document Type: Conference Paper

References (15)

1. F. Afrati, A. Gionis, and H. Mannila. Approximating a collection of frequent item sets. In Proc ACM SIGKDD conference, pages 12-19, 2004.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD conference, pages 207-216, 1993.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. ICDE conference, pages 3-14, 1995.
4. R. Bayardo. Efficiently mining long patterns from database. In Proc. ACM SIGMOD conference, pages 85-93, 1998.
5. B. Crémilleux and J-F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In Proceedings of the 22nd SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence, pages 33-46, 2002.
6. B. Goethals et.al. FIMI website. In fimi.cs.helsinki.fi.
7. P.D. Grünwald. Minimum description length tutorial. In P.D. Grünwald, I.J. Myung, and M.A. Pitt, editors, Advances in Minimum Description Length. MIT Press, 2005.
8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD conference, pages 1-12, 2000.
9. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. PKDD conference, pages 13-23, 2000.
10. M. Li and P. Vitányi. An introduction tp kolmogorov complexity and its applications. Springer-Verlag, 1993.
11. H. Mannila, H. Toivonen, and A.I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259-289, 1997.
12. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery. IEEE Transactions on Knowledge and Data Engineering, 8:970-974, 1996.
13. C.S. Wallace. Statistical and inductive inference by minimum message length. Springer, 2005.
14. D. Xin, J. Han, X. Yan, and H. Chend. Mining compressed frequent-pattern sets. In Proc. VLDB conference, pages 709-720, 2005.
15. M.J. Zaki and M. Orihara. Theoretical foundations of association rules. In Proc. ACM SIGMOD workshop on research issues in KDD, 1998.