Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A greedy dimension reduction method for classification problems

Damiano Lombardi 1 Fabien Raphel 1, 2
1 COMMEDIA - COmputational Mathematics for bio-MEDIcal Applications
Inria de Paris, LJLL (UMR_7598) - Laboratoire Jacques-Louis Lions
Abstract : In numerous classification problems, the number of available samples to be used in the classifier training phase is small, and each sample is a vector whose dimension is large. This regime, called high-dimensional/low sample size is particularly challenging when classification tasks have to be performed. To overcome this shortcoming, several dimension reduction methods were proposed. This work investigates a greedy optimisation method that builds a low dimensional classifier input. Some numerical examples are proposed to illustrate the performances of the method and compare it to other dimension reduction strategies.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [44 references]  Display  Hide  Download

https://hal.inria.fr/hal-02280502
Contributor : Damiano Lombardi <>
Submitted on : Friday, September 6, 2019 - 1:46:49 PM
Last modification on : Friday, April 10, 2020 - 5:28:33 PM
Long-term archiving on: : Thursday, February 6, 2020 - 11:06:31 PM

File

preprint.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02280502, version 1

Citation

Damiano Lombardi, Fabien Raphel. A greedy dimension reduction method for classification problems. 2019. ⟨hal-02280502⟩

Share

Metrics

Record views

279

Files downloads

741