K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data

AM Ikotun, AE Ezugwu, L Abualigah, B Abuhaija… - Information …, 2023 - Elsevier
Advances in recent techniques for scientific data collection in the era of big data allow for the
systematic accumulation of large quantities of data at various data-capturing sites. Similarly …

Transforming complex problems into K-means solutions

H Liu, J Chen, J Dy, Y Fu - IEEE transactions on pattern …, 2023 - ieeexplore.ieee.org
K-means is a fundamental clustering algorithm widely used in both academic and industrial
applications. Its popularity can be attributed to its simplicity and efficiency. Studies show the …

Assessing generative models via precision and recall

MSM Sajjadi, O Bachem, M Lucic… - Advances in neural …, 2018 - proceedings.neurips.cc
Recent advances in generative modeling have led to an increased interest in the study of
statistical divergences as means of model comparison. Commonly used evaluation …

[HTML][HTML] Prediction of geological characteristics from shield operational parameters by integrating grid search and K-fold cross validation into stacking classification …

T Yan, SL Shen, A Zhou, X Chen - Journal of Rock Mechanics and …, 2022 - Elsevier
This study presents a framework for predicting geological characteristics based on
integrating a stacking classification algorithm (SCA) with a grid search (GS) and K-fold cross …

[HTML][HTML] Object detection algorithm based on improved YOLOv3

L Zhao, S Li - Electronics, 2020 - mdpi.com
The 'You Only Look Once'v3 (YOLOv3) method is among the most widely used deep
learning-based object detection methods. It uses the k-means cluster method to estimate the …

Unsupervised specific emitter identification method using radio-frequency fingerprint embedded InfoGAN

J Gong, X Xu, Y Lei - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
Machine learning approaches are becoming increasingly popular to improve the efficiency
of specific emitter identification (SEI). However, in most non-cooperative SEI scenarios …

A fast adaptive k-means with no bounds

S Xia, D Peng, D Meng, C Zhang, G Wang… - IEEE Transactions on …, 2020 - par.nsf.gov
This paper presents a novel accelerated exact k-means called as" Ball k-means" by using
the ball to describe each cluster, which focus on reducing the point-centroid distance …

Practical coreset constructions for machine learning

O Bachem, M Lucic, A Krause - arXiv preprint arXiv:1703.06476, 2017 - arxiv.org
We investigate coresets-succinct, small summaries of large data sets-so that solutions found
on the summary are provably competitive with solution found on the full data set. We provide …

Ball -Means: Fast Adaptive Clustering With No Bounds

S Xia, D Peng, D Meng, C Zhang… - IEEE transactions on …, 2020 - ieeexplore.ieee.org
This paper presents a novel accelerated exact-means called as “Ball-means” by using the
ball to describe each cluster, which focus on reducing the point-centroid distance …

Collaborative annealing power k-means++ clustering

H Li, J Wang - Knowledge-Based Systems, 2022 - Elsevier
Clustering is the most fundamental technique for data processing. This paper presents a
collaborative annealing power k-means++ clustering algorithm by integrating the k-means++ …