Similarity Measures for Structured Representations

A key concept in case-based reasoning is similarity. In this paper, we first propose a similarity measure for structured representations that is based on graph edit operations. Then we show how this similarity measure can be computed by means of state space search. Subsequently, subgraph isomorphism is considered as a special case of graph similarity and a new efficient algorithm for its detection is proposed. The new algorithm is particularly suitable if there is a large number of library cases being tested against an input graph. Finally, we present experimental results showing the computational efficiency of the proposed approach.

[1]  Paul Thagard,et al.  Analog Wetrieval by Constraint Satisfaction , 1990, Artif. Intell..

[2]  R. E. Seviora,et al.  An evaluation of DRete on CUPID for OPS5 matching , 1989, IJCAI 1989.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Ho Soo Lee,et al.  Match Algorithms for Generalized Rete Networks , 1992, Artif. Intell..

[5]  Oliver Wendel,et al.  Case-Based Reasoning in a Simulation Environment for Biological Neural Networks , 1993, EWCBR.

[6]  M. Richter.  Classification and Learning of Similarity Measures , 1993 .

[7]  Horst Bunke,et al.  A Network Based Approach to Exact and Inexact Graph Matching , 1993 .

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

[9]  Kenneth D. Forbus,et al.  MAC/FAC: A Model of Similarity-Based Retrieval , 1995, Cogn. Sci..

[10]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[11]  Brian Falkenhainer,et al.  The Structure-Mapping Engine: Algorithm and Examples , 1989, Artif. Intell..

[12]  Andrea L. Henke,et al.  Rapid Retrieval Algorithms for Case-Based Reasoning , 1989, IJCAI.

[13]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[14]  Jonathan Poole.  Similarity in Legal Case Based Reasoning as Degree of Matching between Conceptual Graphs: Work in Pr , 1993 .

[15]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[16]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

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

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