Multi-dividing Infinite Push Ontology Algorithm.

Along with the arrival of the era of large amount of data, many machine learning methods have been applied to the ontology similarity calculation and ontology mapping. In this paper, we raise an infinite push model for ontology similarity measuring and ontology mapping in multi-dividing setting. The iterative algorithm and generalization bound are given by virtue of the dual solution for optimization and the trick of covering number approach. Furthermore, the fast ontology algorithm for standard ontology SVM by virtue of infinite push multi-dividing ontology algorithm is obtained. Finally, four experiments presented on various fields verify the efficiency of the new computation model for ontology similarity measuring and ontology mapping applications in multi-dividing setting. [ABSTRACT FROM AUTHOR]