The Role of Higher-Order Constructs in the Inexact Matching of Semantic Graphs

Inexact pattern matching using semantic graphs has a wideranging use in AI systems, particularly in machine vision, case-based reasoning, and, recently, in intelligence analysis applications. While much previous work in the area has focused on matching simple flat graphs, there is increasing need for and use of complex graphical patterns with higher-order constructs—hierarchical graphs, cardinality constraints, disjunction, and others. This paper reports the results of an experimental analysis of higher-order constructs in graphical patterns and their effect on pattern matching efficiency. The study focuses on two aspects of these constructs—the impact of cardinality constraints on representational power and matching speed, and the benefit of caching hierarchical match results. The analysis shows that both mechanisms provide a significant speedup over conventional flat graph matching.

[1]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[2]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[4]  Norman Y. Foo,et al.  Semantic distance in conceptual graphs , 1992 .

[5]  Horst Bunke,et al.  Similarity Measures for Structured Representations , 1993, EWCBR.

[6]  Barbara Hayes-Roth,et al.  Retrieving semantically distant analogies , 1994 .

[7]  J. A. Campbell,et al.  A Novel Algorithm for Matching Conceptual and Related Graphs , 1995, ICCS.

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

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

[10]  Philip N. Klein,et al.  Recognition of Shapes by Editing Shock Graphs , 2001, ICCV.

[11]  D.J. Cook,et al.  Structural mining of molecular biology data , 2001, IEEE Engineering in Medicine and Biology Magazine.

[12]  H. Chertkow,et al.  Semantic memory , 2002, Current neurology and neuroscience reports.

[13]  Yong Yu,et al.  Conceptual Graph Matching for Semantic Search , 2002, ICCS.

[14]  Neil Immerman,et al.  A Visual Language for Querying and Updating Graphs , 2002 .

[15]  John D. Lowrance,et al.  LAW: A Workbench for Approximate Pattern Matching in Relational Data , 2003, IAAI.

[16]  H. Bunke,et al.  A probabilistic approach to learning costs for graph edit distance , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[17]  Rosina O. Weber,et al.  Investigating Graphs in Textual Case-Based Reasoning , 2004, ECCBR.

[18]  I. Harrison,et al.  Helping intelligence analysts detect threats in overflowing, changing and incomplete information , 2004, Proceedings of the 2004 IEEE International Conference on Computational Intelligence for Homeland Security and Personal Safety, 2004. CIHSPS 2004..

[19]  Sherry Marcus,et al.  Graph-based technologies for intelligence analysis , 2004, CACM.

[20]  Lawrence B. Holder,et al.  Graph-based Relational Learning with Application to Security , 2004, Fundam. Informaticae.