The Application of Minimum Spanning Tree Clustering in the Ontology Mapping Pretreatment

Jin Hui Cheng; Wan Long Li; Shan Hong Zheng; Dong Han

doi:10.4028/www.scientific.net/AMM.644-650.2151

Paper Titles

Short-Time Calculation Method of Passenger Flows on Urban Rail Transit Island Platform
p.2133

Study on Experiment Modeling of Human-Gun System
p.2137

Scheduling Algorithm for High-Mobility User in LTE Downlink System
p.2143

Adaptive Clone Selection Algorithm for Function Optimization
p.2147

The Application of Minimum Spanning Tree Clustering in the Ontology Mapping Pretreatment
p.2151

Research on the High-Speed Railway Energy-Saving Operation Strategy Based on Heuristic Algorithm
p.2155

Improved Algorithm Base on Locally Linear Embedding
p.2160

Study on Data Classification and Trend of Association Rules of Time Series
p.2164

An Improved Novel Global Harmony Search Algorithm
p.2169

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650The Application of Minimum Spanning Tree...

The Application of Minimum Spanning Tree Clustering in the Ontology Mapping Pretreatment

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

2151-2154

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.2151

Citation:

Cite this paper

Online since:

September 2014

Authors:

Jin Hui Cheng*, Wan Long Li, Shan Hong Zheng, Dong Han

Keywords:

Clustering, Information Entropy, Minimum Spanning Tree, Ontology-Mapping

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Shvaiki P, Euzenat Je. A survey of schema based matching approaches．Journal on Data SemanticsⅣ, 2005, 3730: 146-171.

Google Scholar

[2] Cui Guangzhao, Cao Lingzhi, Zhang Xuncai, Wang Yanfeng. Research of Density-Based MST Clustering Algorithm[J]. COMPUTER ENGINEERING AND APPLICATIONS, 2006, 42(5): 156-164.

Google Scholar

[3] Yu Liang. Research of Clustering Algorithm Based on Improved Minimum Spanning Trees[D]. Harbin university of science and technology, (2008).

Google Scholar

[4] Jin Xin, Wang Jing, Shen Qiwei. Design and Implementation of Distributed MST Clustering[J]. COMPUTER SYSTEMS & APPLICATIONS, 2011, 20(7): 69-75.

Google Scholar

[5] Wang Xiaole , Liu Qingbao, Lu Changhui, Hou Dongfeng. Minimum Spanning Tree Clustering Algorithm[J]. JOURNAL OF CHINESE COMPUTER SYSTEMS, 2009, 30(5): 877-882.

Google Scholar

[6] Deng Xiaolong, Wang Bai, Wu Bin, Yang Shengqi. Modularity Modeling and Evaluation in Community Detecting of Complex Network Based on Information Entropy[J]. Journal of Computer Research and Development, 2012, 49(4): 725-734.

Google Scholar