The Application of Minimum Spanning Tree Clustering in the Ontology Mapping Pretreatment
Jin Hui Cheng, Wan Long Li, Shan Hong Zheng, Dong Han · Applied Mechanics and Materials · 2014
Screening candidates is the key step to improve the efficiency of ontology mapping. Minimum spanning tree clustering is one of the important ways of graph clustering algorithm. Defining the related concepts and methods first, according to the characteristics of the ontology file itself, Select graph clustering of minimum spanning tree clustering algorithm, To screening candidates of participate in the concept of mapping, Aiming at the deficiency and improvement of objective function in the algorithm, based on the system information entropy instead of the complicated calculation of similarity to supervise the clustering. To reduce the computational scale and improve the efficiency.