Structured cases trees and efficient retrieval

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1488, Issue , 1998, Pages 88-99

  Ricci, Francesco ^a   Senter, Luca ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; SEMANTICS; TREES (MATHEMATICS);

BEST-KNOWN ALGORITHMS; BRANCH AND BOUND TECHNIQUES; CASE RETRIEVAL; CASE STRUCTURES; GRAPH STRUCTURES; SEMANTIC PARTS; SPEED UP; SUBTREE ISOMORPHISM;

CASE BASED REASONING;

EID: 84958651427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0056324     Document Type: Conference Paper

References (19)

1. P. Avesani, A. Perini, mad F. Ricci. Cbet: a case base exploration tool, In Springer-Verlag, editor, Fifth Congress of the Italian Association for Artificial Intelligence (AI*IA 97), Roma (Italy), 1997, September 16-19 1997.
2. K. Börner, E. Pippig, E.-C. Tammer, and K.-H. Coulon. Structural similarity and adaptation. In European Workshop on CBR, Lausanne, 1996.
3. L. K. Braiting. Building explanations from rules and structured cases. International Journal of Man-Machine Studies, 34:797-837, 1991.
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 Reasonin 9, Kaiserslautern, Germany, 1994. Springer-Verlag.
5. 2.5) time algorithms for the subgraph homeomorphism problem in trees. Journal of Algorithms, 8:106-122, 1987.
6. F. Gebhardt, A. Vob, W. Grs and B. Schmidt-Belz. Reasoning with complex cases. Kluwer, 1997.
7. E. K. Jones and A. Roydhouse. Intelligent retrieval of historical meteorological data. AI Applications, 8(3):43-54, 1994.
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.
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.
10. D. W. Matula. Subtree isomorphism in O(nS/2). Ann. Discrete Math., 2:91-106, 1978.
11. J. J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Science, 19:229-250, 1979.
12. E. Plaza. Cases as terms: a feature term approach to the structured representationof cases. In International Conference on Case-Based Reasoning (ICCBR-95), Sesimbra, Portugal, Oct. 23-26. Springer Verlag, 1995.
13. J.-C. Régin. Ddveloppment d'outils algorithmiques pour l'Intelli9ence Artifieielle. applicatin fila chimique organique. Thése de doctorat, Universit~ Montpellier II, 1995.
14. R. J. Schalkoff. Pattern recognition: statistical, structural and neural approaches. John Wiley, 1992.
15. L. Senter. Accoppiamento inesatto di alberi e ragionamento basato su casi. Master's thesis, Univeristh di Padova, Facolts di Ingegneria, 1998.
16. J. Surma. A similarity measure for aggregation taxonomies. In ECML Workshop Notes on Case-Based Learning: Beyond Classification of Feature Vectors, Prague, 1997.
17. E. Tanaka and K. Tanaka. The tree-to-tree editing problem. International Journal of pattern reco9nition and artificial intelligence, 2(2):224-240, 1988.
18. J.R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 1(23):31-42, 1976.
19. J. van Leeuwen. Graphs algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 525-631. Elsevier, 1990.