Partial multi-dividing ontology learning algorithm

As an effective data representation, storage, management, calculation and model for analysis, ontology has attracted more and more attention by researchers and it has been applied to various engineering disciplines. In the background of big data, the ontology is expected to increase the amount of data information and the structure of its corresponding ontology graph has become more important due to its complexity. It demands that the ontology algorithm must be more efficient than before. In a specific engineering application, the ontology algorithm is required to find in a quick way the semantic matching set of the concept and rank it back to the user according to their similarities. Therefore, to use learning tricks to get better ontology algorithms is an open problem nowadays. The aim of the present paper is to present a partial multi-dividing ontology algorithm with the aim of obtaining an efficient approach to optimize the partial multi-dividing ontology learning model. For doing it we state several theoretical results from a statistical learning theory perspective. Moreover, we present five experiments in different engineering fields to show the precision of our partial multi-dividing algorithm from angles of ontology, similarity measuring and ontology mapping building point of view. (C) 2018 Elsevier Inc. All rights reserved.