Abstract
Determination of the optimal number of clusters, the random selection of the initial centers, the non-detection of non-spherical clusters, and the negative impact of outliers are the main challenges of the K-means algorithm. In this paper, to tackle these issues three simple and intelligent algorithms are proposed by changing the structure of the K-means and K-medoids algorithms. The difference between these algorithms is in the selection of the initial centers and the stop condition. A method has been proposed to obtain the overlap space between the clusters. Using this method, a modified K-means algorithm is developed for the clustering of non-spherical data. These algorithms are designed in a way that they are not sensitive to outliers and can identify clusters having non-spherical shapes. The performance of the proposed methods is illustrated by applying the proposed algorithms to the different data sets and by comparing the results of the algorithms with other methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.