Learning from Dyadic Data
Thomas Hofmann, Jan Puzicha, Michael I. Jordan · 1999
Dyadic data refers to a domain with two finite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises naturally in many application ranging from computational linguistics and information retrieval to preference analysis and computer vision. In this paper, we present a systematic, domain-independent framework of learning from dyadic data by statistical mixturemodels. Our approach covers different models with flat and hierarchical latent class structures. We propose an annealed version of the standard EM algorithm for model fitting which is empirically evaluated on a variety of data sets from different domains.
Cited by 119 works.
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Distributional clustering of English words
- Hierarchical Mixtures of Experts and the EM Algorithm
- Statistical mechanics and phase transitions in clustering
- Aggregate and mixed-order Markov models for statistical language processing
- Statistical Models for Co-occurrence Data
- Unsupervised texture segmentation in a deterministic annealing framework
- Estimating Dependency Structure as a Hidden Variable