| 000 | 03630naa a22005297i 4500 | ||
|---|---|---|---|
| 001 | UMUN-OA-20261005-CS-033 | ||
| 003 | local | ||
| 005 | 20261005174811.0 | ||
| 006 | m o d | ||
| 007 | cr|||||||||||| | ||
| 008 | 261005s2020 xx o u000 0 eng d | ||
| 024 | 7 |
_a10.3390/electronics9081295 _2doi |
|
| 035 | _a(local)OpenAlex:W3048804154 | ||
| 040 |
_alocal _beng _clocal |
||
| 041 | 0 | _aeng | |
| 100 | 0 |
_aMohiuddin Ahmed _eauthor. |
|
| 245 | 1 | 4 |
_aThe k-means Algorithm: A Comprehensive Survey and Performance Evaluation / _cMohiuddin Ahmed; Raihan Seraj; Syed Mohammed Shamsul Islam. |
| 264 | 1 |
_a[Place of publication not identified] : _bMultidisciplinary Digital Publishing Institute, _c2020. |
|
| 300 | _a1 online resource (1 article). | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 500 | _aPublication type: Journal article. | ||
| 500 | _aLinked open-access copy: published version. | ||
| 506 | 0 |
_aOpen access; no subscription required for the linked open-access version. _fUnrestricted online access _2star |
|
| 520 | 3 | _aThe k-means clustering algorithm is considered one of the most powerful and popular data mining algorithms in the research community. However, despite its popularity, the algorithm has certain limitations, including problems associated with random initialization of the centroids which leads to unexpected convergence. Additionally, such a clustering algorithm requires the number of clusters to be defined beforehand, which is responsible for different cluster shapes and outlier effects. A fundamental problem of the k-means algorithm is its inability to handle various data types. This paper provides a structured and synoptic overview of research conducted on the k-means algorithm to overcome such shortcomings. Variants of the k-means algorithms including their recent developments are discussed, where their effectiveness is investigated based on the experimental analysis of a variety of datasets. The detailed experimental analysis along with a thorough comparison among different k-means clustering algorithms differentiates our work compared to other existing survey papers. Furthermore, it outlines a clear and thorough understanding of the k-means algorithm along with its different research directions. | |
| 540 |
_aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata). _uhttps://openalex.org/W3048804154 |
||
| 546 | _aIn English. | ||
| 588 | 0 | _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source. | |
| 590 | _aCourse allocation: B. Sc. Computer Science. | ||
| 650 | 4 | _aK-means clustering | |
| 650 | 4 | _acentroid initialization | |
| 650 | 4 | _aoptimal number of clusters | |
| 650 | 4 | _acluster shape | |
| 650 | 4 | _aoutliers | |
| 650 | 4 | _aalgorithm comparison | |
| 653 | _aB. Sc. Computer Science | ||
| 653 | _aUMUN open access collection | ||
| 653 | _aalgorithms | ||
| 655 | 4 | _aJournal articles. | |
| 700 | 0 |
_aRaihan Seraj _eauthor. |
|
| 700 | 0 |
_aSyed Mohammed Shamsul Islam _eauthor. |
|
| 773 | 0 |
_tElectronics _gVol. 9, no. 8, (2020), pages/article 1295 _x2079-9292 |
|
| 856 | 4 | 0 |
_uhttps://www.mdpi.com/2079-9292/9/8/1295/pdf?version=1597814020 _yRead open-access publication _zOpen access. Access and licence reported by the source; this host could not be independently checked by automation. _70 |
| 884 |
_aCourse selection and automated MARC21 enrichment from OpenAlex metadata. _g20261005 _khttps://openalex.org/W3048804154 _qlocal |
||
| 942 | _n0 | ||
| 999 |
_c395 _d395 |
||