Sciweavers

244 search results - page 14 / 49
» Applications of Regularized Least Squares to Classification ...
Sort
View
ICASSP
2011
IEEE
13 years 11 days ago
Maximum a posteriori based regularization parameter selection
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
Ashkan Panahi, Mats Viberg
CVPR
1999
IEEE
14 years 29 days ago
Efficient Iterative Solution to M-View Projective Reconstruction Problem
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...
Qian Chen, Gérard G. Medioni
JMLR
2010
121views more  JMLR 2010»
13 years 3 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
TSP
2008
166views more  TSP 2008»
13 years 8 months ago
Linear Regression With Gaussian Model Uncertainty: Algorithms and Bounds
In this paper, we consider the problem of estimating an unknown deterministic parameter vector in a linear regression model with random Gaussian uncertainty in the mixing matrix. W...
Ami Wiesel, Yonina C. Eldar, Arie Yeredor
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 9 months ago
Extracting shared subspace for multi-label classification
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
Shuiwang Ji, Lei Tang, Shipeng Yu, Jieping Ye