• Home
  • Search
  • A New DC Algorithm for Sparse Optimal Scoring Problem
  • https://doi.org/10.1109/access.2020.2981429Copy DOI Icon

A New DC Algorithm for Sparse Optimal Scoring Problem

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Similar Papers
Abstract

Linear discriminant analysis (LDA) has attracted many attentions as a classical tool for both classification and dimensionality reduction. Classical LDA performs quite well in simple and low dimensional setting while it is not suitable for small sample size data (SSS). Feature selection is an effective way to solve this problem. As a variant of LDA, sparse optimal scoring (SOS) with $\ell _{0}$ -norm regularization is considered in this paper. By using a new continuous nonconvex nonsmooth function to approximate $\ell _{0}$ -norm, we propose a novel difference of convex functions algorithm (DCA) for sparse optimal scoring. The most favorable property of the proposed DCA is its subproblem admits an analytical solution. The effectiveness of the proposed method is validated via theoretical analysis as well as some illustrative numerical experiments.

Loading PDF

Similar Papers
  • Research Article
  • Citations17

DC programming and DCA for sparse optimal scoring problem

  • Jan 06, 2016
  • Neurocomputing
  • Hoai An Le Thi +1
  • Book Chapter
  • Citations17

A New Linear Discriminant Analysis Method to Address the Over-Reducing Problem

  • Jan 01, 2015
  • Huan Wan +3
  • Conference Article
  • Citations12

A hybrid PCA-LDA model for dimension reduction

  • Jul 01, 2011
  • Nan Zhao +2
  • Book Chapter
  • Citations1

Deterministic and Stochastic DCA for DC Programming

  • Jan 01, 2023
  • Hoai An Le Thi +3
  • Conference Article
  • Citations17

Automatic recognition and analysis of human faces and facial expression by LDA using wavelet transform

  • Jan 01, 2012
  • P Marasamy +1
  • Research Article
  • Citations45

Sparse Trace Ratio LDA for Supervised Feature Selection.

  • Apr 01, 2024
  • IEEE Transactions on Cybernetics
  • Zhengxin Li +4
  • Research Article
  • Citations32

Sparse semi-supervised support vector machines by DC programming and DCA

  • Nov 27, 2014
  • Neurocomputing
  • Hoai Minh Le +2
  • Supplementary Content

Regularized Discriminant Analysis Incorporating Prior Knowledge on Gene Functional Groups

  • Jan 01, 2009
  • Open access LMU (Ludwid Maxmilian's Universitat Munchen)
  • Monika Jelizarow
  • Book Chapter
  • Citations1

A DC Programming Approach for Sparse Linear Discriminant Analysis

  • Jan 01, 2014
  • Phan Duy Nhat +2
  • Book Chapter

A DC Programming Approach for Sparse Optimal Scoring

  • Jan 01, 2015
  • Hoai An Le Thi +1
  • Research Article
  • Citations15

Comparison between visual assessments and different variants of linear discriminant analysis to the classification of Raman patterns of inkjet printer inks

  • Mar 23, 2021
  • Forensic Chemistry
  • Patrick Buzzini +2
  • Research Article
  • Citations4

Performance Evaluation of Exponential Discriminant Analysis with Feature Selection for Steganalysis

  • Jan 23, 2012
  • Defence Science Journal
  • Gaurav Rajput +2
  • Research Article
  • Citations31

D.C. programming for sparse proximal support vector machines

  • Aug 14, 2020
  • Information Sciences
  • Guoquan Li +3
  • Research Article

Balance Ratio Sum Versus Maximization Ratio Sum for Linear Discriminant Analysis.

  • Jul 01, 2026
  • IEEE transactions on cybernetics
  • Xiaojun Yang +3
  • Conference Article

<title>Boosting multiple classifiers by hybrid discriminant analysis for face identification</title>

  • Oct 23, 2005
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Jie Yu +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.