A faster Wasserstein k-means algorithm for histogram data reduces computation and maintains clustering quality.
problem Efficiently clustering histogram data with reduced computation time.
method Sparse simplex projection to reduce data samples, centroids, and ground cost matrix, dynamically removing lower-valued samples.
result Significant reduction in computational complexity without compromising clustering quality.
Proposes Lasso Weighted k-means for sparse clustering of high-dimensional data.
problem Sparse clustering of high-dimensional data with variable feature weights.
method Introduces a lasso-based penalty term on feature weights for sparse clustering without distributional assumptions.
result Establishes strong consistency of the algorithm and competitive performance on real and synthetic datasets.
Simple, scalable sparse k-means for high-dimensional data.
problem Clustering in high-dimensional feature spaces with few relevant features.
method Feature ranking-based sparse k-means algorithm.
result Consistent and convergent sparse k-means clustering.
Proposes ARSK for robust and sparse clustering.
problem Outliers and high-dimensional noisy variables in K-means clustering.
method Introduces redundant error component and group sparse penalty for robustness, and weights and sparsity control penalty for noisy variables.
result Superior performance in identifying clusters without outliers and informative variables.
Sparse clustering, which aims to find a proper partition of an extremely high-dimensional data set with redundant noise features, has been attracted more and more interests in recent years. The existing studies commonly solve the problem in a framework of maximizing the weighted feature contributions subject to a $\ell…
Simpler approach for sparse clustering.
problem Sparse clustering with only useful features.
method Hill-climbing approach to Sparse K-means.
result Competitive with COSA and Sparse K-means.
In many situations where the interest lies in identifying clusters one might expect that not all available variables carry information about these groups. Furthermore, data quality (e.g. outliers or missing entries) might present a serious and sometimes hard-to-assess problem for large and complex datasets. In this pap…
Proposes a semi-supervised K-Means algorithm for better feature selection.
problem Data clustering with unknown feature quality and limited labelled data.
method Combines unsupervised sparse clustering and semi-supervised learning with labelled data.
result The algorithm identifies informative features and maintains high performance.
We compress large data sets by randomly keeping a sparse subset, speeding up PCA and K-means.
problem Processing large data sets efficiently for PCA and K-means.
method Random sampling with randomized preconditioning to create a sparse matrix.
result Our sampling method significantly speeds up PCA and K-means processing.
SIVF k-means algorithm speeds up sparse data clustering.
problem Efficiently clustering large-scale high-dimensional sparse data.
method Inverted-file structure for centroids, filter-based similarity reduction.
result SIVF achieves higher speed and lower memory consumption.
IVF k-means algorithm improves performance on large sparse data sets.
problem Efficiently clustering large-scale sparse data sets with numerous classes.
method Sparse data representation and inverted-file structure for high-speed and low-memory clustering.
result IVF achieves better performance than other algorithms on real document data sets.
Paper proposes an efficient algorithm for clustering with sparse feature selection.
problem Estimating labels and sparse weights in unsupervised clustering.
method Alternating minimization of Frobenius norm criterion with K-sparse algorithm.
result Significantly improves clustering results on single-cell RNA sequencing datasets.
A new framework improves fairness in clustering and Wasserstein Barycenter problems.
problem Fair clustering in datasets with multiple groups.
method Relax and Merge framework for (1+4ρ+O(ε))-approximate solutions. result Improved approximation guarantees for fairness constraints.
QuicK-means accelerates K-means by learning a fast transform.
problem Efficiently clustering large datasets.
method Learning a fast transform of the centroids matrix.
result Significant reduction in computational complexity and training time.
Efficiently clusters noisy signals using structured sparsity and wavelet transforms.
problem Clustering signals with low Signal-to-Noise Ratio (SNR).
method Sparse K-means algorithm with structured sparsity, wavelet multi-scale property, and scattering transform.
result Improved clustering results on real datasets.
Paper accelerates K-means clustering for large sparse document data.
problem Efficiently clustering large-scale sparse document data.
method Designs an AFM algorithm leveraging UCs and inverted-index structure.
result Significantly improves clustering speed for large-scale documents.
A new clustering algorithm REFCMFS improves K-Means efficiency and robustness.
problem Efficiently clustering data with outliers and L0-norm constraints. method REFCMFS uses L2,1-norm robust loss and L0-norm constraint on membership matrix. result REFCMFS achieves more promising performance and efficient optimization.
Proposes a new clustering algorithm for high-dimensional data.
problem Challenges of feature selection in high-dimensional clustering.
method An EM algorithm with lasso-type constraints on cluster pairs.
result Identifies informative features and cluster separability.
New method for community detection in sparse directed SBMs with exact recovery guarantees.
problem Exact recovery in sparse directed SBMs, especially with growing communities.
method Two-stage procedure: neighborhood-smoothing followed by K-means clustering. result Exact recovery of all community labels with probability tending to one under mild sparsity and separation conditions.
Paper identifies sparse structures and communities in heterogeneous graphical models.
problem Detecting community structures in graphical models.
method Novel decomposition into sparse and low-rank parts, three-stage estimation procedure.
result Consistent model selection for adaptive ℓ1 penalized estimator. A framework estimates multiple precision matrices with shared structures.
problem Estimating multiple precision matrices with shared structures.
method Penalized likelihood framework with iterative algorithm alternating between convex and clustering problems.
result The method outperforms competitors and performs similarly to methods using prior information.
Improves classification of microbiome data using mixture distributions.
problem Challenges in classifying sparse and heterogeneous microbiome count data.
method Distance-based classification using mixture distributions.
result The method outperforms existing distance-based classifiers and machine learning approaches.
This paper tackles spatio-temporal information preservation in machine learning.
problem Conventional machine learning assumes orthogonal data attributes, disrupting spatio-temporal information.
method Shift-invariant k-means, convolutional dictionary learning, and spatio-temporal hypercomplex encoding schemes are proposed.
result Gabor feature extraction outperforms convolutional dictionary learning in spatio-temporal information preservation.
Performing signal processing tasks on compressive measurements of data has received great attention in recent years. In this paper, we extend previous work on compressive dictionary learning by showing that more general random projections may be used, including sparse ones. More precisely, we examine compressive K-mean…
Breathing k-means outperforms greedy k-means++ in clustering.
problem Improving k-means clustering solutions.
method Dynamic adjustment of centroids through breathing technique.
result Breathing k-means outperforms other k-means techniques, especially greedy k-means++.
Deep Mixtures of Unigrams improve clustering of high-dimensional sparse text data.
problem Challenging unsupervised classification of very short documents with many terms.
method Developed a deep version of mixtures of Unigrams in a Bayesian framework.
result Deep Mixtures of Unigrams outperform traditional methods in classification accuracy.
Proposes scalable SSC using randomized clustering and multilayer graphs.
problem Inability of SSC to scale to large data sets and robustness issues.
method Randomized hierarchical clustering for anchor points, multilayer graph construction, and k-means clustering. result Significantly improved scalability and robustness on noisy data and close subspaces.
Improved K-Means++ and K-Means∥ with faster run-time.
problem Efficiently selecting initial seeds for K-means clustering.
method Triangle inequality pruning and dynamic priority queue.
result Up to 17x speedup for K-Means++ and 551x for K-Means$\$.
A new t-k-means algorithm improves clustering stability and robustness.
problem Poor performance and instability of standard k-means on heavy-tailed data. method Proposes t-k-means, a robust and stable variant of k-means. result Demonstrates improved stability and robustness on datasets with outliers.
A new K-means method HT K-means uses ℓ0 penalty for sparsity.
problem Cluster center regularization for improved clustering performance.
method HT K-means with ℓ0 penalty for sparsity. result HT K-means outperforms other regularized K-means methods in simulations and real data. Deep k-means learns clustering and features from unlabeled data.
problem Clustering and feature learning from unlabeled data.
method Gradient-estimator for non-differentiable k-means objective via Gumbel-Softmax reparameterisation.
result Concrete k-means model optimised for canonical k-means objective, end-to-end trainable.
Modified K-means ensures local optimality with same complexity.
problem Lack of rigorous analysis on local optimality guarantees of K-means.
method Proposed modifications to K-means ensuring local optimality.
result Proposed methods provide improved locally optimal solutions.
k-means derived from Gaussian mixture models with isotropic Gaussians.
problem Clustering with Gaussian mixture models.
method Truncated variational EM approximations applied to Gaussian Mixture Models.
result k-means is a special case of variational EM for Gaussian Mixture Models.
Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for c…
Paper improves clustering risk bounds for kernel k-means.
problem Improving clustering risk bounds for kernel k-means.
method Analyzes kernel k-means and Nyström approximation.
result Achieves nearly optimal excess clustering risk bound.
Optimizes K-means clustering with PSO for better accuracy.
problem Improving the accuracy of K-means clustering.
method Uses Particle Swarm Optimization (PSO) to find optimal initial centroids for K-means.
result Optimal centroids found using PSO lead to better clustering accuracy.
Ball k-means reduces point-centroid distance computations for faster k-means clustering.
problem Efficiently finding k-means clusters in large datasets.
method Uses a ball to describe clusters, dividing them into stable and active areas, and adjusting points within annulus areas.
result Significantly reduces point-centroid distance computations, making k-means faster and more efficient.
New method speeds up k-means clustering using sketch-and-solve.
problem Efficiently solving k-means clustering for large datasets.
method Sketch-and-solve approach with Peng-Wei semidefinite relaxation.
result Provides high-confidence lower bounds on k-means optimal value.
A new k-means variant minimizes pairwise distances within clusters.
problem The need for improved clustering methods.
method A stochastic optimization procedure that minimizes the k-sums target function.
result The new k-sums method outperforms k-means and its variants.
TS-K-means improves financial data clustering with dynamic time warping.
problem Inadequate handling of temporal dependencies in financial time series data.
method Integrates Dynamic Time Warping into Time Series K-means for financial data.
result TS-K-means outperforms traditional K-means in financial data analysis.
Paper proposes a novel unsupervised feature selection method using K-means and ADMM.
problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.
Paper introduces MLKM for multi-sensor data association in target localization.
problem Data-target association for efficient multi-target localization.
method Multi-layer K-means approach leveraging K-means++, deep neural networks, and backpropagation.
result MLKM outperforms K-means, K-means++, and deep neural networks in data association.
Paper certifies k-means clustering optimality efficiently.
problem Detecting k-means optimality in suboptimal partitions. method Sub-linear Monte Carlo algorithm based on semidefinite relaxation.
result 3-approximation certificate with 99% confidence for mixtures of Gaussians.
DISCERN estimates K for K-Means clustering efficiently.
problem Estimating the number of clusters in data.
method A deterministic initialization method for K-Means++.
result Improves both K estimation and clustering performance.
Enhances k-means++ for semi-supervised clustering with improved performance.
problem Improving k-means++ for semi-supervised clustering.
method Extending k-means++ to incorporate semi-supervised labels.
result Improved theoretical and practical clustering performance.
New *K-means method finds cancer signatures without NMF.
problem Identifying cancer signatures from genome data.
method Applying *K-means clustering to 1,389 cancer samples.
result 3 cancers lack cluster-like structures, 2 have high correlations.
A new k-means method improves clustering accuracy and robustness.
problem Insufficient asymptotic properties in existing k-means methods. method Introducing clustering consistency and proposing a new k-means method. result The new k-means method has lower clustering error rates and is more robust. Two algorithms improve K-means clustering speed without sacrificing quality.
problem Improving clustering quality of K-means while speeding up the process.
method Divisive K-means and Parallel Two-Phase K-means.
result Achieved empirically global optimum clustering results with lower complexity.