Skip to Main content Skip to Navigation
Conference papers

Multiclass SVM with graph path coding regularization for face classification

Abstract : We consider the problem of learning graphs in a sparse multiclass support vector machines framework. For such a problem, sparse graph penalty is useful to select the significant features and interpret the results. Classical ℓ 1 -norm learns a sparse solution without considering the structure between the features. In this paper, a structural knowledge is encoded as directed acyclic graph and a graph path penalty is incorporated to multiclass SVM. The learned classifiers not only improve the performance, but also help in the interpretation of the learned features. The performance of the proposed method highly depends on an initialization graph. Two generic ways to initialize the graph between the features are considered: one is built from similarities while the other one uses Graphical Lasso. The experiments of face classification task on Extended YaleB database verify that: i) graph regularization with multiclass SVM improves the performance and also leads to a more sparse solution compared to ℓ 1 -norm
Document type :
Conference papers
Complete list of metadata

https://hal.mines-ales.fr/hal-03583315
Contributor : Administrateur IMT - Mines Alès Connect in order to contact the contributor
Submitted on : Monday, February 21, 2022 - 5:00:48 PM
Last modification on : Wednesday, February 23, 2022 - 3:05:20 AM

Identifiers

Collections

Citation

Mingyuan Jiu, Nelly Pustelnik, Meriam Chebre, Stefan Janaqi, Philippe Ricoux. Multiclass SVM with graph path coding regularization for face classification. 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP), Sep 2016, Vietri sul Mare, France. pp.1-6, ⟨10.1109/MLSP.2016.7738819⟩. ⟨hal-03583315⟩

Share

Metrics

Record views

5