Abstract

In the past ten years, researchers have always attached great importance to the application of ontology to its relevant specific fields. At the same time, applying learning algorithms to many ontology algorithms is also a hot topic. For example, ontology learning technology and knowledge are used in the field of semantic retrieval and machine translation. The field of discovery and information systems can also be integrated with ontology learning techniques. Among several ontology learning tricks, multi-dividing ontology learning is the most popular one which proved to be in high efficiency for the similarity calculation of tree structure ontology. In this work, we study the multi-dividing ontology learning algorithm from the mathematical point of view, and an approximation conclusion is presented under the linear representation assumption. The theoretical result obtained here has constructive meaning for the similarity calculation and concrete engineering applications of tree-shaped ontologies. Finally, linear combination multi-dividing ontology learning is applied to university ontologies and mathematical ontologies, and the experimental results imply that the higher efficiency of the proposed approach in actual applications.

Highlights

  • The term “ontology” was originally used in the field of philosophy, meaning “the essence of things, itself ”, and the abstract nature of real things

  • As a powerful auxiliary tool, the ontology has penetrated into various research fields such as chemistry, genetics, and pharmacy, providing technical support to scientists our linear combination ontology 0.4615 learning algorithm

  • Researchers proposed several multi-dividing ontology learning algorithms, which divide the categories of vertices for multiple branches of the ontology tree structure

Read more

Summary

Introduction

The term “ontology” was originally used in the field of philosophy, meaning “the essence of things, itself ”, and the abstract nature of real things. Since ontology can be regarded as a structured collection of concepts, the inter-relationship between concepts and the structural features of ontology (2020) 9:29 are the essential problems of various applications of ontology, and the semantic similarity calculation between ontology concepts becomes the core of different ontology algorithms

Objectives
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.