2013
DOI: 10.5120/13713-1472
|View full text |Cite
|
Sign up to set email alerts
|

Global K-Means (GKM) Clustering Algorithm: A Survey

Abstract: K-means clustering is a popular clustering algorithm but is having some problems as initial conditions and it will fuse in local minima. A method was proposed to overcome this problem known as Global K-Means clustering algorithm (GKM). This algorithm has excellent skill to reduce the computational load without significantly affecting the solution quality. We studied GKM and its variants and presents a survey with critical analysis. We also proposed a new concept of Faster Global K-means algorithms for Streamed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0
2

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 14 publications
0
3
0
2
Order By: Relevance
“…Determination of the number of this group needs to be done at the beginning [13]. The basic principle of this grouping is the proximity of the material characteristic distance to the initial centroid or what is known as the Euclidean distance [14], [15]. The number of iterations is strongly influenced by the selection of the initial centroid which was chosen randomly [16].…”
Section: Methodsmentioning
confidence: 99%
“…Determination of the number of this group needs to be done at the beginning [13]. The basic principle of this grouping is the proximity of the material characteristic distance to the initial centroid or what is known as the Euclidean distance [14], [15]. The number of iterations is strongly influenced by the selection of the initial centroid which was chosen randomly [16].…”
Section: Methodsmentioning
confidence: 99%
“…Nilai K yang dipilih menjadi pusat awal, akan dihitung dengan menggunakan rumus Euclidean Distance yaitu mencari jarak terdekat antara titik centroid dengan data/objek. Data yang memiliki jarak pendek atau terdekat dengan centroid akan membentuk sebuah cluster [9]. Dengan demikian sesuai dengan penelitian yang dilakukan oleh S, Kapil, dkk [8], bisa diujikan pada penelitian ini untuk mengelompokkan data penjualan laris, cukup laris dan kurang laris.…”
Section: Interpretasi Dan Evaluasiunclassified
“…[19], Beigi [20], Agrawal ve ark. [21] [24]. Her ne kadar KO++ yöntemi KO yöntemini güçlendirse de istenilen seviyede değildir.…”
Section: Materyal Ve Metotunclassified