Options
Linear programming (LP)-based two-phase classifier for solving a classification problem with multiple objectives
Date Issued
01-01-2017
Author(s)
Madankumar, Sakthivel
Navya, Pusapati
Indian Institute of Technology, Madras
Gupta, N. Srinivasa
Valarmathi, B.
Abstract
88In this chapter, we consider the development of mixed integer linear programming (MILP)-based classifier and linear programming (LP)-based classifiers for solving a classification problem. The conventional MILP-based/LP-based classifiers generally provide good results in terms of accuracy when the data set is linearly separable. However the challenge is to develop computationally efficient classifiers that can handle data that are not linearly separable. In this chapter, we propose a novel LP-based classifier that can address the classification of such data sets with multiple objectives. The salient contributions of the proposed LP-based two-phase classifier are in terms of treating the decision variables as unrestricted in sign; accounting for the contribution of attributes from their interaction effects and the contribution of attributes from their higher order polynomial degrees; treating the classification threshold/cut-off as a decision variable; converting the bandwidth of boundary of threshold to a crisp boundary with the consideration of multiple objectives; and finally the ability to find a nondominated set of solutions with respect to multiple objectives. Consequently, the proposed LP-based classifier is able to handle data that are not inherently linearly separable, unlike the conventional MILP-based and LP-based classifiers. To evaluate the performance of the proposed classifiers, we consider two data sets that are already available in the literature. We also compare the accuracy of all the proposed LP-based classifiers with the artificial neural networks, and the results indicate that one of the proposed LP-based classifiers (LP-based two-phase classifier) is able to give good results even when the data set is not linearly separable.