Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning

Algorithms for the analysis of graph sequences are proposed in this paper. In particular, we study the problem of recovering missing information and predicting the occurrence of nodes and edges in time series of graphs. Two different recovery schemes are developed. The first scheme uses reference patterns that are extracted from a training set of graph sequences, while the second method is based on decision tree induction. Our work is motivated by applications in computer network analysis. However, the proposed recovery and prediction schemes are generic and can be applied in other domains as well.

[1]  Horst Bunke,et al.  Detection of Abnormal Change in a Time Series of Graphs , 2002, J. Interconnect. Networks.

[2]  Wai Lam,et al.  News Sensitive Stock Trend Prediction , 2002, PAKDD.

[3]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Rainer Schmidt,et al.  Temporal Abstractions and Case-Based Reasoning for Medical Course Data: Two Prognostic Applications , 2001, MLDM.

[5]  Lior Rokach,et al.  CHANGE DETECTION IN CLASSIFICATION MODELS INDUCED FROM TIME SERIES DATA , 2004 .

[6]  Kuniaki Uehara,et al.  Discover Motifs in Multi-dimensional Time-Series Using the Principal Component Analysis and the MDL Principle , 2003, MLDM.

[7]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Abraham Kandel,et al.  Data Mining in Time Series Database , 2004 .

[9]  B. Bollobás.  The evolution of random graphs , 1984 .

[10]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[11]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[12]  Richard J. Povinelli,et al.  A New Temporal Pattern Identification Method for Characterization and Prediction of Complex Time Series Events , 2003, IEEE Trans. Knowl. Data Eng..

[13]  Eamonn J. Keogh,et al.  Segmenting Time Series: A Survey and Novel Approach , 2002 .

[14]  Philip S. Yu,et al.  Mining Asynchronous Periodic Patterns in Time Series Data , 2003, IEEE Trans. Knowl. Data Eng..

[15]  Ambuj K. Singh,et al.  Optimizing similarity search for arbitrary length time series queries , 2004, IEEE Transactions on Knowledge and Data Engineering.

[16]  Sven J. Dickinson,et al.  Introduction to the Special Section on Graph Algorithms in Computer Vision , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Horst Bunke,et al.  Matching graphs with unique node labels , 2004, Pattern Analysis and Applications.

[18]  Nikunj C. Oza.  Multiple Classifier Systems, 6th International Workshop, MCS 2005, Seaside, CA, USA, June 13-15, 2005, Proceedings , 2005, Multiple Classifier Systems.

[19]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[20]  Françoise Fessant,et al.  On the prediction of solar activity using different neural network models , 1996, Annales Geophysicae.

[21]  Abraham Kandel,et al.  Graph-Theoretic Techniques for Web Content Mining , 2005, Series in Machine Perception and Artificial Intelligence.

[22]  Dimitrios Gunopulos,et al.  INDEXING TIME-SERIES UNDER CONDITIONS OF NOISE , 2004 .