An efficient frequent pattern mining algorithm for data stream

Proceedings - International Conference on Intelligent Computation Technology and Automation, ICICTA 2008

Volumn 1, Issue , 2008, Pages 757-761

  Hualei, Liu ^a   Shukuan, Lin ^a   Jianzhong, Qiao ^a   Ge, Yu ^a   Kaifu, Lu ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION MANAGEMENT; MINING;

APRIORI; DATA SETS; DATA STREAMS; FREQUENT PATTERN MININGS; FREQUENT PATTERNS; HIGH ACCURACIES; NOVEL STRUCTURES; TIME SERIES;

TREES (MATHEMATICS);

EID: 57949109039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICTA.2008.227     Document Type: Conference Paper

References (13)

1. R.Agrawal, T.Imielinski, and A.Swami, Mining Association Rules between Sets of Items in Large Database, Proc. 1993 ACM_SIGMOD Int'1 Conf. On Management of Data(SIGMOD'93), Washington, DC, 1993, pp.207-216.
2. J.Han, J.Pei, and Y.Yin. Mining frequent patterns without candidate generation, Proc.2000 ACM SIGMOD International Conference on Management of Data, volume 29(2) of SIGMOD Record, ACM Press, 2000, pp.1-12.
3. C.Giannella et al. Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT Press, 2004, ch.6
4. W.Cheung and O.R.Zaiane. Incremental mining of frequent patterns without candidate generation or support constraint. In Proc. IDEAS 2003, pp. 111-116.
5. Leung CK-S, Khan QI, Hoque T(2005) CanTree: a tree structure for efficient incremental mining of frequent patterns. In: J.Han, BW.Wah, V.Raghavan. et al(eds) Proceedings of the ICDM 2005. IEEE Computer Society Press,Los Alamitos, CA, pp 274-281.
6. J.-L.Koh and S.-F.Shieh. An efficient approach for maintaining association rules based on adjusting FP-tree structures. In Proc. DASFAA 2004, pp. 417-424
7. C.Leung and Q.Khan. Effcient Mining of Constrained Frequent Patterns from Streams. In Proc. IDEAS 2006, Dec. pp, 61-68.
8. D.Lee, W.Lee. Finding maximal frequent itemsets over online data streaming data. In: Proceedings of the Fifth IEEE International Conference on Data Mining. Houston, USA: IEEE Press, 2005. 210-217
9. C.Yun,W.Haixun,Yu. Moment: maintaining closed frequent itemsets over a stream sliding window. In Data Mining: ICDM 2004, Fourth IEEE International Conference. PP 59-66.
10. L.X.jun, X.H,bing, D.Y.sheng. Mining frequent closed pattern from a sliding window over Data Streams. In: Journal of computer research and development, 2006.
11. J.LKoh, S.N.Shi. An approximate approach for mining recently frequent itemsets from data streams. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, Springer, Heidelberg(2006).
12. T.Peiyi and P.TurKia. Mining Frequent Itemsets with Partial Enumeration. In Proceedings of the 44th Annual Association for Computing Machinery Southeast Conference(ACMSE'06), pages 180-185, Melbourne, Florida, USA, March 2006.
13. T.Peiyi and P.TurKia. Mining frequent web access patterns with partial enumeration. In Proceedings of the 45th annual southeast regional conference(ACM), page 226-231, Winston-Salem, North Caroline, March 2007.