Algorithm of Ontology Similarity Measure Based on Similarity Kernel Learning
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.14, No. 12)Publication Date: 2015-09-22
Authors : Zhu Linli; Xiaozhong Min; Wei Gao;
Page : 6304-6309
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.
Other Latest Articles
- A SURVEY ON PERFORMANCE OF FREE SPACE OPTICAL COMMUNICATION LINK
- A Matrix Iterative Approach to Systematically Generate Hilbert-type Space-filling Curves
- A Feature Vector Compression Approach for Face Recognition using Convolution and DWT
- Discovering Mexican Birth Rate Patterns Using Machine Learning Techniques
- Types of classifier in artificial intelligence
Last modified: 2016-06-29 15:57:59