Analyse k-means algorithm and implementing a new clustering algorithm
by H. Parthasarathi Patra; Kommineni Nikitha
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 6, No. 4, 2021

Abstract: Clustering is a technique of machine learning which involves grouping data points. We can use clustering algorithm to cluster each data points into a specific group. K-means algorithm is the most famous and commonly used algorithm for analysis of clusters. The k-means clustering algorithm is a method of partitioning clusters that partition data objects into k different clusters. However, the main drawback of this algorithm is that classical k-means algorithm is mainly sensitive to initial centroids and it is also difficult to determine the total number of clusters. So in order to improve the performance of k-means algorithm, this paper presents a new modified k-means method which uses intra-class distance to cluster the data.

Online publication date: Thu, 13-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com