Detection of abnormal change in dynamic networks

IDC 1999 - 1999 Information, Decision and Control, Data and Information Fusion Symposium, Signal Processing and Communications Symposium and Decision and Control Symposium: Proceedings

Volumn , Issue , 1999, Pages 557-562

  Showbridge, P ^a   Kraetzl, M ^a   Ray, D ^b  

^a DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^b Russell Offices   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

ABNORMAL CHANGE; DEGREE OF CHANGE; DYNAMIC NETWORK; DYNAMIC NETWORK TOPOLOGY; ERROR-CORRECTING; GRAPH MATCHINGS; PERFORMANCE MONITORING; SIMILARITY MEASURE;

SIGNAL PROCESSING;

EID: 63449131883     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDC.1999.754216     Document Type: Conference Paper

References (16)

1. J.A. Bondy and U.S.R. Murty, "Graph Theory with Applications, " The MacMillan Press, United Kingdom, 1976.
2. D.G. Corneil and C.C. Gotlieb, "An efficient algorithm for graph isomorphism, " Journal of the ACM, Vol 17, 1970, pp. 51-64.
3. J.R. Ullman, "An algorithm for subgraph iso-morphism, " Journal of the ACM, Vol 23, No 1, 1976, pp. 31-42.
4. B. Falkenhainer, K.D. Forbus and D. Gentner, "The structure-mapping engine: Algorithms and examples, " Artificial Intelligence, Vol 41, 1990, pp. 1-63.
5. S.H. Myaeng and A. Lopez-Lopez, "Conceptual graph matching: A flexible algorithm and experiments, " Journal of experimental and Theoretical Artificial Intelligence, Vol 4, April 1992, pp. 107-126.
6. A. Sanil, D. Banks and K. Carley, "Models for evolving fixed node networks: model fitting and model testing, " Social Networks, Vol 17, 1995, pp. 65-81.
7. S. Sarkar and K.L. Boyer, "Quantitative measures of change based on feature organization: eigenvalues and eigenvectors, " Computer Vision and Image Understanding, Vol 71, No 1, July, 1998, pp. 110-136.
8. H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph, " Pattern Recognition Letters, Vol 19, 1998, pp. 255-259.
9. B.T. Messmer and H. Bunke, "A new algorithm for error-Tolerant subgraph isomorphism detection, " IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol 20, No 5, May 1998, pp. 493-504.
10. W.H. Tsai and K.S. FU, "Error-correcting isomorphisms of attributed relational graphs for pattern recognition, " IEEE Transactions on Systems, Man, and Cybernetics, Vol 9, 1979, pp.
11. L.G. Shapiro and R.M. Haralick, "Structural de, scriptions and inexact matching, " IEEE Trans-, actions on Pattern Analysis and Machine Intelligence, Vol 3, 1981, pp. 504-519.
12. E.K. Wong, "Model matching in robot vision by subgraph isomorphism, " Pattern Recognition
13. B.T. Messmer, "Efficient graph matching algorithms for preprocessed model graphs, " PhD Thesis, University of Bern, 1996.
14. N. J. Nilsson, "Principles of Artificial Intelligence, " Morgan Kaufmann, California, 1980.
15. H. Bunke, "On a relation between graph edit distance and maximum common subgraph, " Pattern Recognition Letters, Vol 18, 1997, pp. 689-694.
16. B.T. Messmer and H. Bunke, "Fast error-correcting graph isomorphism based on model precompilation, " International Conference, Image Analysis and Processing, ed. A. Del Bimbo, Italy, September 1997, Springer, pp. 693-700.