Ontology-Based K-Means Clustering Algorithm Analysis-Reference-Cited by-同舟云学术

Ontology-Based K-Means Clustering Algorithm Analysis

Published:2013-08-30 Issue: Volume:380-384 Page:1290-1293
ISSN:1662-7482
Container-title:Applied Mechanics and Materials
language:
Short-container-title:AMM

Author:

Guo Qing Ju¹,Ji Wen Tian¹,Zhong Sheng²

Affiliation:

1. Hainan College of Software Technology

2. Hainan University

Abstract

Lots of research findings have been made from home and abroad on clustering algorithm in recent years. In view of the traditional partition clustering method K-means algorithm, this paper, after analyzing its advantages and disadvantages, combines it with ontology-based data set to establish a semantic web model. It improves the existing clustering algorithm in various constraint conditions with the aim of demonstrating that the improved algorithm has better efficiency and accuracy under semantic web.

Publisher

Trans Tech Publications, Ltd.

Link

https://www.scientific.net/AMM.380-384.1290.pdf

Reference9 articles.

1. Basu S. Semi-supervised Clustering Probabilistic Models, Algorithms and Experiments[D]. USA: the Faculty of the Graduate School of The University of Texas at Austin, (2005).

2. SU MC, CHOUCH. A modified version of the K-Means algorithm with a distance based on cluster symmetry[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2001, 23(6): 670-690.

3. Spragins J．Learning without a teacher[J]．IEEE Transactions of Information Theory, 2005, 23(6)：223-230.

4. FENSEL D, LASSILA O, VAN HARMELEN. The semantic Web and its languages[J]. IEEE INTELLIGENT SYSTEMS AND THEIR APPLICATIONS, 2000, 15(67-73).

5. Xu Yifeng Chen Chunming. ONTOLOGY-BASED WEB MINING CLASSIFICATION METHOD AND ITS APPLICATION [J]. Computer Applications and Software, 2009, 26(3): 208-209.