New algorithm for mining frequent itemsets in sparse database

2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005

Volumn , Issue , 2005, Pages 1554-1558

  Ye, Fei Yue ^a,b   Wang, Jian Dong ^a   Shao, Bl Lin ^c  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

^b JIANGSU UNIVERSITY OF TECHNOLOGY   (China)

^c XI'AN UNIVERSITY OF ARCHITECTURE AND TECHNOLOGY   (China)

Author keywords

Association Rules; Data Mining; Frequent Itemsets; Unit Triplet

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS;

ASSOCIATION RULES; FREQUENT ITEMSETS; UNIT TRIPLET;

DATA MINING;

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

References (5)

1. R.Agrawal and R.Srikant. "Fast algorithms for mining association rules in large database". In proc.of the 20 VLDB conference[C], Santiago, pp.487-499,1994.
2. rd international conference on DaWaK.2001. Munich, Germany, pp.1-17,2001.
3. J.S. Park, M.S. Chen, and P.S. Yu. An effective hash-based algorithm for mining association rules. (SIGMOD'95), San Jose, CA, pp.175-186,May,1995.
4. J.Han, J.Pei, Y.Yin, R.Mao. "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach", Data Mining and Knowledge Discovery, pp.53-87, Aug.2004.
5. A.Savasere, E. Omiecinski, and S. Navathe."An efficient algorithm for mining association rules in large databases". In VLDB'95, pp 432-443.