Sciweavers

217 search results - page 14 / 44
» Training Hard-Margin Support Vector Machines Using Greedy St...
Sort
View
ESANN
2003
13 years 9 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
IR
2010
13 years 5 months ago
Efficient algorithms for ranking with SVMs
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
Olivier Chapelle, S. Sathiya Keerthi
TNN
2008
182views more  TNN 2008»
13 years 7 months ago
Large-Scale Maximum Margin Discriminant Analysis Using Core Vector Machines
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
Ivor Wai-Hung Tsang, András Kocsor, James T...
INFORMATICASI
2002
91views more  INFORMATICASI 2002»
13 years 7 months ago
Using Image Segmentation as a Basis for Categorization
Image categorization is the problem of classifying images into one or more of several possible categories or classes, which are defined in advance. Classifiers can be trained usin...
Janez Brank
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 5 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic