Abstract
In recent years, various kinds of learning techniques are applied in ontology similarity measuring and ontology mapping algorithms. The essence of these learning tricks is attributed to obtaining obtain a score function which is employed for calculating the similarity between vertices. Since each vertex’s related information is denoted as a p dimensional vector, the similarity between ontology vertices is equivalent to determine the distance between their correspond vectors in the high dimensional space. In this paper, we raise a new ontology learning algorithm for ontology similarity measuring and ontology mapping by means of distance computation for ontology vectors. The optimal ontology distance function is learned in terms of regularization and first-order approaches. Then, two experiments using two different kinds of ontology convex function are presented. The result data show the effectiveness of our new ontology learning algorithm in special engineering applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.