An efficient algorithm for frequent itemset mining on data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4065 LNAI, Issue , 2006, Pages 474-491

  Xie, Zhi Jun ^a   Chen, Hong ^a   Li, Cuiping ^a  

^a RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; IMAGE ANALYSIS; TREES (MATHEMATICS);

DATASETS; FREQUENT ITEMSET ENUMERATE TREES (FIET); GREATEST LOWER BOUND (GLB); LEAST UPPER BOUNDS (LUB);

DATA MINING;

EID: 33746406794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. R.Agrawal, H.Mannila, R.Srikant, H.Toivonent, and A.Inkeri Verkamo.Fast discovery of associantion rules.In U.Fayyad and et al, editors, Advances in knowledge Discovery and Data Mining, pages 307-328.AAAI press, Menlo Park, CA, 1996.
2. R.Agrawal and R.Srikant. Fast algorithms for mining association rules.In Proc.1994 Int.conf.Very Large DataBases(VLDB'94), pages 487-499, Santiago, Chile, September 1994.
3. B.Babcock, S.BAbu, M.Datar, R.Motwani, and J.Widom. Models and Issues in Data Stream systems.In Proceedings of the 2002 ACM Symposium on principles of Database Systems (PODS 2002)(Invited Paper).ACM Press, June 2002
4. Christan Borgelt.Apriori implementation.http://fuzzy.cs.UniMagdeburg.de/ borgelt/Software.
5. A.Dobra, J.Gehrke, M.Garofalakis, and R.Rastogi.Processing complex aggregate queries over data streams.In proc.of the 2002 ACM SIGMOD intl.Conf. on Management of Data, June 2002.
6. P.Domingos and G.Hulten.Mining high-speed data streams.In Proceedings of the ACM Conference on Knowledge and Data Discovery (SIGKDD), 2000.
7. J.Gehrke, F.Korn, and D.Srivastava.On computing correlated aggregates over continual data streams.In Proc.of the 2001 ACM SIGMOD Intl.Conf.on Manaagement of Data, pages 13-24.acmpress, June 2001.
8. C.Giannella, Jiawei Han, Jian Pei, Xifeng yan, and P.S.Yu. Mining Frequent Patterns in Data Streams at Multiple Time Granularities.In Processdings of the NSF Workshop on Next Generation Data Mining, November 2002.
9. Phillip B.Gibbons and S.Tirthapura. Estimating simple functions on the union of data streams.In proc.of the 2001 ACM Symp.on parallel Algorithms and Architechtures, pages 281-291.ACM Press, August 2001.
10. Bart Goethals.Fp-tree implementation.http://www.cs.helsinki.fi/u/ goethals/software/index.html.
11. R. Jin and G. Agrawal. An algorithm for in-core frequent itemset mining on streaming data. Submitted for Publication, 2004.
12. M.J.Zaki and C.Hsiao.Charm:An efficient algorithm for closed itemset mining.In 2nd SIAM Int'l confon Data Mining, 2002
13. J.Han, J.Pei, and Y.Yin. Mining Frequent patterns without candidate generation.In Proceedings of the ACM SIGMOD Conference on Management of Data, 2000.
14. Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wang, "Incremental Maintainence of Quotient Cube for sum and Median" Proceedings of SIGKDD, p.226-235, August 2004, Seattle, WA, USA
15. G.S.Manku and R.Motwain. Approximate Frequency Counts Over Data Streams. In proceedings of Conference on Very Large DataBase(VLDB), pages 346-357, 2002.