Lili Zhu, Yu-- Pan-, Jiangtao Wang
In information science and other engineering applications, ontology plays an irreplaceable role to find the intrinsic semantic link between concepts and to determine the similarity score returned to the user. Ontology mapping aims to excavate the intrinsic semantic relationship between concepts from different ontologies, and the essence of these applications is similarity computation. In this article, we propose the new ontology sparse vector approximation algorithms based on the affine transformation tricks. By means of these techniques, we study the equivalent form of ontology dual problem and determine its feasible set. The simulation experiments imply that our new proposed ontology algorithm has high efficiency and accuracy in ontology similarity computation and ontology mapping in biology, chemical and related fields.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados