Affiliations: Department of Mathematics and CMSE (Computational Mathematics, Science, and Engineering), Michigan State University, East Lansing, Michigan, USA | Tel.: +1 517 353 9697; E-mail: merkurje@msu.edu
Correspondence:
[*]
Corresponding author: Department of Mathematics and CMSE (Computational Mathematics, Science, and Engineering), Michigan State University, East Lansing, Michigan, USA. Tel.: +1 517 353 9697; E-mail: merkurje@msu.edu.
Abstract: Multiclass data classification, where the goal is to segment data into classes, is an important task in machine learning. However, the task is challenging due to reasons including the scarcity of labeled training data; in fact, most machine learning algorithms require a large amount of labeled examples to perform well. Moreover, the accuracy of a classifier can be dependent on the accuracy of the training labels which can be corrupted. In this paper, we present an efficient and unconditionally stable semi-supervised graph-based method for multiclass data classification which requires considerably less labeled training data to accurately classify a data set compared to current techniques, due to properties such as the embedding of data into a similarity graph. In particular, it performs very well and more accurately than current approaches in the common scenario of few labeled training elements. Morever, we show that the algorithm performs with good accuracy even with a large number of mislabeled examples and is also able to incorporate class size information. The proposed method uses a modified auction dynamics technique. Extensive experiments on benchmark datasets are performed and the results are compared to other methods.
Keywords: Data classification, graphical setting, optimization, auction dynamics, mislabeled data
