Maximum Margin Classifiers with Specified False Positive and False Negative Error Rates
J. Saketha Nath, Chiranjib Bhattacharyya · SIAM International Conference on Data Mining · 2007
This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone programming problem. The dual of the formulation leads to a geometric optimization problem, that of computing the distance between two ellipsoids, which is solved by an iterative algorithm. The formulation is extended to non-linear classifiers using kernel methods. The resultant classifiers are applied to the case of classification of unbalanced datasets with asymmetric costs for misclassification. Experimental results on benchmark datasets show the efficacy of the proposed method.
Cited by 55 works. doi:10.1137/1.9781611972771.4
Authors
References
- Statistical Learning Theory
- UCI Repository of machine learning databases
- SMOTE: Synthetic Minority Over-sampling Technique
- Practical Methods of Optimization
- Fast Training of Support Vector Machines Using Sequential Minimal Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Practical Methods of Optimization.
- Addressing the Curse of Imbalanced Training Sets: One-Sided Selection.
- Applications of second-order cone programming
- XVI. Functions of positive and negative type, and their connection the theory of integral equations