Deterministic Initialization of $k$-means Clustering by Data Distribution Guide
| dc.contributor.author | Chaloemphon Sirikayon | |
| dc.contributor.author | Arit Thammano | |
| dc.date.accessioned | 2026-05-08T19:17:05Z | |
| dc.date.issued | 2022-1-26 | |
| dc.description.abstract | Clustering by the k-means is the most widely used method because of its ease of use. But the disadvantage of the k-means algorithm is that it relies on a random initialization. Therefore, the results obtained from each clustering are not stable depending on the starting point, affecting the results obtained in other applications. This paper, therefore, presents a method for determining the initialization of the k-means algorithm using the Data Distribution Guide (DDG). And use it as an aid in determining the starting point without random. Make the results of clustering always equal. And from the experimental results, We found that the accuracy obtained from clustering using the initialization from this method was good. Compared to the commonly used initialization designation. | |
| dc.identifier.doi | 10.1109/ectidamtncon53731.2022.9720377 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/15843 | |
| dc.publisher | 2022 Joint International Conference on Digital Arts, Media and Technology with ECTI Northern Section Conference on Electrical, Electronics, Computer and Telecommunications Engineering (ECTI DAMT & NCON) | |
| dc.subject | Advanced Clustering Algorithms Research | |
| dc.subject | Data Management and Algorithms | |
| dc.subject | Face and Expression Recognition | |
| dc.title | Deterministic Initialization of $k$-means Clustering by Data Distribution Guide | |
| dc.type | Article |