Abstract: In machine learning, models are learned from training data with labels denoting the assigned names or classes and features representing characteristics of samples. However, data collection may introduce noise which can significantly impact the performance of these algorithms. In this paper, to take benefits of the computational efficiency of dual support vector machine (SVM) model, first we implement relabeling on the dual SVM problem resulting in a mixed-integer program (MIP) with less variables and constraints compared to the primal relabeled SVM (RESVM) model in the literature. Then we propose another dual SVM-based MIP model called cluster dual RESVM (CDRESVM), wherein instances are relabeled based on their proximity to the nearest class by using binary variables and new set of constraints. Experiments on 10 UCI and 2 Microarray datasets show that the proposed dual SVM-based models exhibit higher accuracy and better learning time compared to the primal SVM models, on the majority of datasets.

Key words: Label noise, SVM, Mixed integer program, Duality