Online data stream mining of recent frequent itemsets based on sliding window model

Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC

Volumn 1, Issue , 2008, Pages 293-298

  Ren, Jia Dong ^a   Li, Ke ^a  

^a YANSHAN UNIVERSITY   (China)

Author keywords

Data mining; Online data stream; Sliding windows

Indexed keywords

CONTROL THEORY; CYBERNETICS; DECODING; INFORMATION MANAGEMENT; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE MANAGEMENT; LEARNING SYSTEMS; MINING; ROBOT LEARNING; WINDOWS;

APRIORI; DATA STREAM MININGS; DATA STREAMS; FREQUENT ITEM SETS; FREQUENT ITEMS; MINING FREQUENT ITEMSETS; MINING RESULTS; ONLINE DATA STREAM; SLIDING WINDOWS;

DATA MINING;

EID: 57849094489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2008.4620420     Document Type: Conference Paper

References (11)

1. G. S. Manku, and R. Motwani. Approximate Frequency Counts Over Data Streams. In Proceedings of the 28th International Conference on Very Large Data Bases, pp. 346-357, 2002.
2. N. Jiang, and L. Gruenwald. Research Issues in Data Stream Association Rule Mining. In SIGMOD Record, Vol. 35, No. 1, Mar. 2006.
3. J.-X. Yu, Z. Chong, H. Lu, and A. Zhou. False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams. In Proceedings of the 30th International Conference on Very Large Data Bases, pp. 204-215, 2004.
4. H.-F. Li, S.-Y. Lee, and M.-K. Shan, An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams, in Proc. of First International Workshop on Knowledge Discovery in Data Streams (IWKDDS), 2004.
5. J. Chang and W. Lee. Decaying Obsolete Information in Finding Recent Frequent Itemsets over Data Stream. IEICE Transaction on Information and Systems, Vol. E87-D, No. 6, June, 2004.
6. C. H. Lin, D. Y. Chiu, Y. H. Wu and A. L. P. Chen. Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. In Proceedings of 2005 SIAM International Conference on Data Mining, 2005.
7. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. In Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487-499, 1994.
8. A. Savasers, E. Omiecinski and S. NAvathe, An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st International Conference on Very Large Databases Zurich, Switzerland, September 1995 (VLDB Endowment, 1995)432-44.
9. H.-F. Li., S.-Y. Lee, and M.-K. Shan, Online Mining (Recently) Maximal Frequent Itemsets over Data Streams, in Proc. of the 15th IEEE International Workshop on Research Issues on Data Engineering (RIDE), 2005.
10. J. Chang and W. Lee. A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams. Journal of Information Science and Engineering, Vol. 20, No. 4, July, 2004.
11. W.-G. Teng, M.-S. Chen, and P. S. Yu. A Regression-Based Temporal Pattern Mining Scheme for Data Streams. In Proceedings of the 29th International Conference on Very Large Data Bases, pp. 93-104, 2003.