Fusion of data dimensionality reduction algorithms based on category representation theory
For a long time, people have believed that representation problems are one of the bottlenecks in the field of machine learning. Therefore, it is a long-term and exploratory work to study machine learning representation methods. Due to this, we use category theory to study the fusion representation of data dimensionality reduction. We propose the basic concept of category representation for data dimensionality reduction and provide a data dimensionality reduction fusion representation framework. We have conducted research and analysis on algorithms such as PCA, KPCA, and LDA, identified the essential connection between PCA, KPCA, and LDA and proposed a data dimensionality reduction fusion representation algorithm based on a data dimensionality reduction fusion representation framework. Finally, we demonstrated the feasibility of the proposed method through experiments.
Authors
- Fanzhang Li (ORCID: https://orcid.org/0000-0003-4318-3081)
- Xiaodong Xu (ORCID: https://orcid.org/0000-0003-1953-0450)
- Zhang Li (ORCID: https://orcid.org/0000-0003-1659-0466)
Institutions
- Soochow University (CN)
Publication Details
- Published
- 2025-01-09
- DOI
- https://doi.org/10.1117/12.3055752
- Primary Topic
- Face and Expression Recognition
- Type
- article
- Field-Weighted Citation Impact
- 0.00