aiqbench analysis
This systematic study evaluates how five dimensionality reduction techniques—including PCA, Kernel PCA, and VAEs—affect the performance of four major clustering algorithms across varying data geometries. The research provides actionable guidance for practitioners on selecting optimal preprocessing levels tailored to specific algorithmic requirements rather than relying on generic heuristics. By quantifying the trade-offs between reduced feature sets and clustering quality metrics like ARI, the work clarifies best practices for handling high-dimensional data in unsupervised learning pipelines.
Assessing the impact of dimensionality reduction on clustering performance - a systematic study
arXiv:2604.22099v3 Announce Type: replace Abstract: Dimensionality reduction is a critical preprocessing step for clustering high-dimensional data, yet comprehensive evaluation of its impact across diverse methods and data types remains limited. In this study, we systematically assess the influence of five dimensionality reduction techniques - Principal Component Analysis (PCA), Kernel Principal Component Analysis (Kernel PCA), Variational Autoencoder (VAE), Isometric Mapping (Isomap), and Multidimensional Scaling (MDS) - on the performance of four popular clustering algorithms - k-means, Agglomerative Hierarchical Clustering (AHC), Gaussian Mixture Models (GMM), and Ordering Points to Identify the Clustering Structure (OPTICS). We evaluate clustering quality using the Adjusted Rand Index (ARI), comparing results without and with dimensionality reduction at different reduction levels recommended in the literature (i.e., k-1, where k is the number of clusters, and 25% and 50% of the original number of dimensions). Our findings underscore the importance of a careful selection of the dimensionality reduction technique and the dimensionality reduction level that should be tailored to intrinsic data geometry and clustering algorithm(s) under consideration.
Abstract:Dimensionality reduction is a critical preprocessing step for clustering high-dimensional data, yet comprehensive evaluation of its impact across diverse methods and data types remains limited. In this study, we systematically assess the influence of five dimensionality reduction techniques - Principal Component Analysis (PCA), Kernel Principal Component Analysis (Kernel PCA), Variational Autoencoder (VAE), Isometric Mapping (Isomap), and Multidimensional Scaling (MDS) - on the performance of four popular clustering algorithms - k-means, Agglomerative Hierarchical Clustering (AHC), Gaussian Mixture Models (GMM), and Ordering Points to Identify the Clustering Structure (OPTICS). We evaluate clustering quality using the Adjusted Rand Index (ARI), comparing results without and with dimensionality reduction at different reduction levels recommended in the literature (i.e., k-1, where k is the number of clusters, and 25% and 50% of the original number of dimensions). Our findings underscore the importance of a careful selection of the dimensionality reduction technique and the dimensionality reduction level that should be tailored to intrinsic data geometry and clustering algorithm(s) under consideration.
Machine Learning (cs.LG)
arXiv:2604.22099 [cs.LG]
(or arXiv:2604.22099v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2604.22099 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 255 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

Concrete Evaluations to Investigate the OpenAI Model That Hacked Hugging Face
AI Alignment Forum · Aug 3, 2026
TopiCLEAR: Adaptive embedding clustering for interpretable topic discovery from short texts
arXiv · Aug 28, 2026
Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms
arXiv · Aug 28, 2026