Abstract
This paper presents a new similarity metric and algorithm for situations represented as graphs. The metric is based on the concept of shared information, and there is discussion of how this would apply for different forms of similarity—including surface, structural and thematic similarity. An algorithm is presented which will determine the similarity of two conceptual graphs for any given measure of information content, which can, as a result, be used for any similarity measure that is based on the concept of shared information. It therefore allows the very flexible use of domain and application specific factors. While the algorithm is not polynomial time, it is argued that for real examples of a useful size it can give an answer in a reasonable time.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Karl Branting. Integrating Rules and Precedents for Classification and Explanation: Automating Legal Analysis. PhD thesis, The University of Austin at Texas, 1991.
H. Bunke and B. T. Messmer. Similarity measures for structured representations. In First European Workshop on Case-Based Reasoning, Posters and Presentations, Volume 1, pages 26–31, 1993.
Judith P. Dick. A conceptual, case-relation representation of text for intelligent retrieval. PhD thesis, University of Toronto, 1991.
Jon Doyle and Ramesh S. Patil. Two theses of knowledge representation: language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence, 48:261–297, 1991.
Michael R. Garey and David S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman, 1979.
P. E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4:100–107, 1968.
Janet Kolodner. Case-Based Reasoning. Morgan Kaufmann Publishers, Inc., 1993.
George Lakoff. Women, Fire, and Dangerous Things. The University of Chicago Press, 1987.
Debbie Leishman. Analogy as a constrained partial correspondence over conceptual graphs. In Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning, pages 223–234, 1989. Toronto.
Debbie Leishman. An analogical tool: Based in evaluations of partial correspondences over conceptual graphs. In Timothy E.Nagle, Janice A. Nagle, Laurie L. Gerholz, and Peter W. Eklund, editors, Conceptual Structures: Current Research and Practice. Ellis Horwood Workshops, 1992.
James J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software—Practice and Experience, 12:23–34, 1982.
Douglas L. Medin, Robert L. Goldstone, and Dedre Gentner. Respects for similarity. Psychological Bulletin, 100(2):254–278, 1993.
Guy W. Mineau. Normalizing conceptual graphs. In Timothy E Nagle, Janice A. Nagle, Laurie L. Gerholz, and Peter W. Eklund, editors, Conceptual Structures, Current Research and Practice. Ellis Horwood (Series in Workshops), 1992.
Sung H. Myaeng and Aurelio Lopez-Lopez. Conceptual graph matching: a flexible algorithm and experiments. Journal of Experimental and Theoretical Artificial Intelligence, 4:107–126, April–June 1992.
Timothy E. Nagle and John W. Esch. A notation for conceptual structure graph matchers. In Timothy E.Nagle, Janice A. Nagle, Laurie L. Gerholz, and Peter W. Eklund, editors, Conceptual Structures: Current Research and Practice. Ellis Horwood Workshops, 1992.
Jonathan Poole. Similarity in legal case based reasoning as degree of matching between conceptual graphs. In Preprints of the First European Conference on Case Based Reasoning, pages 54–58, 1993.
R. Schank and R. Abelson. Scripts, Plans, Goals and Understanding. Lawrence Erlbaum Associates, Hillsdale, N.J., 1977.
John F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley Pub. Co., 1984.
Anne v. d. L. Gardner. An Artificial Intelligence Approach to Legal Reasoning. The MIT Press, 1987.
W. A. Woods. Understanding subsumption and taxonomy: A framework for progress. In John F. Sowa, editor, Principles of Semantic Networks: Explorations in the Representation of Knowledge. Morgan Kaufmann Publishers Inc., 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poole, J., Campbell, J.A. (1995). A novel algorithm for matching conceptual and related graphs. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_45
Download citation
DOI: https://doi.org/10.1007/3-540-60161-9_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60161-6
Online ISBN: 978-3-540-49539-0
eBook Packages: Springer Book Archive