arXiv Machine Learning
ALPCAHUS: Subspace Clustering for Heteroscedastic Data
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 30
Nonlinear mixture model motivated subspace clustering
arXiv:2606. 29261v1 Announce Type: new Abstract: We derive the linear union-of-subspaces (UoS) model for subspace clustering (SC) from the nonlinear mixture model (NMM) used in blind source separation (BSS) to represent a D-dimensional observation vector as an unknown multivariate nonlinear mapping of C latent variables.
arXiv Machine Learning
Sep 24
Assessing the impact of dimensionality reduction on clustering performance - a systematic study
The paper systematically evaluates how five dimensionality reduction methods—PCA, Kernel PCA, VAE, Isomap, and MDS—affect the performance of four clustering algorithms (k‑means, AHC, GMM, and OPTICS). Using the Adjusted Rand Index, the study compares clustering quality with and without dimensionality reduction at levels of k‑1, 25%, and 50% of the original dimensions. Results highlight that the choice of reduction technique and its level must be carefully matched to the data’s geometry and the clustering algorithm used.
arXiv Machine Learning
Jun 9
Orthogonality and Dimensionality in Airline Cluster Analysis using PCA and Kernel PCA
arXiv:2606. 08322v1 Announce Type: new Abstract: To characterize the US airline profit cycles from 1995 to 2020, the authors of Renold et al.
arXiv Machine Learning
Sep 23
SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA
SuperPCA is a new algorithm for high‑dimensional principal component analysis that exploits an approximate eigenspace of the sample covariance matrix. The authors show that the subspace spanned by several leading eigenvectors contains useful signal information long before individual eigenvectors converge, and they derive posteriori bounds on the angle between this subspace and the true signal subspace. By using only a small number of subsampled coordinates, SuperPCA can achieve up to a ten‑fold improvement in accuracy over classical PCA while reducing data acquisition costs, especially when the signals are approximately sparse.
arXiv Machine Learning
Jul 31
A novel k-means clustering approach using two distance measures for Gaussian data
arXiv:2511. 17823v2 Announce Type: replace Abstract: Clustering algorithms have long been the topic of research, representing the more popular side of unsupervised learning.
arXiv Machine Learning
Aug 17
Connected Subspace Clustering: Hardness, a Scalable Heuristic, and an Application to Sea Level Geodesy
arXiv:2608. 14215v1 Announce Type: new Abstract: Constrained optimization extends classical optimization by integrating side information, making it widely applicable across scientific and engineering domains.