Sciweavers

1707 search results - page 9 / 342
» A Boosting Algorithm for Regression
Sort
View
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 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
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 10 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
TIT
2002
164views more  TIT 2002»
13 years 8 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
CIKM
2009
Springer
14 years 3 months 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...
COLT
1999
Springer
14 years 22 days ago
An Adaptive Version of the Boost by Majority Algorithm
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
Yoav Freund