Measuring the similarity of labeled graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Measuring the similarity of labeled graphs


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.
Fichier principal
Vignette du fichier
ICCBR03.pdf (279.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01541469 , version 1 (24-03-2020)



Pierre-Antoine Champin, Christine Solnon. Measuring the similarity of labeled graphs. 5th Int. Conf. On Case-Based Reasoning (ICCBR 2003), Jun 2003, Trondheim (NO), Norway. pp.80-95, ⟨10.1007/3-540-45006-8_9⟩. ⟨hal-01541469⟩
150 View
419 Download



Gmail Facebook Twitter LinkedIn More