Unconfused ultraconservative multiclass algorithms - Archive ouverte HAL
Article Dans Une Revue Machine Learning Année : 2015

Unconfused ultraconservative multiclass algorithms

Résumé

We tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago where the proposed approaches to combat the noise revolve around a Per-ceptron learning scheme fed with peculiar examples computed through a weighted average of points from the noisy training set. We propose to build upon these approaches and we introduce a new algorithm called UMA (for Unconfused Multiclass additive Algorithm) which may be seen as a generalization to the multiclass setting of the previous approaches. In order to characterize the noise we use the confusion matrix as a multiclass extension of the classification noise studied in the aforemen-tioned literature. Theoretically well-founded, UMA furthermore displays very good empirical noise robustness, as evidenced by numerical simulations conducted on both synthetic and real data.
Fichier principal
Vignette du fichier
unconfused.pdf (489.57 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01146038 , version 1 (27-04-2015)

Licence

Identifiants

Citer

Ugo Louche, Liva Ralaivola. Unconfused ultraconservative multiclass algorithms. Machine Learning, 2015, Machine learning, 99 (2), pp.351. ⟨10.1007/s10994-015-5490-3⟩. ⟨hal-01146038⟩
103 Consultations
98 Téléchargements

Altmetric

Partager

More