Sciweavers

39 search results - page 5 / 8
» Sparse boosting
Sort
View
CP
2000
Springer
13 years 11 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 7 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...
WACV
2012
IEEE
12 years 2 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 7 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 7 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