Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams
Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams
复制标题
DOI：
10.1007/978-3-540-71009-7_3
复制
发表时间：
2003-06
期刊：
影响因子：
--
通讯作者：
Tatsuya Asai;K. Abe;Shinji Kawasoe;Hiroki Arimura;S. Arikawa
中科院分区：
文献类型：
--
作者：
Tatsuya Asai;K. Abe;Shinji Kawasoe;Hiroki Arimura;S. Arikawa
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling-semistructured data and patterns as labeled ordered trees, we present an online algorithm StreamT that receives fragments of an unseen possibly infinite semi-structured data in the document order through a data stream, and can return the current set of frequent patterns immediately on request at any time. We give modifications of the algorithm to other online mining models. Furthermore we implement our algorithms in different online models and candidate management strategies, then show empirical analyses to evaluate the algorithms.
