An efficient algorithm for incremental mining of association rules

Proceedings of the IEEE International Workshop on Research Issues in Data Engineering

Volumn , Issue , 2005, Pages 3-10

  Chang, Chin Chen ^a,b   Li, Yu Chiang ^b   Lee, Jung San ^b  

^a FENG CHIA UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA MINING; DATABASE SYSTEMS;

ASSOCIATION RULES; INCREMENTAL MINING; ITEMSETS; NEW FAST UPDATE ALGORITHM (NFUP);

ALGORITHMS;

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

References (20)

1. R. C. Agarwal, C. C. Aggarwal, and V. V. V. Prasad, "A tree projection algorithm for generation of frequent itemsets," Journal of Parallel and Distributed Computing, Vol. 61, No. 3, pp. 350-361, 2000.
2. C. C. Aggarwal and P. S. Yu, "Mining associations with the collective strength approach," IEEE Trans. Knowledge and Data Engineering, Vol. 13, No. 6, pp. 863-873, 2001.
3. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases" In Proc. 1993 ACM SIGMOD Intl. Conf. on Management of Data, Washington, D.C., pp. 207-216, May 1993.
4. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," In Proc. 20th Intl. Conf. on Very Large Data Bases, Santiago, Chile, pp. 487-499, Sep. 1994.
5. N. F. Ayan, A. U. Tansel, and E. Arkun, "An efficient algorithm to update large itemsets with early pruning," In Proc. 5th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, pp. 287-291, Aug. 1999.
6. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, "Dynamic itemset counting and implication rules for market basket data," In Proc. 1997 ACM SIGMOD Intl. Conf. on Management of Data, Tucson, AZ, pp. 255-264, May 1997.
7. M. S. Chen, J. Han, and P. S. Yu, "Data mining: An overview from a database perspective," IEEE Trans. Knowledge Data Engineering, Vol. 8 No. 6, pp. 866-883, 1996.
8. D. W. Cheung, J. Han, V. T. Ng, and C. Y. Wong, "Maintenance of discovered association rules in large databases: an incremental updating technique," In Proc. 12th Intl. Conf. on Data Engineering, New Orleans, LA, pp. 106-114, Feb. 1996.
9. D. W. Cheung, S. D. Lee, and B. Kao, "A general incremental technique for maintaining discovered association rules," In Proc. 5th Intl. Conf. on Database Systems for Advanced Applications, Melbourne, Australia, pp. 185-194, Apr. 1997.
10. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," In Proc. 2000 ACM-SIGMOD Intl. Conf. on Management of Data, Dallas, TX, pp. 1-12, May 2000.
11. T. P. Hong, C. Y. Wang, and Y. H. Tao, "A new incremental data mining algorithm using pre-large itemsets," Intelligent Data Analysis, Vol. 5, No. 2, pp. 111-129, 2001.
12. C. H. Lee, M. S. Chen, and C. R. Lin, "Progressive partition miner: An efficient algorithm for mining general temporal association rules," IEEE Trans. Knowledge Data Engineering, Vol. 15, No. 4, pp. 1004-1017, 2003.
13. C. H. Lee, C. R. Lin, and M. S. Chen, "Sliding-window filtering: An efficient algorithm for incremental mining," In Proc. 10th Intl Conf. on Information and Knowledge Management, Atlanta, GA, pp. 263-270, Nov. 2001.
14. K. K. Ng and W. Lam, "Updating of association rules dynamically," In Proc. Intl. Symposium on Database Applications in Non-Traditional Environments, Kyoto, Japan, pp. 84-91, Nov. 1999.
15. T. Y. Ng, M. L. Wong, and P. Bao, "Incremental mining of association patterns on compressed data," In Proc. Joint 9th IFSA World Congress and 20th NAFIPS Intl. Conf., Vancouver, Canada, pp. 441-446, Jul. 2001.
16. J. S. Park, M. S. Chen, and P. S. Yu, "An effective hash-based algorithm for mining association rules," In Proc 1995 ACM-SIGMOD Intl. Conf. on Management of Data, San Jose, CA, pp. 175-186, May 1995.
17. N. L. Sarda and N. V. Srinivas, "An adaptive algorithm for incremental mining of association rules," In Proc. 9th Intl. Workshop on Database and Expert Systems Applications, Vienna, Austria, pp. 240-245, Aug. 1998.
18. A. Savasere, E. Omiecinski, and S. Navathe, "An efficient algorithm for mining association rules in large databases," In Proc. 21st Conf. on Very Large Data Bases, Zurich, Switzerland, pp. 432-444, Sep. 1995.
19. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka, "An efficient algorithm for the incremental updating of association rules in large database," In Proc. 3rd Intl. Conf. on Data Mining and Knowledge Discovery, Newport Beach, CA, pp. 263-266, Aug. 1997.
20. A. A. Veloso, W. Meira Jr., M. B. de Carvalho, B. Pôssas, S. Parthasarathy, and M. J. Zaki, "Mining frequent itemsets in evolving databases," In Proc. 2nd SIAM Intl. Conf. on Data Mining, Arlington, VA, Apr. 2002.