Minimum description length principle: Generators are preferable to closed patterns

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 409-414

  Li, Jinyan ^a   Li, Haiquan ^a   Wong, Limsoon ^b   Pei, Jian ^c   Dong, Guozliu ^d  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c SIMON FRASER UNIVERSITY   (Canada)

^d WRIGHT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA TRANSFER; DATABASE SYSTEMS; DESCRIBING FUNCTIONS; PATTERN RECOGNITION;

DESCRIPTION LENGTH PRINCIPLES; GR-GROWTH; MINING ALGORITHMS;

AUTOMATIC PROGRAMMING;

EID: 33750743089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Agrawal, R.; Imielinski, T.; and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of 1993 ACM-SIGMOD International Conference on Management of Data, 207-216. Washington, D.C.: ACM Press.
2. Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G.; and Lakhal, L. 2000. Mining frequent patterns with counting inference. SIGKDD Explorations 2(2):66-75.
3. Borgelt, C. 2003. Effi cient implementation of apriori and eclat. In Proceedings of FIMI'03: Workshop on Frequent Itemset Mining Implementations.
4. Boulicaut, J.-E; Bykowski, A.; and Rigotti, C. 2003. Freesets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7(1):5-22.
5. Gao, Q.; Li, M.; and Vitanyi, P. 2000. Applying mdl to learning best model granularity. Artificial Intelligence 121:1-29.
6. Grahne, G., and Zhu, J. 2005. Fast algorithms for frequent itemset mining using fp-trees. IEEE Transactions on Knowledge and Data Engineering 17(10):1347-1362.
7. Grunwald, P.; Myung, I. J.; and Pitt, M. 2005. Advances in Minimum Description Length: Theory and Applications. MIT Press.
8. Han, J.; Pei, J.; and Yin, Y. 2000. Mining frequent patterns without candidates generation. In Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data, 1-12. ACM Press.
9. Kryszkiewicz, M.; Rybinski, H.; and Gajek, M. 2004. Dataless transitions between concise representations of frequent patterns. Journal of Intelligent Information Systems 22(1):41-70.
10. Li, M., and Vitanyi, P. 1997. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag.
11. Luong, V. P. 2002. The closed keys base of frequent itemsets. In Kambayashi, Y.; Winiwarter, W.; and Arikawa, M., eds., Proceedings of 4th International Conference on Data Warehousing and Knowledge Discovery, 181-190.
12. Pan, F.; Cong, G.; Tung, A. K. H.; Yang, J.; and Zaki, M. J. 2003. CARPENTER: Finding closed patterns in long biological datasets. In Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 637-642.
13. Pasquier, N.; Bastide, Y.; Taouil, R.; and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. In Proceedings of 7th International Conference on Database Theory (ICDT), 398-416.
14. Rissanen, J. 1978. Modeling by shortest data description. Automatica 14:465-471.
15. Uno, T.; Kiyomi, M.; and Arimura, H. 2004. LCM ver.2: Efficient mining algorithms for frequent/closed/maximal itemsets. In IEEE ICDM'04 Workshop FIMI'04 (International Conference on Data Mining, Frequent Itemset Mining Implementations).
16. Wang, J.; Han, J.; and Pei, J. 2003. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'03), Washington, DC, USA, 236-245.
17. Zaki, M. J., and Hsiao, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of 2nd SIAM International Conference on Data Mining.