Dynamic Supervised Principal Component Analysis for Classification

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.

本文提出一种面向高维空间动态分类的全新框架，旨在解决随时间或其他索引变量不断演化的类别分布问题。研究对传统判别分析技术进行适配调整，以学习针对索引变量的动态决策规则。具体而言，本文提出并研究了一种采用核平滑（kernel smoothing）方法识别最优子空间的新型监督降维手段，并针对线性判别分析（linear discriminant analysis）与二次判别分析（quadratic discriminant analysis）两种场景对该方法展开系统考察。本文通过数值模拟与真实数据实例验证了所提方法的有效性，实验结果表明，该方法在分类准确率与计算效率上均实现了显著提升。本研究为高维数据分类中可扩展性与非静态性两大挑战提供了鲁棒且自适应的解决方案，从而为该领域发展作出贡献。