836 search results - page 89 / 168 » Online EM Algorithm for Latent Data Models |
120
Voted
WSOM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
122
Voted
NIPS
2008
15 years 2 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
114
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
103
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
124
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...