DMCA
Learning Latent Groups with Hinge-loss Markov Random Fields
| Citations: | 5 - 3 self |
BibTeX
@MISC{Bach_learninglatent,
author = {Stephen H. Bach and Bert Huang and Lise Getoor},
title = {Learning Latent Groups with Hinge-loss Markov Random Fields},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Probabilistic models with latent variables are powerful tools that can help explain related phenomena by mediating dependencies among them. Learning in the presence of latent variables can be difficult though, because of the difficulty of marginalizing them out, or, more commonly, maximizing a lower bound on the marginal likelihood. In this work, we show how to learn hinge-loss Markov random fields (HL-MRFs) that contain latent variables. HL-MRFs are an expressive class of undirected probabilistic graphical models for which inference of most probable explanations is a convex optimization. By incorporating latent variables into HL-MRFs, we can build models that express rich dependencies among those latent variables. We use a hard expectation-maximization algorithm to learn the parameters of such a model, leveraging fast inference for learning. In our experiments, this combination of inference and learning discovers useful groups of users and hashtags in a Twitter data set. 1.
Keyphrases
latent variable hinge-loss markov random field latent group expressive class probable explanation express rich dependency related phenomenon twitter data set undirected probabilistic graphical model probabilistic model convex optimization hard expectation-maximization algorithm discovers useful group powerful tool fast inference marginal likelihood
