836 search results - page 34 / 168 » Online EM Algorithm for Latent Data Models |
EMNLP
2010
14 years 8 months ago
2010
In this paper, we investigate how modeling content structure can benefit text analysis applications such as extractive summarization and sentiment analysis. This follows the lingu...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
101
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
82
Voted
CIMCA
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...