K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data
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 …
systematic accumulation of large quantities of data at various data-capturing sites. Similarly …
Transforming complex problems into K-means solutions
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 …
applications. Its popularity can be attributed to its simplicity and efficiency. Studies show the …
Unsupervised deep embedding for clustering analysis
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 …
extensively in terms of distance functions and grouping algorithms. Relatively little work has …
Variational deep embedding: An unsupervised and generative approach to clustering
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 …
this paper, we propose Variational Deep Embedding (VaDE), a novel unsupervised …
Deep clustering via joint convolutional autoencoder embedding and relative entropy minimization
In this paper, we propose a new clustering model, called DEeP Embedded RegularIzed
ClusTering (DEPICT), which efficiently maps data into a discriminative embedding subspace …
ClusTering (DEPICT), which efficiently maps data into a discriminative embedding subspace …
Unsupervised discovery of mid-level discriminative patches
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 mid-level visual representation. The desired patches need to satisfy two …
Unsupervised feature learning by cross-level instance-group discrimination
Unsupervised feature learning has made great strides with contrastive learning based on
instance discrimination and invariant mapping, as benchmarked on curated class-balanced …
instance discrimination and invariant mapping, as benchmarked on curated class-balanced …
Image clustering using local discriminant models and global integration
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 …
local discriminant models and global integration (LDMGI). To deal with the data points …
Multi-view clustering and feature learning via structured sparsity
Combining information from various data sources has become an important research topic
in machine learning with many scientific applications. Most previous studies employ kernels …
in machine learning with many scientific applications. Most previous studies employ kernels …
Spectral embedded adaptive neighbors clustering
Spectral clustering has been widely used in various aspects, especially the machine
learning fields. Clustering with similarity matrix and low-dimensional representation of data …
learning fields. Clustering with similarity matrix and low-dimensional representation of data …