An enhanced method to compute the similarity between concepts of ontology
This addresses the need for improved similarity measurement in domains like semantic web and information retrieval, but it appears incremental as it builds on existing path-based methods.
The paper tackles the problem of measuring similarity between concepts in ontologies by proposing a method that uses the Dijkstra algorithm to compute the shortest path for semantic distance and similarity, with experimental comparisons to other methods.
With the use of ontologies in several domains such as semantic web, information retrieval, artificial intelligence, the concept of similarity measuring has become a very important domain of research. Therefore, in the current paper, we propose our method of similarity measuring which uses the Dijkstra algorithm to define and compute the shortest path. Then, we use this one to compute the semantic distance between two concepts defined in the same hierarchy of ontology. Afterward, we base on this result to compute the semantic similarity. Finally, we present an experimental comparison between our method and other methods of similarity measuring.