836 search results - page 16 / 168 » Online EM Algorithm for Latent Data Models |
NIPS
1998
13 years 8 months ago
1998
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
ICA
2010
Springer
13 years 7 months ago
2010
Springer
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...
SDM
2010
SIAM
13 years 5 months ago
2010
SIAM
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
PAMI
1998
13 years 6 months ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
FTTCS
2006
13 years 6 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...