Linear Dimensionality Reduction: What Is Better?
This research paper focuses on dimensionality reduction, which is a major subproblem in any data processing operation. Dimensionality reduction based on principal components is the most used methodology. Our paper examines three heuristics, namely Kaiser’s rule, the broken stick, and the conditional...
Saved in:
| Main Authors: | Mohit Baliyan, Evgeny M. Mirkes |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Data |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2306-5729/10/5/70 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Dimensionality Reduction problem: a Comprehensive Exploration of Disjoint Principal Component Analysis (DPCA) and Disjoint Multiple Correspondence Analysis (DMCA)
by: Mario Fordellone
Published: (2024-04-01) -
SINGULAR VALUE VERSUS EIGENVALUE DECOMPOSITION EFFICIENCY IN COMPUTING PRINCIPAL COMPONENTS FOR DIMENSIONALITY REDUCTION OF LARGE DATASETS
by: Vadim Romanuke
Published: (2025-06-01) -
Enhanced Multilinear PCA for Efficient Image Analysis and Dimensionality Reduction: Unlocking the Potential of Complex Image Data
by: Tianyu Sun, et al.
Published: (2025-02-01) -
Comprehensive review of dimensionality reduction algorithms: challenges, limitations, and innovative solutions
by: Aasim Ayaz Wani
Published: (2025-07-01) -
Exploring the Channels of Financial Inclusion’s Impact on Poverty Reduction in Sub-Saharan Africa
by: Musa Abdullahi Sakanko, et al.
Published: (2025-06-01)