<p>Classical linear discriminant analysis (LDA) (Fisher, 1936) implicitly assumes the classification boundary depends on only one linear combination of the predictors. This restriction can lead to poor classification in applications where the decision boundary depends on multiple linear combinations of the predictors. To overcome this challenge, the authors first project the predictors onto an envelope central space and then perform LDA based on the sufficient predictor. The performance of the proposed method in improving classification accuracy is demonstrated in both synthetic data and real applications.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Envelope Dimension Reduction with Application to Binary Classification

  • Abdul-Nasah Soale,
  • Yuexiao Dong

摘要

Classical linear discriminant analysis (LDA) (Fisher, 1936) implicitly assumes the classification boundary depends on only one linear combination of the predictors. This restriction can lead to poor classification in applications where the decision boundary depends on multiple linear combinations of the predictors. To overcome this challenge, the authors first project the predictors onto an envelope central space and then perform LDA based on the sufficient predictor. The performance of the proposed method in improving classification accuracy is demonstrated in both synthetic data and real applications.