Enclosing Machine Learning for Class Description

A novel machine learning paradigm, i.e. enclosing machine learning based on regular geometric shapes was proposed. It adopted regular minimum volume enclosing and bounding geometric shapes (sphere, ellipsoid, and box) or their unions and so on to obtain one class description model and thus imitate the human "Cognizing" process. A point detection and assignment algorithm based on the one class description model was presented to imitate the human "Recognizing" process. To illustrate the concept and algorithm, a minimum volume enclosing ellipsoid (MVEE) strategy for enclosing machine learning was investigated in detail. A regularized minimum volume enclosing ellipsoid problem and dual form were presented due to probable existence of zero eigenvalues in regular MVEE problem. To solve the high dimensional one class description problem, the MVEE in kernel defined feature space was presented. A corresponding dual form and kernelized Mahalanobis distance formula was presented. We investigated the performance of the enclosing learning machine via benchmark datasets and compared with support vector machines (SVM).

[1]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[2]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[3]  Bernd Gärtner,et al.  Fast Smallest-Enclosing-Ball Computation in High Dimensions , 2003, ESA.

[4]  Jacek M. Zurada,et al.  Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28 - June 1, 2006, Proceedings, Part I , 2006, International Symposium on Neural Networks.

[5]  Peng Sun,et al.  Computation of Minimum Volume Covering Ellipsoids , 2002, Oper. Res..

[6]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[7]  Nello Cristianini,et al.  On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum , 2002, ALT.

[8]  Piyush Kumar,et al.  Minimum-Volume Enclosing Ellipsoids and Core Sets , 2005 .

[9]  Xunkai Wei,et al.  Comparative Study of Extreme Learning Machine and Support Vector Machine , 2006, ISNN.

[10]  Robert P. W. Duin,et al.  Support vector domain description , 1999, Pattern Recognit. Lett..

[11]  Xunkai Wei,et al.  Enclosing machine learning: concepts and algorithms , 2008, Neural Computing and Applications.

[12]  Wei Xun-kai Fusion Development of Support Vector Machines and Neural Networks , 2005 .

[13]  Johan Efberg,et al.  YALMIP : A toolbox for modeling and optimization in MATLAB , 2004 .

[14]  Joseph S. B. Mitchell,et al.  Approximate minimum enclosing balls in high dimensions using core-sets , 2003, ACM J. Exp. Algorithmics.

[15]  Rina Panigrahy,et al.  Minimum Enclosing Polytope in High Dimensions , 2004, ArXiv.