Magnitude preserving based ontology regularization algorithm
Linli Zhu, Yu Pan, Mohammad Reza Farahani, Wei Gao
- Year
- 2017
- Citations
- 4
Abstract
In recent years, the ontology problem has gained attention in machine learning and it has many applications in various fields. Ontology similarity computation plays a critical role in practical implementations. In ontology learning setting, one learns a real-valued score function that assigns score s to ontology vertices. Then, the similarity between vertices is weighted in terms of the difference between their corresponding scores. The purpose of this paper is to report a new ontology learning algorithm for ontology similarity measuring and ontology mapping by means of magnitude preserving. The classes of ontology loss function are considered in regularization ontology framework, the ontology function is supposed to be linear, and the gradient descent implement is presented for getting the optimal ontology function. The result data from our four simulation experiments imply that the new proposed ontology trick has high efficiency and accuracy in biology and plant science with regard to ontology similarity measure, and humanoid robotics and education science with regard to ontology mapping.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991