3607 search results - page 47 / 722 » Learning with structured sparsity |
NIPS
2001
13 years 9 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
PAA
2010
13 years 6 months ago
2010
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Graphical models are well established in providing compact conditional probability descriptions of complex multivariable interactions. In the Gaussian case, graphical models are d...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...