Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.01820 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929716628291584 |
|---|---|
| author | Ouyang, Wenbo Wu, Ruiyang Hao, Ning Zhang, Hao Helen |
| author_facet | Ouyang, Wenbo Wu, Ruiyang Hao, Ning Zhang, Hao Helen |
| contents | This paper introduces a novel framework for dynamic classification in high dimensional spaces, addressing the evolving nature of class distributions over time or other index variables. Traditional discriminant analysis techniques are adapted to learn dynamic decision rules with respect to the index variable. In particular, we propose and study a new supervised dimension reduction method employing kernel smoothing to identify the optimal subspace, and provide a comprehensive examination of this approach for both linear discriminant analysis and quadratic discriminant analysis. We illustrate the effectiveness of the proposed methods through numerical simulations and real data examples. The results show considerable improvements in classification accuracy and computational efficiency. This work contributes to the field by offering a robust and adaptive solution to the challenges of scalability and non-staticity in high-dimensional data classification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01820 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dynamic Supervised Principal Component Analysis for Classification Ouyang, Wenbo Wu, Ruiyang Hao, Ning Zhang, Hao Helen Methodology This paper introduces a novel framework for dynamic classification in high dimensional spaces, addressing the evolving nature of class distributions over time or other index variables. Traditional discriminant analysis techniques are adapted to learn dynamic decision rules with respect to the index variable. In particular, we propose and study a new supervised dimension reduction method employing kernel smoothing to identify the optimal subspace, and provide a comprehensive examination of this approach for both linear discriminant analysis and quadratic discriminant analysis. We illustrate the effectiveness of the proposed methods through numerical simulations and real data examples. The results show considerable improvements in classification accuracy and computational efficiency. This work contributes to the field by offering a robust and adaptive solution to the challenges of scalability and non-staticity in high-dimensional data classification. |
| title | Dynamic Supervised Principal Component Analysis for Classification |
| topic | Methodology |
| url | https://arxiv.org/abs/2411.01820 |