SHOPCA is computationally tractable, parameter-efficient, and applicable to domains requiring fully unsupervised, geometry-aware dimensionality reduction, and surpasses UMAP on small-sample settings, where iterative neighborhood-based manifold estimation can degrade.
Abstract
In this paper, we propose SHOPCA (Shape Operator-based Principal Component Analysis), a novel method for unsupervised metric learning and dimensionality reduction that incorporates differential geometric information into the covariance structure of classical PCA. SHOPCA regularizes the global covariance matrix using the mean shape operator, defined as the average of the absolute local shape operators estimated from the data manifold, steering principal components toward directions of both maximum variance and informative curvature. A single trace-normalized mixing coefficient $\alpha$ controls the regularization, recovering standard PCA at $\alpha = 0$ and a curvature-driven embedding as $\alpha \to \infty$. We further introduce a fully unsupervised criterion for selecting $\alpha$ based on the spectral eigengap of the regularized covariance matrix, maximizing the relative separation between the top-$d$ and remaining eigenvalues without using class labels. We evaluate SHOPCA on more than 50 real-world benchmark datasets, comparing it with PCA, ISOMAP, and UMAP using Adjusted Rand Index (ARI), Normalized Mutual Information (NMI), Fowlkes-Mallows index (FM), and V-measure. Results show that SHOPCA consistently improves clustering quality over PCA across a broad range of datasets and surpasses UMAP on small-sample settings, where iterative neighborhood-based manifold estimation can degrade. SHOPCA is computationally tractable, parameter-efficient, and applicable to domains requiring fully unsupervised, geometry-aware dimensionality reduction.
This paper replaces the cardinality constraint with a difference-of-convex (DC) penalty and establishes a global error bound to prove that the penalized and constrained formulations share the same global minimizers whenever the penalty parameter exceeds a finite threshold.
Meng Xu, Bo Jiang, Han-Fu Zhang et al.· 0 citations
The bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the $1/\varepsilon^2$ Euclidean rate.
This work presents a new perspective on a specific class of partition-based algorithms for unsupervised discrete clustering in complete finite-dimensional Riemannian manifolds by introducing statistical shape analyses to classify clusters and improve label selection.
Ronaldo Malheiros Gregorio, Charlan Dellon da Silva Alves, Sérgio Assunção Monteiro et al.· Soft Computing - A Fusion of...· 0 citations
We introduce an intrinsic spectral sparsity model for nonparametric density estimation on compact connected Riemannian manifolds. Instead of penalizing coefficients in an arbitrarily chosen Laplace--Beltrami eigenbasis, we group each complete eigenspace and measure the Hilbert norm of its spectral component. The result...
We investigate the geometric fluctuations of principal subspaces for high-dimensional covariance matrices through the squared Frobenius $\sin\Theta$ distance between the sample and population eigenspaces associated with the $r_p$ largest eigenvalues. An explicit first-order expansion and a central limit theorem are est...
Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is introduced, a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity and is competitive with adaptive nearest-neighbor methods.
A. L. M. Levada· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.