Sciweavers

2712 search results - page 128 / 543
» On learning algorithm selection for classification
Sort
View
149
Voted
KSEM
2009
Springer
15 years 9 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
99
Voted
ICML
2008
IEEE
16 years 3 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
91
Voted
ICML
2003
IEEE
16 years 3 months ago
Incorporating Diversity in Active Learning with Support Vector Machines
In many real world applications, active selection of training examples can significantly reduce the number of labelled training examples to learn a classification function. Differ...
Klaus Brinker
ALT
2004
Springer
15 years 11 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List
ICML
1999
IEEE
15 years 6 months ago
Feature Engineering for Text Classification
Most research in text classification to date has used a “bag of words” representation in which each feature corresponds to a single word. This paper examines some alternative ...
Sam Scott, Stan Matwin