2010 ModelingRelationalEventsviaLate

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Relational data, collapsed Gibbs sampling

Abstract

Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper, we describe a generative model for dyadic events, where each event arises from one of [math]\displaystyle{ C }[/math] latent classes, and the properties of the event (sender, recipient, and type) are chosen from distributions over these entities conditioned on the chosen class. We present two algorithms for inference in this model: an expectation-maximization algorithm as well as a Markov chain Monte Carlo procedure based on collapsed Gibbs sampling. To analyze the model's predictive accuracy, the algorithms are applied to multiple real-world data sets involving email communication, international political events, and animal behavior data.

References

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2010 ModelingRelationalEventsviaLatePadhraic Smyth
Christopher DuBois
Modeling Relational Events via Latent ClassesKDD-2010 Proceedings10.1145/1835804.18359062010