Sciweavers

49 search results - page 5 / 10
» Particle methods for maximum likelihood estimation in latent...
Sort
View
NIPS
2008
13 years 9 months ago
DiscLDA: Discriminative Learning for Dimensionality Reduction and Classification
Probabilistic topic models have become popular as methods for dimensionality reduction in collections of text documents or images. These models are usually treated as generative m...
Simon Lacoste-Julien, Fei Sha, Michael I. Jordan
JMLR
2010
158views more  JMLR 2010»
13 years 2 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
MICCAI
2010
Springer
13 years 5 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
CSDA
2006
98views more  CSDA 2006»
13 years 7 months ago
GS-distributions: A new family of distributions for continuous unimodal variables
The choice of the best-suited statistical distribution for modeling data is not a trivial issue. Unless a sound theoretical background exists for selecting a particular distributi...
J. M. Muiño, Eberhard O. Voit, Albert Sorri...
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...