486 search results - page 37 / 98 » Boosting and Hard-Core Sets |
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
115
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
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...
123
click to vote
KDD
2004
ACM
16 years 25 days ago
2004
ACM
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...
114
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
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...
234
Voted
PRL
2008
15 years 11 days ago
2008
: Matrix-pattern-oriented Least Squares Support Vector Classifier (MatLSSVC) can directly classify matrix patterns and has a superior classification performance than its vector ver...