Skip to main content
SpringerLink
Log in

Similarity measures for structured representations

  • Selected Papers
  • Conference paper
  • First Online:
Book cover Topics in Case-Based Reasoning (EWCBR 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 837))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bunke and G. Allerman. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 4:245–253, 1983.

    Google Scholar 

  2. B. Falkenhainer, K.D. Forbus, and D. Gentner. The structure-mapping engine: Algorithms and examples. Artificial Intelligence, 41:1–63, 1989/90.

    Google Scholar 

  3. C.L. Forgy. Rete, a fast algorithm for the many pattern / many object pattern match problem. In Artificial Intelligence, volume 19, pages 17–37. Elvesier, 1982.

    Google Scholar 

  4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman and Company, 1979.

    Google Scholar 

  5. D. Gentner and K.D. Forbus. Mac/Fac: A model of similarity based retrieval. In Proceedings of the Thirteenth Annual Conference of the Cognitive Science Society, volume III, pages 504–509, 1983.

    Google Scholar 

  6. M. A. Kelly and R. E. Seviora. An evaluation of DRETE on CUPID for OPS5 matching. In 11'th International Joint Conference on Artificial Intelligence, volume 1, pages 84–90, 1989.

    Google Scholar 

  7. H.S. Lee and M.I. Schor. Match algorithms for generalized Rete networks. Artificial Intelligence, pages 255–270, 1992.

    Google Scholar 

  8. F. Maurer. Similarity based retrieval of interpretation models. In M.M. Richter, S.Wess, K.-D. Althoff, and F. Maurer, editors, Preproceedings: First European Workshop on Case-Based Reasoning, pages 366–370, 1993.

    Google Scholar 

  9. B.T. Messmer and H. Bunke. A network based approach to exact and inexact graph matching. Technical Report IAM-93-021, University of Berne, September 1993.

    Google Scholar 

  10. S.H. Myaeng and A. Lopez-Lopez. Conceptual graph matching: a flexible algorithm and experiments. Journal of Experimental and Theoretical Artificial Intelligence, 4:107–126, April 1992.

    Google Scholar 

  11. A. Napoli. Finding strategies in organic synthesis planning with case-based reasoning. In M.M. Richter, S.Wess, K.-D. Althoff, and F. Maurer, editors, Preproceedings: First European Workshop on Case-Based Reasoning, pages 221–226, 1993.

    Google Scholar 

  12. N.J. Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.

    Google Scholar 

  13. J. Poole. Similarity in legal case based reasoning as degree of matching in conceptual graphs. In MM. Richter, S.Wess, K.-D. Althoff, and F. Maurer, editors, Preproceedings: First European Workshop on Case-Based Reasoning, pages 54–58, 1993.

    Google Scholar 

  14. M.M. Richter. Classification and learning of similarity measures. In Opitz, Klausen, and Klar, editors, Studies in Classification, Data Analysis and Knowledge Organisation. Springer Verlag, 1992.

    Google Scholar 

  15. J.F. Sowa. Conceptual structures: Information Processing in Mind and Machine. Addison-Wesley, 1984.

    Google Scholar 

  16. R.H. Stottler, A.L. Henke, and J.A. King. Rapid retrieval algorithms for case based reasoning. In Proceedings of the 11'th International Conference on Artificial Intelligence IJCAI-89, pages 233–237, Detroit, Michigan, 1989.

    Google Scholar 

  17. P. Thagard, K.J. Holyoak, G. Nelson, and D. Gochfeld. Analog retrieval by constraint satisfaction. Artificial Intelligence, 46:259–310, 1990.

    Google Scholar 

  18. J.R. Ullman. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1):31–42, 1976.

    Google Scholar 

  19. R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168–173, 1974.

    Google Scholar 

  20. O. Wendel. Case based reasoning in a simulation environment for biological neural networks. In M.M. Richter, S.Wess, K.-D. Althoff, and F. Maurer, editors, Preproceedings: First European Workshop on Case-Based Reasoning, pages 221–226, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und angewandte Mathematik, Universität Bern, Länggassstr. 51, CH-3012, Bern, Switzerland

    H. Bunke & B. T. Messmer

Authors
  1. H. Bunke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. T. Messmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Wess Klaus-Dieter Althoff Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bunke, H., Messmer, B.T. (1994). Similarity measures for structured representations. In: Wess, S., Althoff, KD., Richter, M.M. (eds) Topics in Case-Based Reasoning. EWCBR 1993. Lecture Notes in Computer Science, vol 837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58330-0_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-58330-0_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58330-1

  • Online ISBN: 978-3-540-48655-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation