255 search results - page 7 / 51 » Generalized Boosting Algorithms for Convex Optimization |
101
Voted
CSB
2004
IEEE
15 years 3 months ago
2004
IEEE
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
BMVC
2010
14 years 9 months ago
2010
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
ML
2007
ACM
14 years 11 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
SODA
1996
ACM
15 years 27 days ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
127
Voted
JMLR
2012
13 years 2 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...