K-means Clustering Algorithm with Improved Initial Center

Authors:
Chen Zhang;Shixiong Xia
Affiliations:
-;-
Venue:
WKDD '09 Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining
Year:
2009

Citing 0
Cited 6

Optimized k-means clustering with intelligent initial centroid selection for web search using URL and tag contents

Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Duplicate page detection algorithm based on the field characteristic clustering

ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
Inter cluster distance management model with optimal centroid estimation for K-means clustering algorithm

WSEAS TRANSACTIONS on COMMUNICATIONS
Improved k- means clustering algorithm for two dimensional data

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Designing of on line intrusion detection system using rough set theory and Q-learning algorithm

Neurocomputing
Secured obfuscated queries in spatial networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new clustering method based on k-means that have avoided alternative randomness of initial center. This paper focused on K-means algorithm to the initial value of the dependence of k selected from the aspects of the algorithm is improved. First,the initial clustering number is. Second, through the application of the sub-merger strategy the categories were combined.The algorithm does not require the user is given in advance the number of cluster. Experiments on synthetic datasets are presented to have shown significant improvements in clustering accuracy in comparison with the random k-means.