Approximate Convex Hulls Family for One-Class Classification

In this work, a new method for one-class classification based on the Convex Hull geometric structure is proposed. The new method creates a family of convex hulls able to fit the geometrical shape of the training points. The increased computational cost due to the creation of the convex hull in multiple dimensions is circumvented using random projections. This provides an approximation of the original structure with multiple bi-dimensional views. In the projection planes, a mechanism for noisy points rejection has also been elaborated and evaluated. Results show that the approach performs considerably well with respect to the state the art in one-class classification.

[1]  Benjamin Recht,et al.  Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning , 2008, NIPS.

[2]  Kristin P. Bennett,et al.  Duality and Geometry in SVM Classifiers , 2000, ICML.

[3]  Avrim Blum,et al.  Random Projection, Margins, Kernels, and Feature-Selection , 2005, SLSFS.

[4]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[5]  David M. J. Tax,et al.  One-class classification , 2001 .

[6]  Srimanta Pal,et al.  Neurocomputing Model for Computation of an Approximate Convex Hull of a Set of Points and Spheres , 2007, IEEE Transactions on Neural Networks.

[7]  Xiaofei Zhou,et al.  Kernel subclass convex hull sample selection method for SVM on face recognition , 2010, Neurocomputing.

[8]  B. Bhattacharya.  Application of computational geometry to pattern recognition problems , 1982 .

[9]  Sergios Theodoridis,et al.  A geometric approach to Support Vector Machine (SVM) classification , 2006, IEEE Transactions on Neural Networks.

[10]  Santosh S. Vempala,et al.  The Random Projection Method , 2005, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.

[11]  Mineichi Kudo,et al.  Margin Preserved Approximate Convex Hulls for Classification , 2010, 2010 20th International Conference on Pattern Recognition.

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  Kristin P. Bennett,et al.  Duality, Geometry, and Support Vector Regression , 2001, NIPS.

[14]  Nathalie Japkowicz,et al.  Concept learning in the absence of counterexamples: an autoassociation-based approach to classification , 1999 .