Coordinate Descent K-means Algorithm Based on Split-Merge
Source abstract
Abstract
The Coordinate Descent Method for K-means (CDKM) is an improved algorithm of K-means. It identifies better locally optimal solutions than the original K-means algorithm. That is, it achieves solutions that yield smaller objec... | Find, read and cite all the research you need on Tech Science Press
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Face and Expression Recognition · Advanced Algorithms and Applications · Rough Sets and Fuzzy Logic
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (26)
Show source-provided references
1. A direct data-cluster analysis method based on neutrosophic set implication
2. Data clustering: Application and trends10.1007/s10462-022-10325-y ↗
3. A review of image segmentation using clustering methods
4. Plant leaf diseases classification using improved K-means clustering and SVM algorithm for segmentation
5. Application of feature extraction and clustering in mammogram classification using support vector machine
6. Ahmed · Electronics · 2020 · 9
7. K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data10.1016/j.ins.2022.11.139 ↗
8. Data clustering: 50 years beyond K-means10.1016/j.patrec.2009.09.011 ↗
9. Cluster center initialization algorithm for K-means clustering10.1016/j.patrec.2004.04.007 ↗
10. A comparative study of efficient initialization methods for the k-means clustering algorithm10.1016/j.eswa.2012.07.021 ↗
11. Big data: An optimized approach for cluster initialization10.1186/s40537-023-00798-1 ↗
12. ECKM: An improved K-means clustering based on computational geometry10.1016/j.eswa.2022.118862 ↗
13. Layeb · Acta Inform. Prag. · 2023 · 12 · 37910.18267/j.aip.223 ↗
14. k-means++: The advantages of careful seeding
15. A better k-means++ algorithm via local search
16. ImpKmeans: An improved version of the K-means algorithm, by determining optimum initial centroids, based on multivariate kernel density estimation and Kd-tree10.12700/APH.21.2.2024.2.6 ↗
17. Initialization for K-means clustering using Voronoi diagram10.1016/j.protcy.2012.05.061 ↗
18. A new initialization method for k-means clustering
19. Coordinate descent algorithms10.1007/s10107-015-0892-3 ↗
20. H. -J. M. Shi, S. Tu, Y. Xu, and W. Yin, “A primer on coordinate descent algorithms,” 2016, arXiv:1610.00040.
21. Coordinate descent method for k-means
22. Iterative split-and-merge algorithm for VQ codebook generation
23. On the splitting method for VQ codebook generation
24. Efficiency of random swap clustering10.1186/s40537-018-0122-y ↗
25. Ismkhan · Pattern Recognit. · 2018 · 79 · 40210.1016/j.patcog.2018.02.015 ↗
26. An effective and efficient algorithm for k-means clustering with new formulation10.1109/TKDE.2022.3155450 ↗