Sciweavers

3607 search results - page 31 / 722
» Learning with structured sparsity
Sort
View
TSP
2008
143views more  TSP 2008»
13 years 8 months ago
Sparse Representation in Structured Dictionaries With Application to Synthetic Aperture Radar
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
Kush R. Varshney, Müjdat Çetin, John W...
CVPR
2006
IEEE
14 years 10 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
ICML
2009
IEEE
14 years 8 months ago
Partially supervised feature selection with regularized linear models
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
Thibault Helleputte, Pierre Dupont
ICML
2010
IEEE
13 years 8 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio