Similarity Measure of Graphs

• Main Authors: Amine Labriji, Salma Charkaoui, Issam Abdelbaki, Abdelouhaed Namir, El Houssine Labriji
• Format: Article
• Language: English
• Published: International Association of Online Engineering (IAOE) 2017-07-01
• Series: International Journal of Recent Contributions from Engineering, Science & IT
• Online Access: http://online-journals.org/index.php/i-jes/article/view/7251

<p class="0abstract">The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM), or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.</p>