An efficient algorithm based on time decay model for mining maximal frequent itemsets

Proceedings of the 2009 International Conference on Machine Learning and Cybernetics

Volumn 4, Issue , 2009, Pages 2063-2066

  Huang, Guo Yan ^a   Wang, Li Bo ^a   Hu, Chang Zhen ^b   Ren, Jia Dong ^a,b   He, Hui Ling ^a  

^a YANSHAN UNIVERSITY   (China)

^b BEIJING INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Data stream; Maximal frequent itemsets; Time decay model

Indexed keywords

DATA STREAM; DATA STREAM MINING; EFFICIENT ALGORITHM; ITEMSET; MAINTENANCE COST; MAXIMAL FREQUENT ITEMSETS; MAXIMUM FREQUENT ITEMSETS; ON TIME; POINT-BASED; RESEARCH AREAS; SPACE COMPLEXITY; SPACE EFFICIENCIES; TIME DECAY; TIME DECAY MODEL;

ALGORITHMS; CONTROL THEORY; CYBERNETICS; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; MAINTENANCE; MINING; ROBOT LEARNING; WINDOWS;

DECAY (ORGANIC);

ALGORITHMS; COMMUNICATION; DATA; DECAY; MAINTENANCE; MINING; SYSTEMS; WINDOWS;

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

References (10)

1. X. Liu, H. Xu, Y.Dong, J.Qian, Y. Wang. Mining frequent pattern in data stream. Journal of Computer Research and Development, Vol. 42, No. 12, pp. 2192-2198, 2005.
2. W. Wang, J. Li, D. Zhang, L. Guo. An efficient algorithm for mining approximate frequent item over data streams.Journal of Software, Vol. 18, No. 4, pp. 884-892, 2007.
3. H. Li, S. Lee, M. Shah. Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. Proc. of the 15th IEEE Int'l Workshop on Research Issues on Data Engineering (RIDE-SDMA), Tokyo, Japan. pp. 11-18, 2005.
4. X. Liu, H. Xu, Y.Dong, J. Qian, Y. Wang. Mining frequent closed pattern from a sliding window over data stream. Journal of Computer Research and Development, Vol.43, No. 10, pp. 1738-1743, 2006.
5. D. Lee, W. Lee. Finding Maximal Frequent Itemsets over Online Data Streams Adaptively. Proc. of the 5th IEEE Int'l Conf. on Data Mining (ICDM), Houston, USA. pp, 266-273, 2005.
6. H. J. Woo, W. S. Lee. estMax: Tracing Maximal Frequent Itemsets over Online Data Streams. Proc. of the 7th IEEE Int'l Conf. on Data Mining (ICDM), Omaha, Nebraska, USA. pp, 709-714, 2007.
7. Y. Yan,Z. Li, H. Chen. Efficiently mining of maximal frequent itemsets based on FP-Tree. Journal of Software, Vol. 16, No. 2, pp. 215-222, 2005.
8. G. Li, H. Chen. Mining the frequent patterns in an arbitrary sliding window over online data streams. Journal of Software, Vol.19, No. 10, pp. 2585-2596, 2008.
9. G. Grahne. J. Zhu. High performance mining of maximal frequent itemsets . In : Proco.of the 6th SIAM Int, Workshop on High Performance Data Mining (HPDM 2003), pp. 135-143, 2003.
10. G. Li, H. Chen. Mining the frequent patterns in an arbitrary sliding window over online data streams.Journal of Software, Vol. 19, No. 10, pp. 2585-2596, 2008.