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 …

Unsupervised deep embedding for clustering analysis

J Xie, R Girshick, A Farhadi - International conference on …, 2016 - proceedings.mlr.press
Clustering is central to many data-driven application domains and has been studied
extensively in terms of distance functions and grouping algorithms. Relatively little work has …

Variational deep embedding: An unsupervised and generative approach to clustering

Z Jiang, Y Zheng, H Tan, B Tang, H Zhou - arXiv preprint arXiv …, 2016 - arxiv.org
Clustering is among the most fundamental tasks in computer vision and machine learning. In
this paper, we propose Variational Deep Embedding (VaDE), a novel unsupervised …

Deep clustering via joint convolutional autoencoder embedding and relative entropy minimization

K Ghasedi Dizaji, A Herandi, C Deng… - Proceedings of the …, 2017 - openaccess.thecvf.com
In this paper, we propose a new clustering model, called DEeP Embedded RegularIzed
ClusTering (DEPICT), which efficiently maps data into a discriminative embedding subspace …

Unsupervised discovery of mid-level discriminative patches

S Singh, A Gupta, AA Efros - Computer Vision–ECCV 2012: 12th European …, 2012 - Springer
The goal of this paper is to discover a set of discriminative patches which can serve as a fully
unsupervised mid-level visual representation. The desired patches need to satisfy two …

Unsupervised feature learning by cross-level instance-group discrimination

X Wang, Z Liu, SX Yu - … of the IEEE/CVF conference on …, 2021 - openaccess.thecvf.com
Unsupervised feature learning has made great strides with contrastive learning based on
instance discrimination and invariant mapping, as benchmarked on curated class-balanced …

Image clustering using local discriminant models and global integration

Y Yang, D Xu, F Nie, S Yan… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
In this paper, we propose a new image clustering algorithm, referred to as clustering using
local discriminant models and global integration (LDMGI). To deal with the data points …

Multi-view clustering and feature learning via structured sparsity

H Wang, F Nie, H Huang - International conference on …, 2013 - proceedings.mlr.press
Combining information from various data sources has become an important research topic
in machine learning with many scientific applications. Most previous studies employ kernels …

Spectral embedded adaptive neighbors clustering

Q Wang, Z Qin, F Nie, X Li - IEEE transactions on neural …, 2018 - ieeexplore.ieee.org
Spectral clustering has been widely used in various aspects, especially the machine
learning fields. Clustering with similarity matrix and low-dimensional representation of data …