Sciweavers

334 search results - page 7 / 67
» Boosting with structural sparsity
Sort
View
JMLR
2011
148views more  JMLR 2011»
13 years 3 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
ICML
2010
IEEE
13 years 9 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
14 years 1 months ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao
CVPR
2011
IEEE
13 years 5 months ago
Sparsity-based Image Denoising via Dictionary Learning and Structural Clustering
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
Weisheng Dong, Xin Li
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 2 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang