Sciweavers

486 search results - page 37 / 98
» Boosting and Hard-Core Sets
Sort
View
ICML
2006
IEEE
16 years 6 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
ICML
2004
IEEE
16 years 6 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
16 years 6 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
CIKM
2009
Springer
16 years 17 days ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
PRL
2008
124views more  PRL 2008»
15 years 6 months ago
Matrix-pattern-oriented least squares support vector classifier with AdaBoost
: Matrix-pattern-oriented Least Squares Support Vector Classifier (MatLSSVC) can directly classify matrix patterns and has a superior classification performance than its vector ver...
Zhe Wang, Songcan Chen