Skip to main content
SpringerLink
Log in

Structured cases, trees and efficient retrieval

  • Conference paper
  • First Online:
Book cover Advances in Case-Based Reasoning (EWCBR 1998)

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

Included in the following conference series:

Abstract

A set of efficient algorithms for case retrieval from a case base of trees labeled on both nodes and edges is proposed. They extend the best known algorithm for solving the subtree-isomorphism problem. A branch and bound technique and a general definition of similarity between trees is considered. Both the case structure, i.e. the graph structure, and his semantic part, the labels, is taken into account when evaluating similarity. The comparison with a conventional state-space search algorithm on randomly generated case bases, shows that significant speed up can be obtained.

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. P. Avesani, A. Perini, and F. Ricci. Cbet: a case base exploration tool. In Springer-Verlag, editor, Springer-Verlag, Fifth Congress of the Italian Association for Artificial Intelligence (AI*IA 97), Roma (Italy), 1997, September 16–19 1997.

    Google Scholar 

  2. K. Börner, E. Pippig, E.-C. Tammer, and K.-H. Coulon. Structural similarity and adaptation. In European Workshop on CBR, Lausanne, 1996.

    Google Scholar 

  3. L. K. Braiting. Building explanations from rules and structured cases. International Journal of Man-Machine Studies, 34:797–837, 1991.

    Article  Google Scholar 

  4. H. Bunke and B. Messmer. Similarity measures for structured representations. In S. Wess, K.-D. Althoff, and M. M. Richter, editors, Topics in Case-Based Reasoning, Kaiserslautern, Germany, 1994. Springer-Verlag.

    Google Scholar 

  5. M. Chung. o(n 2.5) time algorithms for the subgraph homeomorphisin problem in trees. Journal of Algorithms, 8:106–122, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Gebhardt, A. Vo\, W. Gräther, and B. Schmidt-Belz. Reasoning with complex cases. Kluwer, 1997.

    Google Scholar 

  7. E. K. Jones and A. Roydhouse. Intelligent retrieval of historical meteorological data. AI Applications, 8(3):43–54, 1994.

    Google Scholar 

  8. P. Katalagarianos and Y. Vassiliou. On the reuse of software: a case-based approach employing a repository. Automated Software Engineering, 2:55–86, 1995.

    Article  Google Scholar 

  9. B. Kettler, J. Hendler, W. A. Anderson, and M. P. Evett. Massively parallel support for case-bases planning. IEEE Expert, pages 8–14, 1994.

    Google Scholar 

  10. D. W. Matula. Subtree isomorphism in O(n 5/2). Ann. Discrete Math., 2:91–106, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Science, 19:229–250, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Plaza. Cases as terms: a feature term approach to the structured representation of cases. In International Conference on Case-Based Reasoning (ICCBR-95), Sesimbra, Portugal, Oct. 23–26. Springer Verlag, 1995.

    Google Scholar 

  13. J.-C. Régin. Développment d'outils algorithmiques pour l'Intelligence Artificielle, applicatin á la chimique organique. Thèse de doctorat, Université Montpellier II, 1995.

    Google Scholar 

  14. R. J. Schalkoff. Pattern recognition: statistical, structural and neural approaches. John Wiley, 1992.

    Google Scholar 

  15. L. Senter. Accoppiamento inesatto di alberi e ragionamento basato su casi. Master's thesis, Univeristá di Padova, Facoltá di Ingegneria, 1998.

    Google Scholar 

  16. J. Surma. A similarity measure for aggregation taxonomies. In ECML Workshop Notes on Case-Based Learning: Beyond Classification of Feature Vectors, Prague, 1997.

    Google Scholar 

  17. E. Tanaka and K. Tanaka. The tree-to-tree editing problem. International Journal of pattern recognition and artificial intelligence, 2(2):224–240, 1988.

    Article  Google Scholar 

  18. J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 1(23):31–42, 1976.

    Article  MathSciNet  Google Scholar 

  19. J. van Leeuwen. Graphs algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 525–631. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto per la Ricerca Scientifica e Tecnologica, via Sommarive, 38050, Povo, TN, Italy

    Francesco Ricci & Luca Senter

Authors
  1. Francesco Ricci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Senter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Barry Smyth Pádraig Cunningham

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ricci, F., Senter, L. (1998). Structured cases, trees and efficient retrieval. In: Smyth, B., Cunningham, P. (eds) Advances in Case-Based Reasoning. EWCBR 1998. Lecture Notes in Computer Science, vol 1488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056324

Download citation

  • DOI: https://doi.org/10.1007/BFb0056324

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64990-8

  • Online ISBN: 978-3-540-49797-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation