Sciweavers

115 search results - page 8 / 23
» Model Selection Through Sparse Maximum Likelihood Estimation
Sort
View
ICA
2010
Springer
13 years 8 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
JMLR
2012
11 years 10 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
TSP
2011
170views more  TSP 2011»
13 years 1 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
RECOMB
2008
Springer
14 years 7 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
ICASSP
2009
IEEE
13 years 5 months ago
Blind sparse source separation for unknown number of sources using Gaussian mixture model fitting with Dirichlet prior
In this paper, we propose a novel sparse source separation method that can be applied even if the number of sources is unknown. Recently, many sparse source separation approaches ...
Shoko Araki, Tomohiro Nakatani, Hiroshi Sawada, Sh...