Sciweavers

836 search results - page 42 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
ICML
2010
IEEE
15 years 1 months ago
High-Performance Semi-Supervised Learning using Discriminatively Constrained Generative Models
We develop a semi-supervised learning method that constrains the posterior distribution of latent variables under a generative model to satisfy a rich set of feature expectation c...
Gregory Druck, Andrew McCallum
291
Voted
ICA
2012
Springer
13 years 8 months ago
Online PLCA for Real-Time Semi-supervised Source Separation
Non-negative spectrogram factorization algorithms such as probabilistic latent component analysis (PLCA) have been shown to be quite powerful for source separation. When training d...
Zhiyao Duan, Gautham J. Mysore, Paris Smaragdis
119
Voted
CIKM
2008
Springer
15 years 2 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
94
Voted
WWW
2008
ACM
16 years 1 months ago
Social and semantics analysis via non-negative matrix factorization
Social media such as Web forum often have dense interactions between user and content where network models are often appropriate for analysis. Joint non-negative matrix factorizat...
Zhi-Li Wu, Chi-Wa Cheng, Chun-hung Li
117
Voted
PAMI
2008
161views more  PAMI 2008»
15 years 15 days ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...