Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relations
Aaron Schein, Mingyuan Zhou, David Blei, Hanna Wallach
Abstract
We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country–country interaction event data. These data consist of interaction events of the form “country i took action a toward country j at time t.” BPTD discovers overlapping country–community memberships, including the number of latent communities. In addition, it discovers directed community–community interaction networks that are specific to “topics” of action types and temporal “regimes.” We show that BPTD yields an efficient MCMC inference algorithm and achieves better predictive performance than related models. We also demonstrate that it discovers interpretable latent structure that agrees with our knowledge of international relations.
BibTeX
@InProceedings{pmlr-v48-schein16,
title = {Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relations},
author = {Schein, Aaron and Zhou, Mingyuan and Blei, David and Wallach, Hanna},
booktitle = {Proceedings of The 33rd International Conference on Machine Learning},
pages = {2810--2819},
year = {2016},
editor = {Balcan, Maria Florina and Weinberger, Kilian Q.},
volume = {48},
series = {Proceedings of Machine Learning Research},
address = {New York, New York, USA},
month = {20--22 Jun},
publisher = {PMLR},
pdf = {http://proceedings.mlr.press/v48/schein16.pdf},
url = {https://proceedings.mlr.press/v48/schein16.html},
abstract = {We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country–country interaction event data. These data consist of interaction events of the form “country i took action a toward country j at time t.” BPTD discovers overlapping country–community memberships, including the number of latent communities. In addition, it discovers directed community–community interaction networks that are specific to “topics” of action types and temporal “regimes.” We show that BPTD yields an efficient MCMC inference algorithm and achieves better predictive performance than related models. We also demonstrate that it discovers interpretable latent structure that agrees with our knowledge of international relations.}
}