Loading...
Please wait, while we are loading the content...
Similar Documents
A Minimum Spanning Tree-Based Method for Initializing the K-Means Clustering Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Yang, Jie Ma, Yunlong Zhang, Xiaorong Li, Stan Z. Zhang, Yang |
| Copyright Year | 2016 |
| Abstract | Abstract—The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degree are regarded as a whole which is used to find the skeleton data points. Furthermore, a distance measure between the skeleton data points with consideration of degree and Euclidean distance is presented. Finally, MST-based initialization method for the k-means algorithm is presented, and the corresponding time complexity is analyzed as well. The presented algorithm is tested on five data sets from the UCI Machine Learning Repository. The experimental results illustrate the effectiveness of the presented algorithm compared to three existing initialization methods. |
| Starting Page | 13 |
| Ending Page | 17 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| Volume Number | 11 |
| Alternate Webpage(s) | http://waset.org/publications/10006049/a-minimum-spanning-tree-based-method-for-initializing-the-k-means-clustering-algorithm |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
