Finding good itemsets by packing data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 588-597

  Tatti, Nikolaj ^a   Vreeken, Jilles ^b  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX INTERACTION; COMPRESSION TECHNIQUES; HIGH QUALITY; ITEM SETS; SMALL GROUPS;

INFORMATION MANAGEMENT; MINING;

DECISION TREES;

EID: 67049165548     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.39     Document Type: Conference Paper

References (34)

1. C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proceedings of the ACM SIGACTSIGMOD- SIGART symposium on Principles of Database Systems (PODS), pages 18-24. ACM Press, 1998.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI, 1996.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In ACM SIGMOD International Conference on Management of Data, pages 265-276. ACM Press, 1997. (Pubitemid 127456791)
4. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In ACM SIGMOD International Conference on Management of Data, pages 255-264, 1997. (Pubitemid 127456790)
5. B. Bringmann and A. Zimmermann. The chosen few: On identifying valuable patterns. In IEEE International Conference on Data Mining ICDM, pages 63-72, 2007.
6. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pages 74-85, 2002.
7. V. Chandola and V. Kumar. Summarization - compressing data into an informative representation. In Proceedings of the IEEE Conference on Data Mining, pages 98-105, 2005. (Pubitemid 47385682)
8. F. Coenen. The LUCS-KDD discretised/normalised ARM and CARM data library. 2003.
9. G. F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347, 1992.
10. T. Cover and J. Thomas. Elements of Information Theory, 2nd ed. John Wiley and Sons, 2006.
11. W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 67-76, 2001.
12. C. Faloutsos and V. Megalooikonomou. On data mining, compression and kolmogorov complexity. In Data Mining and Knowledge Discovery, volume 15, pages 3-20. Springer, 2007. (Pubitemid 47142808)
13. P. D. Grünwald. The Minimum Description Length Principle. MIT Press, 2007.
14. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: Current status and future directions. In DataMining and Knowledge Discovery, volume 15. Springer, 2007.
15. J. Han and J. Pei. Mining frequent patterns by patterngrowth: methodology and implications. SIGKDD Explorations Newsletter, 2(2):14-20, 2000.
16. H. Heikinheimo, E. Hinkkanen, H.Mannila, T. Mielikäinen, and J. K. Seppänen. Finding low-entropy sets and trees from binary data. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 350-359, 2007. (Pubitemid 350229222)
17. S. Jaroszewicz and T. Scheffer. Fast discovery of unexpected patterns in data, relative to a bayesian network. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 118-127, 2005. (Pubitemid 43218274)
18. S. Jaroszewicz and D. A. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 178-186, 2004. (Pubitemid 40114927)
19. A. J. Knobbe and E. K. Y. Ho. Maximally informative kitemsets and their efficient discovery. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 237-244, 2006. (Pubitemid 44535520)
20. A. J. Knobbe and E. K. Y. Ho. Pattern teams. In Proceedings of the 10th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pages 577-584, 2006. (Pubitemid 44617760)
21. P. Kontkanen and P.Myllymäk. A linear-time algorithm for computing the multinomial stochastic complexity. Information Processing Letters, 103(6):227-233, 2007. (Pubitemid 46992798)
22. M.van Leeuwen, J. Vreeken, and A. Siebes. Compression picks the item sets that matter. In Proceedings of the 10th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pages 585-592, 2006. (Pubitemid 44617761)
23. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1993.
24. R. Meo. Theory of dependence values. ACM Trans. Database Syst., 25(3):380-406, 2000.
25. A. J. Mitchell-Jones, G. Amori, W. Bogdanowicz, B.Krystufek, P. J. H. Reijnders, F. Spitzenberger,M. Stubbe, J. B. M. Thissen, V. Vohralik, and J. Zima. The Atlas of European Mammals. Academic Press, 1999.
26. K. V. S.Murthy. On growing better decision trees from data. PhD thesis, Johns Hopkins Univ., Baltimore, 1996.
27. S. Nijssen and É. Fromont. Mining optimal decision trees from itemset lattices. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 530-539, 2007. (Pubitemid 350229238)
28. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science, 1540:398-416, 1999.
29. J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40-47, 1996. (Pubitemid 126775655)
30. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In Proceedings of the SIAM Conference on Data Mining, pages 393-404, 2006.
31. N. Tatti. Maximum entropy based significance of itemsets. Knowledge and Information Systems (KAIS), 2008. Accepted for publication.
32. N. Tatti and H. Heikinheimo. Decomposable families of itemsets. In Proceedings of the 12th European Conference onMachine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.
33. J. Vreeken, M. van Leeuwen, and A. Siebes. Characterising the difference. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 765-774, 2007. (Pubitemid 350229262)
34. J. Vreeken, M. van Leeuwen, and A. Siebes. Preserving privacy through data generation. In Proceedings of the IEEE Conference on Data Mining, pages 685-690, 2007.