Complexity 2020:1-11 (2020)

Jin Yi
Community College of Beaver County
The k-means algorithm is sensitive to the outliers. In this paper, we propose a robust two-stage k-means clustering algorithm based on the observation point mechanism, which can accurately discover the cluster centers without the disturbance of outliers. In the first stage, a small subset of the original data set is selected based on a set of nondegenerate observation points. The subset is a good representation of the original data set because it only contains all those points that have a higher density of the original data set and does not include the outliers. In the second stage, we use the k-means clustering algorithm to cluster the selected subset and find the proper cluster centers as the true cluster centers of the original data set. Based on these cluster centers, the rest data points of the original data set are assigned to the clusters whose centers are the closest to the data points. The theoretical analysis and experimental results show that the proposed clustering algorithm has the lower computational complexity and better robustness in comparison with k-means clustering algorithm, thus demonstrating the feasibility and effectiveness of our proposed clustering algorithm.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1155/2020/3650926
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,107
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Automatic Genetic Fuzzy C-Means.Khalid Jebari, Abdelaziz Elmoujahid & Aziz Ettouhami - 2019 - Journal of Intelligent Systems 29 (1):529-539.
Improved FCM Algorithm Based on K-Means and Granular Computing.Zhuang Zhi Yan & Wei Jia Lu - 2015 - Journal of Intelligent Systems 24 (2):215-222.
Finding Clusters and Outliers for Data Sets with Constraints.Yong Shi - 2011 - Journal of Intelligent Systems 20 (1):3-14.
Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method.Jun Ye - 2014 - Journal of Intelligent Systems 23 (3):311-324.


Added to PP index

Total views
2 ( #1,383,433 of 59,067 )

Recent downloads (6 months)
1 ( #511,645 of 59,067 )

How can I increase my downloads?


My notes