Advertisement

Measuring the Similarity of Labeled Graphs

  • Pierre-Antoine Champin
  • Christine Solnon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2689)

Abstract

This paper proposes a similarity measure to compare cases represented by labeled graphs. We first define an expressive model of directed labeled graph, allowing multiple labels on vertices and edges. Then we define the similarity problem as the search of a best mapping, where a mapping is a correspondence between vertices of the graphs. A key point of our approach is that this mapping does not have to be univalent, so that a vertex in a graph may be associated with several vertices of the other graph. Another key point is that the quality of the mapping is determined by generic functions, which can be tuned in order to implement domain-dependant knowledge. We discuss some computational issues related to this problem, and we describe a greedy algorithm for it. Finally, we show that our approach provides not only a quantitative measure of the similarity, but also qualitative information which can prove valuable in the adaptation phase of CBR.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnar Aamodt and Enric Plaza. Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications, 7(1):39–59, 1994.Google Scholar
  2. 2.
    Gilles Bisson. Why and How to Define a Similarity Measure for Object Based Representation Systems, pages 236–246. IOS Press, Amsterdam (NL), 1995.Google Scholar
  3. 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.CrossRefGoogle Scholar
  4. 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.Google Scholar
  5. 5.
    Edwin Diday. Éléments d’analyse de données. Dunod, Paris (FR), 1982.zbMATHGoogle Scholar
  6. 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.Google Scholar
  7. 7.
    Jean Lieber and Amedeo Napoli. Using Classification in Case-Based Planning. In proceedings of ECAI 96, pages 132–136, 1996.Google Scholar
  8. 8.
    Jean Lieber and Amedeo Napoli. Correct and Complete Retrieval for Case-Based Problem-Solving. In proceedings of ECAI 98, pages 68–72, 1998.Google Scholar
  9. 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.Google Scholar
  10. 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.CrossRefGoogle Scholar
  11. 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.Google Scholar
  12. 12.
    Christos H. Papadimitriou. Computational complexity. Addison-Wesley, Boston, MA (US), 1994.zbMATHGoogle Scholar
  13. 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.Google Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar
  16. 16.
    John Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. PWS Publishing Co., 1999.Google Scholar
  17. 17.
    Amos Tversky. Features of Similarity. Psychological Review, 84(4):327–352, 1977.CrossRefGoogle Scholar
  18. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Pierre-Antoine Champin
    • 1
  • Christine Solnon
    • 1
  1. 1.LIRIS, bât. NautibusUniversity of Lyon IVilleurbanne cedexFrance

Personalised recommendations