An enhanced method to compute the similarity between concepts of ontology

TL;DR

This paper introduces an improved method for measuring semantic similarity between concepts in ontologies using Dijkstra's algorithm to compute shortest paths, enhancing accuracy in semantic distance calculations.

Contribution

The paper proposes a novel similarity measurement approach leveraging Dijkstra's algorithm for shortest path computation in ontologies, improving semantic similarity assessment.

Findings

Our method outperforms existing similarity measures in accuracy.

Experimental results show better correlation with human judgments.

The approach is computationally efficient for large ontologies.

Abstract

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.