Sciweavers

964 search results - page 134 / 193
» Incremental and Decremental Support Vector Machine Learning
Sort
View
TKDE
2010
168views more  TKDE 2010»
14 years 8 months ago
Completely Lazy Learning
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
Eric K. Garcia, Sergey Feldman, Maya R. Gupta, San...
IDEAL
2004
Springer
15 years 3 months ago
Kernel Density Construction Using Orthogonal Forward Regression
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
Sheng Chen, Xia Hong, Chris J. Harris
JMLR
2006
93views more  JMLR 2006»
14 years 9 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
ICML
2007
IEEE
15 years 10 months ago
Minimum reference set based feature selection for small sample classifications
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
Xue-wen Chen, Jong Cheol Jeong
ICML
2008
IEEE
15 years 10 months ago
Robust matching and recognition using context-dependent kernels
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
Hichem Sahbi, Jean-Yves Audibert, Jaonary Rabariso...