836 search results - page 6 / 168 » Online EM Algorithm for Latent Data Models |
NIPS
2007
13 years 8 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
PKDD
2005
Springer
14 years 6 days ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
WWW
2010
ACM
14 years 1 months ago
2010
ACM
Previous work analyzing social networks has mainly focused on binary friendship relations. However, in online social networks the low cost of link formation can lead to networks w...
JMLR
2010
13 years 1 months ago
2010
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
UAI
1997
13 years 8 months ago
1997
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...