39 search results - page 3 / 8 » Sparse boosting |
IDEAL
2004
Springer
13 years 10 months ago
2004
Springer
A novel technique is presented to construct sparse regression models based on the orthogonal least square method with boosting. This technique tunes the mean vector and diagonal c...
ICPR
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
NIPS
2004
13 years 6 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
FLAIRS
2008
13 years 7 months ago
2008
Recommendation systems suggest products to users. Collaborative filtering (CF) systems, which base those recommendations on a database of previous ratings by various users and pro...
DAGM
2007
Springer
13 years 9 months ago
2007
Springer
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...