2012 7th International Conference on Computer Science &Amp; Education (ICCSE) 2012
DOI: 10.1109/iccse.2012.6295047
|View full text |Cite
|
Sign up to set email alerts
|

An improved K-means algorithm with meliorated initial center

Abstract: K-means algorithm is commonly used in clustering algorithms to find clusters due to its simplicity of implementation and fast execution. However, classical K-means algorithm is sensitive to the initial clustering center. To improve the performance of K-means algorithm,, a new method for initial center selection is presented in the paper. The method first finds the largest cluster, then makes the cluster to split by two data objects which have the maximum distance as the first clustering centers and does the ab… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
3
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 6 publications
0
3
0
1
Order By: Relevance
“…In the next stage, the center point is used in calculations with the kmeans algorithm. This study concludes that calculations with improved km-means produce better center points and have a higher accuracy level than traditional k-means [13].…”
Section: Introductionmentioning
confidence: 65%
See 2 more Smart Citations
“…In the next stage, the center point is used in calculations with the kmeans algorithm. This study concludes that calculations with improved km-means produce better center points and have a higher accuracy level than traditional k-means [13].…”
Section: Introductionmentioning
confidence: 65%
“…Calculate the distance between objects ๐‘ฅ๐‘– and ๐‘ฅ๐‘— with object data in cluster M. If object data in cluster M has a minimum distance to object data๐‘ฅ ๐‘– , then the data is included in cluster X. If the object data in cluster M has a minimum distance to the object data๐‘ฅ ๐‘— , then the data is included in cluster Y [13].…”
Section: Improved K-means Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…Pada metode k-means, pencarian titik pusat awal dilakukan dengan cara acak. Namun pada improved k-means, dilakukan modifikasi pada tahapan algoritma dengan menambahkan beberapa tahapan dalam pencarian titik pusat awal sehingga titik pusat awal ditemukan tanpa pengacakan [13]. Berikut merupakan langkah-langkah dalam algoritma improved k-means:…”
Section: Improved K-meansunclassified