Mining frequent closed trees in evolving data streams

Intelligent Data Analysis

Volumn 15, Issue 1, 2011, Pages 29-48

  Bifet, Albert ^a,b   Gavaldà, Ricard ^b  

^a UNIVERSITY OF WAIKATO   (New Zealand)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED PATTERN; DATA STREAM; EXPERIMENTAL EVALUATION; FREQUENT PATTERNS; GALOIS LATTICES; LOW-COMPLEXITY; REDUNDANT INFORMATIONS; ROOTED TREES; SLIDING-WINDOW; STREAMING DATA; TREE MINING;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA MINING;

TREES (MATHEMATICS);

EID: 79551513583     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2010-0454     Document Type: Article

References (32)

1. H. Arimura and T. Uno, An outputpolynomial time algorithm for mining frequent closed attribute trees. In Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings, volume 3625 of Lecture Notes in Computer Science, pages 1-19. Springer, 2005.
2. T. Asai, H. Arimura, K. Abe, S. Kawasoe and S. Arikawa, Online algorithms for mining semistructured data stream. In ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining, page 27, Los Alamitos, CA, USA, 2002. IEEE Computer Society.
3. T. Asai, H. Arimura, T. Uno and S.I. Nakano, Discovering frequent substructures in large unordered trees. In Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings, volume 2843 of Lecture Notes in Computer Science, pages 47-61. Springer, 2003. s
4. J.L. Balćazar, A. Bifet and A. Lozano, Mining frequent closed rooted trees. Accepted for publication in Machine Learning Journal, 2009.
5. A. Bifet and R. Gavald̀a, Learning from timechanging data with adaptive windowing. In Proceedings of the Seventh SIAM International Conference on Data Mining, April 26-28, 2007, Minneapolis, Minnesota, USA. SIAM, 2007.
6. A. Bifet and R. Gavald̀a, Mining adaptively frequent closed unlabeled rooted trees in data streams. In 14th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, 2008.
7. A. Bifet and R. Gavald̀a, Adaptive XML tree classification on evolving data streams. In ECMLPKDD' 09, 2009.
8. S. Chakrabarti, Mining the Web: Analysis of Hypertext and Semi Structured Data. Morgan Kaufmann, August 2002.
9. J. Cheng, Y.Ke andW.Ng, Maintaining frequent closed itemsets over a sliding window, Journal of Intelligent Information Systems 31(3) (2008), 191-215.
10. J. Cheng, Y. Ke and W. Ng, A survey on algorithms for mining frequent itemsets over data streams, Knowledge and Information Systems 16(1) (2008), 1-27.
11. 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.
12. 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.
13. M. Datar, A. Gionis, P. Indyk and R. Motwani, Maintaining stream statistics over sliding windows, SIAM Journal on Computing 14(1) (2002), 27-45.
14. J. Feng, Q. Qian, J.Wang and L.Z. Zhou, Efficient mining of frequent closed XML query pattern, J Comput Sci Technol 22(5) (2007), 725-735.
15. G.C. Garriga and J.L. Balćazar, Coproduct transformations on lattices of closed partial orders, In Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28-October 2, 2004, Proceedings, volume 3256 of Lecture Notes in Computer Science, pages 336-352. Springer, 2004.
16. K. Hashimoto, K.F. AokiKinoshita, N. Ueda, M. Kanehisa and H. Mamitsuka, A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology, ACM Trans Knowl Discov Data 2(1) (2008), 1-30.
17. J. Hein, T. Jiang, L.Wang and K. Zhang, On the complexity of comparing evolutionary trees, In Z. Galil and E. Ukkonen, editors, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, number 937, pages 177-190, Espoo, Finland, 1995. SpringerVerlag, Berlin.
18. M.C.E. Hsieh, Y.H. Wu and A.L.P. Chen, Discovering frequent tree patterns over data streams, In Proceedings of the Sixth SIAM International Conference on Data Mining, April 20-22, 2006, Bethesda, MD, USA. SIAM, 2006.
19. N. Jiang and L. Gruenwald, CFIStream: mining closed frequent itemsets in data streams. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 592-597, 2006.
20. D.E. Knuth, The Art of Computer Programming, Volume 1 (3rd ed.): Fundamental Algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1997.
21. D.E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 4: The: Generating All Trees-History of Combinatorial Generation. AddisonWesley Professional, 2005.
22. H.F. Li, M.K. Shan and S.Y. Lee, Online mining of frequent query trees over XML data streams. In WWW '06: Proceedings of the 15th international conference on World Wide Web, pages 959-960, 2006.
23. T.L. Liu and D. Geiger, Approximate tree matching and shape similarity, In ICCV, pages 456-462, 1999.
24. S. Nijssen and J.N. Kok, Efficient discovery of frequent unordered trees. In First International Workshop on Mining Graphs, Trees and Sequences, pages 55-64, 2003.
25. D. Shasha, J.T.L.Wang and S. Zhang, Unordered tree mining with applications to phylogeny. In ICDE '04: Proceedings of the 20th International Conference on Data Engineering, page 708, Washington, DC, USA, 2004. IEEE Computer Society.
26. G. Song, D. Yang, B. Cui, B. Zheng, Y. Liu and K. Xie, CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data, In Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings, volume 4443 of Lecture Notes in Computer Science, pages 664-675. Springer, 2007.
27. A. Termier, M.C. Rousset and M. Sebag, DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases, In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November 2004, Brighton, UK, pages 543-546. IEEE Computer Society, 2004.
28. G. Valiente, Algorithms on Trees and Graphs, SpringerVerlag, Berlin, 2002.
29. S. Weiss, N. Indurkhya, T. Zhang and F. Damerau, Text Mining: Predictive Methods for Analyzing Unstructured Information, SpringerVerlag, 2004.
30. X. Yan and J. Han, CloseGraph: mining closed frequent graph patterns. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24-27, 2003, pages 286-295, New York, NY, USA, 2003. ACM Press.
31. M.J. Zaki, Efficiently mining frequent trees in a forest. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26, 2002, Edmonton, Alberta, Canada, pages 71-80. ACM, 2002.
32. M.J. Zaki, N. Parimi, N. De, F. Gao, B. Phoophakdee, J. Urban, V. Chaoji, M. Al Hasan and S. Salem, Towards generic pattern mining. In Formal Concept Analysis, Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings, volume 3403 of Lecture Notes in Computer Science, pages 1-20. Springer, 2005.