Frequent Pattern Mining in Data Streams - Frequent Pattern Mining - page 217

9. Albert Bifet. Adaptive stream mining: Pattern learning and mining from evolving data streams.
In Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Min-
ing from Evolving Data Streams , pages 1-212, Amsterdam, The Netherlands, The Netherlands,
2010. IOS Press.
10. Albert Bifet and Ricard Gavaldà. Mining adaptively frequent closed unlabeled rooted trees in
data streams. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge
discovery and data mining , KDD '08, pages 34-42, New York, NY, USA, 2008. ACM.
11. Albert Bifet, Geoff Holmes, Bernhard Pfahringer, and Ricard Gavaldà. Mining frequent closed
graphs on evolving data streams. In Proceedings of the 17th ACM SIGKDD international
conference on Knowledge discovery and data mining , KDD '11, pages 591-599, New York,
NY, USA, 2011. ACM.
12. Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter Haas, and Peter Scheuermann. Efficient
data reduction with ease. In Proceedings of the Ninth ACM SIGKDD International Conference
on Knowledge Discovery and Data Mining , KDD '03, pages 59-68, New York, NY, USA,
2003. ACM.
13. Toon Calders, Nele Dexters, and Bart Goethals. Mining frequent itemsets in a stream. In Data
Mining, 2007. ICDM 2007. Seventh IEEE International Conference on , pages 83-92. IEEE,
2007.
14. Joong Hyuk Chang and Won Suk Lee. Finding recent frequent itemsets adaptively over online
data streams. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge
discovery and data mining , KDD '03, pages 487-492, New York, NY, USA, 2003. ACM.
15. Joong Hyuk Chang and Won Suk Lee. Efficient mining method for retrieving sequential patterns
over online data streams. J. Inf. Sci. , 31(5):420-432, October 2005.
16. Lei Chang, Tengjiao Wang, Dongqing Yang, and Hua Luan. Seqstream: Mining closed sequen-
tial patterns over stream sliding windows. In Proceedings of the 2008 Eighth IEEE International
Conference on Data Mining , ICDM '08, pages 83-92, Washington, DC, USA, 2008. IEEE
Computer Society.
17. Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data
streams. In Automata, Languages and Programming , pages 693-703. Springer, 2002.
18. Bin Chen, Peter Haas, and Peter Scheuermann. A new two-phase sampling based algorithm
for discovering association rules. In Proceedings of the Eighth ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining , KDD '02, pages 462-468, New York,
NY, USA, 2002. ACM.
19. Junbo Chen and ShanPing Li. Gc-tree:a fast online algorithm for mining frequent closed
itemsets. In Emerging Technologies in Knowledge Discovery and Data Mining , pages 457-468.
Springer, 2007.
20. James Cheng, Yiping Ke, and Wilfred Ng. Maintaining frequent closed itemsets over a sliding
window. Journal of Intelligent Information Systems , 31(3):191-215, 2008.
21. William Cheung and Osmar R Zaiane. Incremental mining of frequent patterns without candi-
date generation or support constraint. In Database Engineering and Applications Symposium,
2003. Proceedings. Seventh International , pages 111-116. IEEE, 2003.
22. D.W. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of discovered association rules
in large databases: An incremental updating techniques. In Proc. 12th IEEE International
Conference on Data Engineering (ICDE-96) , New Orleans, Louisiana, U.S.A., March 1, 1996.
23. Yun Chi, Haixun Wang, Philip S. Yu, and Richard R. Muntz. Moment: Maintaining closed fre-
quent itemsets over a stream sliding window. In Proceedings of the Fourth IEEE International
Conference on Data Mining , ICDM '04, pages 59-66, Washington, DC, USA, 2004. IEEE
Computer Society.
24. Graham Cormode and S. Muthukrishnan. An improved data stream summary: The count-min
sketch and its applications. J. Algorithms , 55(1):58-75, April 2005.
25. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Frequency estimation of internet
packet streams with limited space. In Proceedings of the 10th Annual European Symposium
on Algorithms , ESA '02, pages 348-360, London, UK, UK, 2002. Springer-Verlag.