Algorithm of Ontology Similarity Measure Based on Similarity Kernel Learning

  • Zhu Linli Jiangsu University of Technology, School of Computer Engineering, Changzhou, Jiangsu, China
  • Xiaozhong Min Jiangsu University of Technology, School of Computer Engineering, Changzhou, Jiangsu, China
  • Wei Gao Yunnan Normal University, School of Information, Kunming, Yunnan, China
Keywords: Ontology, Similarity measure, Centering kernel, Kernel alignment, Positive Semi-definite Matrix

Abstract

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.

Published
2015-08-25
How to Cite
Linli, Z., Min, X., & Gao, W. (2015). Algorithm of Ontology Similarity Measure Based on Similarity Kernel Learning. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 14(12), 6304-6309. https://doi.org/10.24297/ijct.v14i12.1731
Section
Articles