Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams

2009 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009 - Proceedings

Volumn , Issue , 2009, Pages 381-388

  Wang, Yongyan ^a   Li, Kun ^a   Wang, Hongan ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CHILD NODE; ERROR PARAMETERS; FREQUENT ITEMSET; FREQUENT ITEMSETS; MAXIMAL SUPPORT; MEMORY SPACE; MINIMUM SUPPORT; MINING ALGORITHMS; MINING FREQUENT ITEMSETS; ONLINE DATA; PREFIX TREES; TREE-BASED;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DATA MINING;

MINING;

EID: 67650534935     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2009.4938675     Document Type: Conference Paper

References (11)

1. N. Jiang and L. Gruenwald, "Research issues in data stream association rule mining," SIGMOD Record, vol. 35, no. 1, pp. 14-19, 2006. (Pubitemid 43383843)
2. R. Agrawal, T. Imieliński, and A. Swami, "Mining association rules between sets of items in large databases," in SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 1993, pp. 207-216.
3. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in VLDB '94: Proceedings of the 20th international conference on Very Large Data Bases. Morgan Kaufmann, 1994, pp. 487-499.
4. H. Wang, W. Wang, J. Yang, and P. S. Yu, "Clustering by pattern similarity in large data sets," in SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 2002, pp. 394-405. (Pubitemid 34985564)
5. B. Liu, W. Hsu, and Y. Ma, "Integrating classification and association rule mining," in KDD '98: Proceedings of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1998, pp. 80-86.
6. J. H. Chang and W. S. Lee, "estwin: adaptively monitoring the recent change of frequent itemsets over online data streams," in CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management. New York, NY, USA: ACM Press, 2003, pp. 536-539.
7. J. H. Chang and W. S. Lee, "A sliding window method for finding recently frequent itemsets over online data streams," Journal of Information Science and Engineering, vol. 20, no. 4, pp. 753-762, 2004.
8. J. Cheng, Y. Ke, and W. Ng, "Maintaining frequent itemsets over highspeed data streams," in PAKDD'06: Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, 2006, pp. 462-467. (Pubitemid 44019446)
9. Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz, "Moment: Maintaining closed frequent itemsets over a stream sliding window," in ICDM '04: Proceedings of the 4th IEEE International Conference on Data Mining. Washington, DC, USA: IEEE Computer Society, 2004, pp. 59-66.
10. M.-K. S. Hua-Fu Li, Chin-Chuan Ho and S.-Y. Lee, "Efficient maintenance and mining of frequent itemsets over online data streams with a sliding window," in IEEE International Conference on Systems, Man and Cybernetics (SMC-2006), 2006.
11. Z. Zheng, R. Kohavi, and L. Mason, "Real world performance of association rule algorithms," in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, F. Provost and R. Srikant, Eds., 2001, pp. 401-406. [Online]. Available: http://robotics. Stanford.EDU/users/ronnyk/realWorldAssoc.pdf