Sciweavers

217 search results - page 23 / 44
» Training Hard-Margin Support Vector Machines Using Greedy St...
Sort
View
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
RECOMB
2005
Springer
14 years 8 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
ICML
2010
IEEE
13 years 8 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
14 years 2 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
KDD
2002
ACM
179views Data Mining» more  KDD 2002»
14 years 8 months ago
Combining clustering and co-training to enhance text classification using unlabelled data
In this paper, we present a new co-training strategy that makes use of unlabelled data. It trains two predictors in parallel, with each predictor labelling the unlabelled data for...
Bhavani Raskutti, Herman L. Ferrá, Adam Kow...