Mining frequent closed graphs on evolving data streams

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 591-599

  Bifet, Albert ^a   Holmes, Geoff ^a   Pfahringer, Bernhard ^a   Gavaldà, Ricard ^b  

^a UNIVERSITY OF WAIKATO   (New Zealand)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Closed mining; Concept drift; Data streams; Graphs

Indexed keywords

DATA MINING;

CLOSED MINING; CONCEPT DRIFTS; DATA STREAM; DATA STREAMS MINING; EVOLVING DATUM; GRAPH; GRAPH MINING; MINING FACE; REAL- TIME; SUBGRAPHS;

DATA HANDLING;

EID: 80052650039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020501     Document Type: Conference Paper

References (31)

1. M. R. Ackermann, C. Lammersen, M. Märtens, C. Raupach, C. Sohler, and K. Swierkot. StreamKM++: A Clustering Algorithm for Data Streams. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'10), 2010.
2. P. K. Agarwal, S. Har-Peled, and K. Varadarajan. Geometric approximation via coresets. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and computational geometry, pages 1-30. Cambridge University Press., 2005.
3. C. C. Aggarwal, Y. Li, P. S. Yu, and R. Jin. On dense pattern mining in graph streams. PVLDB, 3(1):975-984, 2010.
4. C. C. Aggarwal and H. Wang. Managing and Mining Graph Data. Springer Publishing Company, Incorporated, 1st edition, 2010.
5. H. Arimura and T. Uno. An output-polynomial time algorithm for mining frequent closed attribute trees. In ILP, pages 1-19, 2005. (Pubitemid 41479983)
6. J. L. Balcázar, A. Bifet, and A. Lozano. Mining frequent closed rooted trees. Machine Learning, 78(1-2):1-33, 2010.
7. A. Bifet and R. Gavaldà. Learning from time-changing data with adaptive windowing. In SIAM International Conference on Data Mining, 2007.
8. A. Bifet and R. Gavaldà. Mining adaptively frequent closed unlabeled rooted trees in data streams. In 14th ACM SIGKDD, pages 34-42, 2008.
9. A. Bifet, G. Holmes, B. Pfahringer, R. Kirkby, and R. Gavaldà. New ensemble methods for evolving data streams. In 15th ACM SIGKDD, pages 139-148, 2009.
10. A. Bifet, G. Holmes, B. Pfahringer, P. Kranen, H. Kremer, T. Jansen, and T. Seidl. MOA: Massive Online Analysis, a Framework for Stream Classification and Clustering. Journal of Machine Learning Research - Proceedings Track, 11:44-50, 2010.
11. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM'02, pages 51, Washington, DC, USA, 2002. IEEE Computer Society.
12. C. Borgelt, T. Meinl, and M. Berthold. Moss: a program for molecular substructure mining. In OSDM'05, pages 6-15, New York, NY, USA, 2005. ACM.
13. C. Borgelt, T. Meinl, and M. R. Berthold. Advanced pruning strategies to speed up mining closed molecular fragments. In IEEE Conf. on Systems, Man and Cybernetics (SMC 2004). IEEE Press, 2004.
14. J. Chen, S. J. J. Swamidass, Y. Dou, J. Bruand, and P. Baldi. ChemDB: a public database of small molecules and related chemoinformatics resources. Bioinformatics, September 2005.
15. J. H. Chen, E. Linstead, S. J. Swamidass, D. Wang, and P. Baldi. ChemDB update full-text search and virtual chemical space. Bioinformatics, 23(17):2348-2351, September 2007. (Pubitemid 47423878)
16. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD Conference, pages 857-872, 2007. (Pubitemid 47630859)
17. Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In Proceedings of the 2004 IEEE International Conference on Data Mining (ICDM'04), November 2004.
18. Y. Chi, Y. Xia, Y. Yang, and R. Muntz. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae, XXI:1001-1038, 2001.
19. D. J. Cook and L. B. Holder. Mining Graph Data. Wiley-Interscience, 2006.
20. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 14(1):27-45, 2002.
21. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 15:55-86, 2007. (Pubitemid 47142811)
22. Y. K. James Cheng and W. Ng. Maintaining frequent closed itemsets over a sliding window. Journal of Intelligent Information Systems, 2007.
23. Y. K. James Cheng and W. Ng. A survey on algorithms for mining frequent itemsets over data streams. Knowledge and Information Systems, 2007.
24. N. Jiang and L. Gruenwald. Cfi-stream: mining closed frequent itemsets in data streams. In KDD'06, pages 592-597, New York, NY, USA, 2006. ACM. (Pubitemid 44535560)
25. I. Takigawa and H. Mamitsuka. Effciently mining δ -tolerance closed frequent subgraphs. Machine Learning, 82(2):95-121, 2011.
26. A. Termier, M.-C. Rousset, M. Sebag, K. Ohara, T. Washio, and H. Motoda. DryadeParent, an effcient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng., 20(3):300-320, 2008. (Pubitemid 351185382)
27. J. H. Voigt, B. Bienfait, S. Wang, and M. C. Nicklaus. Comparison of the nci open database with seven large chemical structural databases. Journal of Chemical Information and Computer Sciences, 41(3):702-712, 2001.
28. J. Wang and J. Han. Bide: Effcient mining of frequent closed sequences. In ICDE, pages 79-90. IEEE Computer Society, 2004.
29. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM'02, page 721, Washington, DC, USA, 2002. IEEE Computer Society.
30. X. Yan and J. Han. CloseGraph: mining closed frequent graph patterns. In KDD'03, pages 286-295, 2003.
31. X. Yan, J. Han, and R. Afshar. Clospan: Mining closed sequential patterns in large databases. In SDM, 2003.