Algorithm of Ontology Similarity Measure Based on Similarity Kernel Learning
Ontology, as a structured conceptual model of knowledge representation and storage, has widely been used in biomedical and pharmaceutical research. The nature of the ontology application is to get the similarity between ontology vertices, and thus reveal the similarity of their corresponding concepts and intrinsic relationships. The similarity for all pairs of vertices forms a similarity matrix of ontology, and the aim of ontology algorithm is to obtain the optimal similarity matrix. In this paper, we propose a new algorithm to get a similarity matrix in terms of learning the optimal similarity kernel function for ontology. The simulation experiment is designed for biology â€œGoâ€ ontology application, and the result data reveal that new algorithm is efficient for such task.
Copyright (c) 2015 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
This work is licensed under a Creative Commons Attribution 4.0 International License.
The author warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author(s).