Detecting change points in the large-scale structure of evolving networks

Proceedings of the National Conference on Artificial Intelligence

Volumn 4, Issue , 2015, Pages 2914-2920

  Peel, Leto ^a   Clauset, Aaron ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; STATISTICAL TESTS;

BAYESIAN HYPOTHESIS TESTS; CHANGE POINT DETECTION; CHANGE-POINT DETECTION PROBLEMS; EVOLVING NETWORKS; HIGH RESOLUTION; LARGE SCALE STRUCTURES; PROBABILISTIC LEARNING; RANDOM GRAPH MODELS;

ARTIFICIAL INTELLIGENCE;

EID: 84944760798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Aicher, C.; Jacobs, A. Z.; and Clauset, A. 2014. Learning latent block structure in weighted networks. Journal of Complex Networks.
2. Aitkin, M. 1991. Posterior bayes factors (with discussion). Journal of the Royal Statistical Society 53:111-142.
3. Aitkin, M. 1997. The calibration of p-values, posterior Bayes factors and the AIC from the posterior distribution of the likelihood. Statistics and Computing 7(4):253-261.
4. Akoglu, L., and Faloutsos, C. 2010. Event detection in time series of mobile communication graphs. In 27th Army Science Conference.
5. Basseville, M., and Nikiforov, I. V. 1993. Detection of Abrupt Changes: Theory and Application. Upper Saddle River, NJ, USA: Prentice-Hall, Inc.
6. Berlingerio, M.; Coscia, M.; Giannotti, F.; Monreale, A.; and Pedreschi, D. 2013. Evolving networks: Eras and turning points. Intelligent Data Analysis 17(1):27-48.
7. Blundell, C., and Teh, Y. W. 2013. Bayesian hierarchical community discovery. In Advances in Neural Information Processing Systems 26. 1601-1609.
8. Bryant, D. 2003. A classification of consensus methods for phylogenetics. In Bioconsensus, volume 61 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Providence. RI: Amer. Math. Soc. 163-183.
9. Clauset, A.; Moore, C.; and Newman, M. E. J. 2007. Structural inference of hierarchies in networks. In Airoldi, E.; Blei, D. M.; Fienberg, S. E.; Goldenberg, A.; Xing, E. P.; and Zheng, A. X., eds., Statistical Network Analysis: Models, Issues, and New Directions, volume 4503 of Lecture Notes in Computer Science. Springer Berlin Heidelberg. 1-13.
10. Decelle, A.; Krzakala, F.; Moore, C.; and Zdeborova, L. 2011. Inference and phase transitions in the detection of modules in sparse networks. Phys. Rev. Lett. 107:065701.
11. Eagle, N., and Pentland, A. 2006. Reality mining: Sensing complex social systems. Personal Ubiquitous Comput. 10(4):255-268.
12. Eagle, N. 2005. Machine perception and learning of complex social systems. Department of Media Arts and Sciences, Massachusetts Institute of Technology.
13. Efron, B., and Tibshirani, R. J. 1993. An introduction to the bootstrap. Chapman and Hall.
14. Hirose, S.; Yamanishi, K.; Nakata, T.; and Fujimaki, R. 2009. Network anomaly detection based on eigen equation compression. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'09, 1185-1194. New York, NY, USA: ACM.
15. Holland, P. W.; Laskey, K. B.; and Leinhardt, S. 1983. Stochastic blockmodels: First steps. Social Networks 5(2):109-137.
16. Klimt, B., and Yang, Y. 2004. Introducing the Enron corpus. In First Conference on Email and Anti-Spam (CEAS).
17. Leskovec, J.; Chakrabarti, D.; Kleinberg, J.; and Faloutsos, C. 2005. Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD'05, 133-145. Berlin, Heidelberg: Springer-Verlag.
18. Levy-Leduc, C., and Roueff, F. 2009. Detection and localization of change-points in high-dimensional network traffic data. The Annals of Applied Statistics 637-662.
19. McCulloh, I., and Carley, K. M. 2011. Detecting change in longitudinal social networks. Journal of Social Structure 12.
20. Moreno, S., and Neville, J. 2013. Network hypothesis testing using mixed Kronecker product graph models. In 13th IEEE International Conference on Data Mining.
21. Nowicki, K., and Snijders, T. A. B. 2001. Estimation and Prediction for Stochastic Blockstnictures. Journal of the American Statistical Association 96 (455).
22. Peel, L. 2011. Topological feature based classification. In Proceedings of the 14th International Conference on Information Fusion (FUSION), 1-8. IEEE.
23. Priebe, C. E.; Conroy, J. M.; Marchette, D. J.; and Park, Y. 2005. Scan statistics on Enron graphs. Comput. Math. Organ. Theory 11(3):229-247.
24. Sun, J.; Faloutsos, C.; Papadimitriou, S.; and Yu, P. S. 2007. Graphscope: Parameter-free mining of large time-evolving graphs. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'07, 687-696. New York, NY, USA: ACM.
25. Yan, X.; Jensen, J. E.; Krzakala, P.; Moore, C.; Shalizi, C. R.; Zdeborova, L.; Zhang, P.; and Zhu, Y. 2012. Model selection for degree-corrected block models. arXiv 1207.3994.