[PDF][PDF] K-Means clustering optimization using the elbow method and early centroid determination based-on mean and median

E Umargono, JE Suseno, S Gunawan - Proceedings of the …, 2019 - scitepress.org
The most widely used algorithm in the cluster partitioning method is the K-Means algorithm.
Historically K-Means is still the best grouping algorithm among other grouping algorithms …

K-means clustering optimization using the elbow method and early centroid determination based on mean and median formula

E Umargono, JE Suseno… - The 2nd international …, 2020 - atlantis-press.com
The most widely used algorithm in the cluster partitioning method is the K-Means algorithm,
K-Means is an iteration algorithm with the user determining the number of clusters that need …

Improvement of K-means clustering algorithm with better initial centroids based on weighted average

MS Mahmud, MM Rahman… - 2012 7th International …, 2012 - ieeexplore.ieee.org
Clustering is the process of grouping similar data into a set of clusters. Cluster analysis is
one of the major data analysis techniques and k-means one of the most popular partitioning …

[PDF][PDF] DIMK-means" Distance-based Initialization Method for K-means Clustering Algorithm"

RT Aldahdooh, W Ashour - International Journal of Intelligent …, 2013 - researchgate.net
Partition-based clustering technique is one of several clustering techniques that attempt to
directly decompose the dataset into a set of disjoint clusters. K-means algorithm …

Initialization for K-means clustering using Voronoi diagram

D Reddy, PK Jana, IS Member - Procedia Technology, 2012 - Elsevier
K-Means algorithm is one of the famous partitioning clustering techniques that has been
studied extensively. However, the major problem with this method that it cannot ensure the …

Improving the initial centroids of k-means clustering algorithm to generalize its applicability

M Goyal, S Kumar - Journal of The Institution of Engineers (India): Series B, 2014 - Springer
Abstract k-means is one of the most widely used partition based clustering algorithm. But the
initial centroids generated randomly by the k-means algorithm cause the algorithm to …

Initial centroid selection for K-means clustering algorithm using the statistical method

N Sujatha, LN Valli, A Prema, SK Rathiha… - International Journal of …, 2022 - ijsra.net
An iterative process that converges to one of the many local minima is used in practical
clustering methods. K-means clustering is one of the most well-liked clustering methods. It is …

Study of K-Means and Enhanced K-Means Clustering Algorithm.

SP Singh, A Yadav - International Journal of Advanced …, 2013 - search.ebscohost.com
Data clustering is a process of arranging data into groups or a technique for classifying a
mountain of information into some manageable meaningful piles. The goal of clustering is to …

[PDF][PDF] New fast k-means clustering algorithm using modified centroid selection method

S Sujatha, AS Sona - … of Engineering Research & Technology (IJERT …, 2013 - academia.edu
Cluster analysis is a major technique for classifying a „mountain‟ of information into
manageable meaningful piles. It is a data reduction tool that creates subgroups that are …

[PDF][PDF] Enhancing k-means algorithm with initial cluster centers derived from data partitioning along the data axis with PCA

A Alrabea, AV Senthilkumar, H Al-Shalabi… - Journal of Advances in …, 2013 - academia.edu
Representing the data by smaller amount of clusters necessarily loses certain fine details,
but achieves simplification. The most commonly used efficient clustering technique is k …