Mathematical Theory and Applications ›› 2024, Vol. 44 ›› Issue (4): 100-115.doi: 10.3969/j.issn.1006-8074.2024.04.007

Previous Articles     Next Articles

A Sparse Optimal Scoring Model with Adherent Penalty

Hou Dandan, Liu Yongjin*   

  1. School of Mathematics and Statistics, Fuzhou University, Fuzhou 350108, China
  • Online:2024-12-28 Published:2025-01-21
  • Contact: Liu Yongjin
  • Supported by:
    This work is supported by the National Natural Science Foundation of China (No. 12271097), the Key Program of National Science Foundation of Fujian Province of China (No. 2023J02007), the Central Guidance on Local Science and Technology Development Fund of Fujian Province (No. 2023L3003), and the Fujian Alliance of Mathematics (No. 2023SXLMMS01)

Abstract: We consider the task of binary classification in the high-dimensional setting where the number of features of the given data is larger than the number of observations. To accomplish this task, we propose an adherently penalized optimal scoring (APOS) model for simultaneously performing discriminant analysis and feature selection. In this paper, an efficient algorithm based on the block coordinate descent (BCD) method and the SSNAL algorithm is developed to solve the APOS approximately. The convergence results of our method are also established. Numerical experiments conducted on simulated and real datasets demonstrate that the proposed model is more efficient than several sparse discriminant analysis methods.

Key words: Sparse discriminant analysis, Optimal scoring, Feature selection, BCD method, SSNAL algorithm