Sciweavers

74 search results - page 8 / 15
» Learning sparse metrics via linear programming
Sort
View
CVPR
2008
IEEE
13 years 9 months ago
Classification via semi-Riemannian spaces
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptu...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
UAI
2008
13 years 9 months ago
Feature Selection via Block-Regularized Regression
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
Seyoung Kim, Eric P. Xing
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ICASSP
2009
IEEE
14 years 2 months ago
Sparse source separation from orthogonal mixtures
This paper addresses source separation from a linear mixture under two assumptions: source sparsity and orthogonality of the mixing matrix. We propose efficient sparse separation...
Moshe Mishali, Yonina C. Eldar
CORR
2008
Springer
234views Education» more  CORR 2008»
13 years 7 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk