nips nips2012 nips2012-219 nips2012-219-reference knowledge-graph by maker-knowledge-mining

219 nips-2012-Modelling Reciprocating Relationships with Hawkes Processes


Source: pdf

Author: Charles Blundell, Jeff Beck, Katherine A. Heller

Abstract: We present a Bayesian nonparametric model that discovers implicit social structure from interaction time-series data. Social groups are often formed implicitly, through actions among members of groups. Yet many models of social networks use explicitly declared relationships to infer social structure. We consider a particular class of Hawkes processes, a doubly stochastic point process, that is able to model reciprocity between groups of individuals. We then extend the Infinite Relational Model by using these reciprocating Hawkes processes to parameterise its edges, making events associated with edges co-dependent through time. Our model outperforms general, unstructured Hawkes processes as well as structured Poisson process-based models at predicting verbal and email turn-taking, and military conflicts among nations. 1


reference text

[1] Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griffiths, Takeshi Yamada, and Naonori Ueda. Learning systems of concepts with an infinite relational model. AAAI, 2006.

[2] Zhao Xu, Volker Tresp, Kai Yu, and Hans-Peter Kriegel. Infinite hidden relational models. Uncertainty in Artificial Intelligence (UAI), 2006.

[3] Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg, and Eric P. Xing. Mixed membership stochastic blockmodel. Journal of Machine Learning Research, 9:1981–2014, 2008.

[4] Konstantina Palla, David A. Knowles, and Zoubin Ghahramani. An infinite latent attribute model for network data. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012. July 2012.

[5] Alan G. Hawkes. Point spectra of some self-exciting and mutually-exciting point processes. Journal of the Royal Statistical Society. Series B (Methodological), 58:83–90, 1971.

[6] Alan G. Hawkes. Point spectra of some mutually-exciting point processes. Journal of the Royal Statistical Society. Series B (Methodological), 33(3):438–443, 1971.

[7] John F. C. Kingman. Poisson Processes. Oxford University Press, 1993.

[8] Alan G. Hawkes and David Oakes. A cluster process representation of a self-exciting process. Journal of Applied Probability, 11(3):493–503, 1974.

[9] David Oakes. The Markovian self-exciting process. Journal of Applied Probability, 12(1):69– 77, 1975.

[10] Aleskandr Simma and Michael I. Jordan. Modeling events with cascades of poisson processes. Uncertainty in Artificial Intelligence (UAI), 2010.

[11] Radford M. Neal. Markov chain sampling methods for Dirichlet process mixture models. Technical Report 9815, University of Toronto, 1998.

[12] Radford M. Neal. Slice sampling. Annals of Statistics, 31(3):705767, 2003.

[13] Uri Nodelman, Christian R. Shelton, and Daphne Koller. Continuous time Bayesian networks. Uncertainty in Artificial Intelligence (UAI), 2002.

[14] Shyamsundar Rajaram, Thore Graepel, and Ralf Herbrich. Poisson-networks: A model of structured point processes. Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS), 2005.

[15] Asela Gunawardana, Christopher Meek, and Puyang Xu. A model for temporal dependencies in event streams. Neural Information Processing Systems (NIPS), 2011.

[16] David Wingate, Noah D. Goodman, Daniel M. Roy, and Joshua B. Tenenbaum. The infinite latent events model. Uncertainty in Artificial Intelligence (UAI), 2009.

[17] Christopher DuBois and Padhraic Smyth. Modeling relational events via latent classes. In Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010.

[18] Liam Paninski. Maximum likelihood estimation of cascade point-process neural encoding models. Network, 2004.

[19] Liam Paninski, Jonathan Pillow, and Jeremy Lewi. Statistical models for neural encoding, decoding, and optimal stimulus design. In Computational Neuroscience: Theoretical Insights Into Brain Function. 2007.

[20] Maayan Roth, Assaf Ben-David, David Deutscher, Guy Flysher, Ilan Horn, Ari Leichtberg, Naty Leiser, Yossi Matias, and Ron Merom. Suggesting friends using the implicit social graph. In Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010.

[21] Enron 2009 Data set. http://www.cs.cmu.edu/ enron/.

[22] John W. DuBois, Wallace L. Chafe, Charles Meyer, and Sandra A. Thompson. Santa Barbara corpus of spoken American English. Linguistic Data Consortium, 2000.

[23] Faten Ghosn, Glenn Palmer, and Stuart Bremer. The mid3 data set, 19932001: Procedures, coding rules, and description. Conflict Management and Peace Science, 21:133–154, 2004.

[24] Dispute Narratives. http://www.correlatesofwar.org/cow2%20data/mids/mid v3.0.narratives.pdf. 9