Detection of Abnormal Change in a Time Series of Graphs

In the management of large enterprise communication networks, it becomes difficult to detect and identify causes of abnormal change in traffic distributions when the underlying logical topology is ...

[1]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[3]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[4]  Kim L. Boyer,et al.  Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors , 1998, Comput. Vis. Image Underst..

[5]  Chelsea C. White,et al.  An analytical approach to the dynamic topology problem , 1994, Telecommun. Syst..

[6]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Horst Bunke,et al.  Recent Advances in Graph Matching , 1997, Int. J. Pattern Recognit. Artif. Intell..

[8]  Bojan Mohar,et al.  Laplace eigenvalues of graphs - a survey , 1992, Discret. Math..

[9]  R. Levinson.  PATTERN ASSOCIATIVITY AND THE RETRIEVAL OF SEMANTIC NETWORKS , 1991 .

[10]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[11]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Stephen Guattery,et al.  On the Quality of Spectral Separators , 1998, SIAM J. Matrix Anal. Appl..

[13]  Kathleen M. Carley,et al.  Models for evolving fixed node networks: model fitting and model testing , 1995 .

[14]  Aurelio López-López,et al.  Conceptual graph matching: a flexible algorithm and experiments , 1992, J. Exp. Theor. Artif. Intell..

[15]  R. Kashyap,et al.  A common basis for similarity measures involving two strings , 1983 .

[16]  Peter N. Yianilos,et al.  Learning String-Edit Distance , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Allan R. Wilks,et al.  Visualizing Network Data , 1995, IEEE Trans. Vis. Comput. Graph..

[19]  Marina Thottan,et al.  Proactive anomaly detection using distributed intelligent agents , 1998, IEEE Netw..

[20]  Esko Ukkonen,et al.  Algorithms for Approximate String Matching , 1985, Inf. Control..

[21]  R. Boutaba,et al.  An outlook on intranet management , 1997 .

[22]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..