Measuring the similarity of labeled graphs

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

Volumn 2689, Issue , 2003, Pages 80-95

  Champin, Pierre Antoine ^a   Solnon, Christine ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY; MAPPING; ALGORITHMS; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING;

COMPUTATIONAL ISSUES; GENERIC FUNCTIONS; GREEDY ALGORITHMS; LABELED GRAPHS; MULTIPLE LABELS; QUALITATIVE INFORMATION; QUANTITATIVE MEASURES; SIMILARITY MEASURE;

CASE BASED REASONING; GRAPH THEORY;

DOMAIN-DEPENDENT KNOWLEDGE; LABELED GRAPHS; SIMILARITY PROBLEMS;

EID: 7044240786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45006-8_9     Document Type: Conference Paper

References (18)

1. Agnar Aamodt and Enric Plaza. Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications, 7(1):39–59, 1994.
2. Gilles Bisson. Why and How to Define a Similarity Measure for Object Based Representation Systems, pages 236–246. IOS Press, Amsterdam (NL), 1995.
3. Horst Bunke. Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE Transaction on Pattern Analysis and Machine Intelligence, 21(9):917–922, 1999.
4. Pierre-Antoine Champin. Modéliser l’expérience pour en assister la réutilisation: de la Conception Assistée par Ordinateur au Web Sémantique. Thèse de doctorat en informatique, Université Claude Bernard, Lyon (FR), 2002.
5. Edwin Diday. Élèments d’analyse de données. Dunod, Paris (FR), 1982.
6. Christophe Irniger and Horst Bunke. Graph Matching: Filtering Large Databases of Graphs Using Decision Trees. In IAPR-TC15 Workshop on Graph-based Representation in Pattern Recognition, pages 239–249, 2001.
7. Jean Lieber and Amedeo Napoli. Using Classification in Case-Based Planning. In proceedings of ECAI 96, pages 132–136, 1996.
8. Jean Lieber and Amedeo Napoli. Correct and Complete Retrieval for Case-Based Problem-Solving. In proceedings of ECAI 98, pages 68–72, 1998.
9. Dekang Lin. An Information-Theoretic Definition of Similarity. In proceedings of ICML 1998, Fifteenth International Conference on Machine Learning, pages 296–304. Morgan Kaufmann, 1998.
10. Bruno T. Messmer and Horst Bunke. A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection. IEEE Transaction on Pattern Analysis and Machine Intelligence, 20(5):493–504, 1998.
11. Philippe Mulhem, Wee Kheng Leow, and Yoong Keok Lee. Fuzzy Conceptual Graphs for Matching Images of Natural Scenes. In proceedings of IJCAI 01, pages 1397–1404, 2001.
12. Christos H. Papadimitriou. Computational complexity. Addison-Wesley, Boston, MA (US), 1994.
13. Sanja Petrovic, Graham Kendall, and Yong Yang. A Tabu Search Approach for Graph-Structured Case Retrieval. In proceedings of STAIRS 02, volume 78 of Frontiers in Artificial Intelligence and Applications, pages 55–64. IOS Press, 2002.
14. Enric Plaza. Cases as terms: A feature term approach to the structured representation of cases. In proceedings of ICCBR95, number 1010 in LNCS, pages 265–276. Springer Verlag, 1995.
15. Barry Smyth and Matk T. Keane. Retrieval and Adaptation in Déjà Vu, a Case-Based Reasoning System for Software Design. In AAAI Fall Symposium on Adaptation of Knowledge for Reuse. AAAI, 1995.
16. John Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. PWS Publishing Co., 1999.
17. Amos Tversky. Features of Similarity. Psychological Review, 84(4):327–352, 1977.
18. Petko Valtchev. Construction automatique de taxonomies pour l’aide à la représentation de connaissances par objets. Thèse de doctorat en informatique, Université Joseph Fourier, Grenoble (FR), 1999.