title: Mixing linear SVMs for nonlinear classification.
abstract: In this paper, we address the problem of combining linear support vector machines (SVMs) for classification of large-scale nonlinear datasets. The motivation is to exploit both the efficiency of linear SVMs (LSVMs) in learning and prediction and the power of nonlinear SVMs in classification. To this end, we develop a LSVM mixture model that exploits a divide-and-conquer strategy by partitioning the feature space into subregions of linearly separable datapoints and learning a LSVM for each of these regions. We do this implicitly by deriving a generative model over the joint data and label distributions. Consequently, we can impose priors on the mixing coefficients and do implicit model selection in a top-down manner during the parameter estimation process. This guarantees the sparsity of the learned model. Experimental results show that the proposed method can achieve the efficiency of LSVMs in the prediction phase while still providing a classification performance comparable to nonlinear SVMs.
authors.affiliation: Australian National University, Canberra ACT, Australia. zhouyu.fu@monash.edu
authors.forename: Zhouyu
authors.initials: Z
authors.lastname: Fu
authors.forename: Antonio
authors.initials: A
authors.lastname: Robles-Kelly
authors.forename: Jun
authors.initials: J
authors.lastname: Zhou
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D002965:Classification / Q000379:methods*; D003198:Computer Simulation; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*