Sciweavers

65 search results - page 11 / 13
» Multi-Objective Programming in SVMs
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
A Minimum Sphere Covering Approach to Pattern Classification
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 formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
ICML
2010
IEEE
13 years 8 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
JMLR
2006
156views more  JMLR 2006»
13 years 7 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
14 years 8 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
ICNC
2005
Springer
14 years 1 months ago
Training Data Selection for Support Vector Machines
Abstract. In recent years, support vector machines (SVMs) have become a popular tool for pattern recognition and machine learning. Training a SVM involves solving a constrained qua...
Jigang Wang, Predrag Neskovic, Leon N. Cooper