IMBT - A binary tree for efficient support counting of incremental data mining

Proceedings - 12th IEEE International Conference on Computational Science and Engineering, CSE 2009

Volumn 1, Issue , 2009, Pages 324-329

  Yang, Chia Han ^a   Yang, Don Lin ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Binary tree; Frequent itemset; Incremental data mining; Support count

Indexed keywords

APRIORI; CRITICAL ISSUES; FP-GROWTH ALGORITHM; FREQUENT ITEMSET; FREQUENT ITEMSETS; INCREMENTAL DATA; INCREMENTAL MINING; ITEM SETS; MINIMUM SUPPORT THRESHOLDS; MINING METHODS; MINING PROCESS; REAL WORLD DATA; REAL-WORLD APPLICATION; SUPPORT COUNT;

BINARY TREES; COMPUTATIONAL EFFICIENCY; DATABASE SYSTEMS; MINING;

DATA MINING;

EID: 70749107260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.360     Document Type: Conference Paper

References (15)

1. C. Ordonez, "Association Rule Discovery with the Train and Test Approach for Heart Disease Prediction," IEEE Transaction on Information Technology in Biomedicine, VOL. 10, NO. 2, APRIL 2006.
2. G. Cong, K. L. Tan, A. K.H. Tung, F. Pan, "Mining Frequent Closed Itemsets in Microarray Data," Proceedings of the Fourth IEEE International Conference on Data Mining, 2004.
3. Q. Chen, J. Han, Y. Chu, X. Ying, "Mining Consumers' Most Adaptive Products by Efficient Clustering Algorithm," Proceedings of the 16th International Conference on Artificial Reality and Telexistence, 2006.
4. Y. Chi, H. Wang, P. S. Yu, R. R. Muntz, "Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window," IEEE international conference on data mining, 2004.
5. Y. Chi, H. Wang, P. S. Yu, R. R. Muntz, "Catch the moment: maintaining closed frequent itemsets over a data stream sliding window," Knowledge and Information Systems, 10(3): 265-294, 2006.
6. R. C. Agarwal, C. C. Aggarwal, V.V.V. Prasad, "A Tree Projection Algorithm for Generation of Frequent Itemsets," Journal of Parallel and Distributed Computing, 61(3): 350-371, 2001.
7. T. P. Hong, C. W. Lin, Y. L. Wu, "Incrementally fast updated frequent itemset trees," Expert Systems with Applications 34, pp. 2424-2435, 2008.
8. J. Han, J. Pei, Y. Yin, "Mining Frequent Itemsets without Candidate Generation," ACM SIGMOD International Conference on Management of Data, 2000.
9. C. W. Lin, T. P. Hong, W. H. Lu, "The Pre-FUFP algorithm for incremental mining," Expert Systems with Applications xxx (2008) xxx-xxx.
10. IBM Almaden Research Center, "Synthetic Data Generation Code for Associations and Sequential Itemsets," URL :http://www.almaden.ibm.com/ software/quest/, 2006.
11. D. W. Cheung, J. Han, V. T. Ng, C. Y. Wong, "Maintenance of discovered association rules in large databases: An incremental updating approach," In The twelfth IEEE international conference on data engineering, pp. 106-114, 1996.
12. D. Y. Chiu, Y. H. Wu, A. L. P. Chen, "An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting," Proceedings of the 20th International Conference on Data Engineering (ICDE'04).
13. C. I. Ezeife, Y. Su, "Mining incremental association rules with generalized FP-tree," In Proceedings of the 15th conference of the Canadian society for computational studies of intelligence on advances in artificial intelligence, pp. 147-160, 2002.
14. M. J. Zaki, "SPADE: An Efficient Algorithm for Mining Frequent Sequences," Machine Learning, 42(1): 31-60, 2001.
15. J. Wang, J. Han, "BIDE: Efficient Mining of Frequent Closed Sequences," Proceedings of the 20th International Conference on Data Engineering (ICDE'04).