Ontology Algorithm Based on Kernel Matrix Optimization Method
Banghuang Peng · Science Technology and Engineering · 2013
Ontology similarity computing and ontology mapping are widely used in query expansion and image retrieval. The core trick for ontology applications is calculating the similarity between vertices in ontology graph,and it has become a hot topic in information science research. The similarity for each pair of vertices can be express as kernel matrix. The optimization model is given according to the fact that adjacent vertices with higher similarity and non-adjacent vertices with lower similarity,and combined with the smoothness of the transfer function. The optimal kernel matrix is obtained by solving this model. This method were employed in biological GO ontology and mathematics ontology,and experiments results show that the new ontology similarity calculation and ontology mapping algorithms have higher efficiency.