A Minimum Sphere Covering Approach to Pattern Classification

Authors:
Jigang Wang;Predrag Neskovic;Leon N. Cooper
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI
Venue:
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Year:
2006

Citing 0
Cited 5

Linear programming minimum sphere set covering for extreme learning machines

Neurocomputing
Semantic force relevance feedback, content-free 3D object retrieval and annotation propagation: bridging the gap and beyond

Multimedia Tools and Applications
Fast and Scalable Local Kernel Machines

The Journal of Machine Learning Research
Signature authentication based on subpattern analysis

Applied Soft Computing
Adaptive weighted fusion of local kernel classifiers for effective pattern classification

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formulate it as an integer programming problem. Using soft threshold functions, we further derive a linear programming problem whose solution gives rise to radial basis function (RBF) classifiers and sigmoid function classifiers. In contrast to traditional RBF and sigmoid function networks, in which the number of units is specified a priori, our method provides a new way to construct RBF and sigmoid function networks that explicitly minimizes the number of base units in the resulting classifiers. Our approach is advantageous compared to SVMs with Gaussian kernels in that it provides a natural construction of kernel matrices and it directly minimizes the number of basis functions. Experiments using real-world datasets demonstrate the competitiveness of our method in terms of classification performance and sparsity of the solution.