Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams

In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured 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.

[1]  Kenji Yamanishi,et al.  A unifying framework for detecting outliers and change points from non-stationary time series data , 2002, KDD.

[2]  Hannu Toivonen,et al.  Finding Frequent Substructures in Chemical Compounds , 1998, KDD.

[3]  Hiroki Arimura,et al.  Discovering Frequent Substructures in Large Unordered Trees , 2003, Discovery Science.

[4]  Hiroki Arimura,et al.  Optimized Substructure Discovery for Semi-structured Data , 2002, PKDD.

[5]  Yossi Matias,et al.  DIMACS Series in Discrete Mathematicsand Theoretical Computer Science Synopsis Data Structures for Massive Data , 2007 .

[6]  J W Ballard,et al.  Data on the web? , 1995, Science.

[7]  Heikki Mannila,et al.  Ordered and Unordered Tree Inclusion , 1995, SIAM J. Comput..

[8]  Ronald Saul,et al.  Discrete Sequence Prediction and Its Applications , 2004, Machine Learning.

[9]  Shin-Ichi Nakano,et al.  Efficient generation of plane trees , 2002, Inf. Process. Lett..

[10]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[11]  Hiroki Arimura,et al.  Efficient Substructure Discovery from Large Semi-Structured Data , 2001, IEICE Trans. Inf. Syst..

[12]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[13]  Yusuke Suzuki,et al.  Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents , 2002, PAKDD.

[14]  Christian Hidber,et al.  Association Rule Mining , 2017 .

[15]  Mohammed J. Zaki.  Efficiently mining frequent trees in a forest , 2002, KDD.

[16]  Tadashi Horiuchi,et al.  Graph-Based Induction for General Graph Structured Data , 1999, IFIP Working Conference on Database Semantics.

[17]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[18]  Ke Wang,et al.  Discovering Structural Association of Semistructured Data , 2000, IEEE Trans. Knowl. Data Eng..

[19]  Heikki Mannila,et al.  Discovering Frequent Episodes in Sequences , 1995, KDD.

[20]  Srinivasan Parthasarathy,et al.  Incremental and interactive sequence mining , 1999, CIKM '99.

[21]  Hiroki Arimura,et al.  Online algorithms for mining semi-structured data stream , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..