Multi-instance classification through spherical separation and VNS

A two-class classification problem is considered where the objects to be classified are bags of instances in d-space. The classification rule is defined in terms of an open d-ball. A bag is labeled positive if it meets the ball and labeled negative otherwise. Determining the center and radius of the ball is modeled as a SVM-like margin optimization problem. Necessary optimality conditions are derived leading to a polynomial algorithm in fixed dimension. A VNS type heuristic is developed and experimentally tested. The methodology is extended to classification by several balls and to more than two classes.

[1]  Gabriela Csurka,et al.  Visual categorization with bags of keypoints , 2002, eccv 2004.

[2]  Robert Tibshirani,et al.  Classification by Pairwise Coupling , 1997, NIPS.

[3]  F. Plastria,et al.  Building separating concentric balls to solve a multi-instance classification problem , 2008 .

[4]  Yixin Chen,et al.  MILES: Multiple-Instance Learning via Embedded Instance Selection , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[6]  Yong Shi,et al.  Multi-instance classification based on regularized multiple criteria linear programming , 2012, Neural Computing and Applications.

[7]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[8]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[9]  Joachim M. Buhmann,et al.  Ellipsoidal Multiple Instance Learning , 2013, ICML.

[10]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[11]  Thomas Hofmann,et al.  Support Vector Machines for Multiple-Instance Learning , 2002, NIPS.

[12]  Emilio Carrizosa,et al.  On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification , 2007, INFORMS J. Comput..

[13]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[14]  Ron Kohavi,et al.  A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection , 1995, IJCAI.

[15]  Thomas G. Dietterich,et al.  Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..

[16]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[17]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[18]  Emilio Carrizosa,et al.  Supervised classification and mathematical optimization , 2013, Comput. Oper. Res..

[19]  Edward W. Wild,et al.  Multiple Instance Classification via Successive Linear Programming , 2008 .

[20]  Chih-Jen Lin,et al.  A Comparison of Methods for Multi-class Support Vector Machines , 2015 .

[21]  Chih-Jen Lin,et al.  A comparison of methods for multiclass support vector machines , 2002, IEEE Trans. Neural Networks.

[22]  Yixin Chen,et al.  Image Categorization by Learning and Reasoning with Regions , 2004, J. Mach. Learn. Res..

[23]  A. Atiya,et al.  Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2005, IEEE Transactions on Neural Networks.

[24]  Frank Plastria,et al.  Alternating local search based VNS for linear classification , 2010, Ann. Oper. Res..

[25]  Hsin-Chia Fu,et al.  An EM based multiple instance learning method for image classification , 2008, Expert Syst. Appl..

[26]  Zhi-Hua Zhou,et al.  Solving multi-instance problems with classifier ensemble based on constructive clustering , 2007, Knowledge and Information Systems.

[27]  Robert P. W. Duin,et al.  Multiple-instance learning as a classifier combining problem , 2013, Pattern Recognit..

[28]  Annabella Astorino,et al.  DC models for spherical separation , 2010, J. Glob. Optim..

[29]  Panos M. Pardalos,et al.  Multiple instance learning via margin maximization , 2010 .