Skip to Main content Skip to Navigation
Conference papers

Transductive Bounds for the Multi-class Majority Vote Classifier

Abstract : In this paper, we propose a transductive bound over the risk of the majority vote classifier learned with partially labeled data for the multi-class classification. The bound is obtained by considering the class confusion matrix as an error indicator and it involves the margin distribution of the classifier over each class and a bound over the risk of the associated Gibbs classifier. When this latter bound is tight and, the errors of the majority vote classifier per class are concentrated on a low margin zone; we prove that the bound over the Bayes classifier' risk is tight. As an application, we extend the self-learning algorithm to the multi-class case. The algorithm iteratively assigns pseudo-labels to a subset of unlabeled training examples that have their associated class margin above a threshold obtained from the proposed transductive bound. Empirical results on different data sets show the effectiveness of our approach compared to the same algorithm where the threshold is fixed manually, to the extension of TSVM to multi-class classification and to a graph-based semi-supervised algorithm.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02414026
Contributor : Vasilii Feofanov <>
Submitted on : Monday, December 16, 2019 - 2:27:23 PM
Last modification on : Monday, April 20, 2020 - 11:24:02 AM

Links full text

Identifiers

Collections

LIG | CNRS | UGA

Citation

Vasilii Feofanov, Emilie Devijver, Massih-Reza Amini. Transductive Bounds for the Multi-class Majority Vote Classifier. Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-2019), Jan 2019, Honolulu, United States. pp.3566-3573, ⟨10.1609/aaai.v33i01.33013566⟩. ⟨hal-02414026⟩

Share

Metrics

Record views

28