37 search results - page 5 / 8 » On one method of non-diagonal regularization in sparse Bayes... |
ACCV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...