Datum-wise classification. A sequential Approach to sparsity - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Datum-wise classification. A sequential Approach to sparsity

Résumé

We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifying. Datum-Wise Classification extends naturally to multi-class tasks, and we describe a specific case where our inference has equivalent complexity to a traditional linear classifier, while still using a variable number of features. We compare our classifier to classical L 1 regularized linear models (L 1-SVM and LARS) on a set of common binary and multi-class datasets and show that for an equal average number of features used we can get improved performance using our method.
Fichier principal
Vignette du fichier
ecml2011.pdf (361.79 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00772986 , version 1 (11-01-2013)

Identifiants

Citer

Gabriel Dulac-Arnold, Ludovic Denoyer, Philippe Preux, Patrick Gallinari. Datum-wise classification. A sequential Approach to sparsity. ECML PKDD 2011 - European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2011, Athens, Greece. pp.375-390, ⟨10.1007/978-3-642-23780-5_34⟩. ⟨hal-00772986⟩
488 Consultations
271 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More