A minimum sphere covering approach to pattern classification

Proceedings - International Conference on Pattern Recognition

Volumn 3, Issue , 2006, Pages 433-436

  Jigang, Wang ^a   Neskovic, Predrag ^a   Cooper, Leon N ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING PROBLEMS; RADIAL BASIS FUNCTION (RBF) CLASSIFIERS; SIGMOID FUNCTION CLASSIFIERS; SOFT THRESHOLD FUNCTIONS;

DATA REDUCTION; FUNCTION EVALUATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

IMAGE CLASSIFICATION;

EID: 34147179423     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2006.102     Document Type: Conference Paper

References (6)

1. B.E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Computational Learing Theory, pages 144-152, 1992.
2. V. Chvátal, A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4:233-235, 1979.
3. M. R. Garey and D. S. Johnson. Computers and Intractability A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 1979.
4. N. Littlestone and M. Warmuth, Relating data compression and learnability. Technical report, University of California, Santa Cruz, 1986.
5. D. L. Reilly, L. N. Cooper, and C. Elbaum. A neural model for category learning. Biological Cybernetics, 45:35-41, 1982.
6. V. N. Vapnik. Statistical Learning Theory. Wiley, New York, NY, 1998.