skip to main content
10.1145/3041021.3053905acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Particle Filter Inference based on Activities for Overlapping Community Models

Published:03 April 2017Publication History

ABSTRACT

Various kinds of data such as social media can be represented as a network or graph. Latent variable models using Bayesian statistical inference are powerful tools to represent such networks. One such latent variable network model is a Mixed Membership Stochastic Blockmodel (MMSB), which can discover overlapping communities in a network and has high predictive power. Previous inference methods estimate the latent variables and unknown parameters of the MMSB on the basis of the whole observed network. Therefore, dynamic changes in network structure over time are hard to track. Thus, we present a particle filter based on node activities with various term lengths for online sequential estimation of the MMSB. For instance, in an e-mail communication network, each particle only considers e-mail accounts that sent or received a message within a specific term length, where the length may be different from those of other particles. We show through experiments that our proposed methods achieve both high prediction performance and computational efficiency.

References

  1. E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9:1981--2014, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. R. Canini, L. Shi, and T. L. Griffiths. Online inference of topics with latent Dirichlet allocation. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, pages 65--72, Clearwater Beach, Florida, USA, 2009.Google ScholarGoogle Scholar
  3. A. Doucet, N. de Freitas, and N. Gordon, editors. Sequential Monte Carlo Methods in Practice. Springer New York, 2001. Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Goldenberg, A. X. Zheng, S. E. Fienberg, and E. M. Airoldi. A survey of statistical network models. Foundations and Trends in Machine Learning, 2(2):129--233, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. K. Gopalan, S. Gerrish, M. Freedman, D. M. Blei, and D. M. Mimno. Scalable inference of overlapping communities. In Advances in Neural Information Processing Systems, volume 25, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. L. Griffiths and M. Steyvers. Finding scientific topics. Proceedings of the National Academy of Sciences of the United States of America, 101:5228--5235, 2004. Google ScholarGoogle ScholarCross RefCross Ref
  7. C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. In Proceedings of the 21st National Conference on Artificial Intelligence, volume 1, pages 381--388, Boston, Massachusetts, USA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Klimt and Y. Yang. Introducing the Enron corpus. In First Conference on Email and Anti-Spam CEAS, Mountain View, California, USA, 2004.Google ScholarGoogle Scholar
  9. T. Kobayashi and K. Eguchi. Online inference of mixed membership stochastic blockmodels for network data streams. IEICE Transactions on Information and Systems, E97-D(4):752--761, 2014. Google ScholarGoogle ScholarCross RefCross Ref
  10. K. T. Miller, M. I. Jordan, and T. L. Griffiths. Nonparametric latent feature models for link prediction. In Advances in Neural Information Processing Systems, volume 22, pages 1276--1284, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. K. Nowicki and T. A. B. Snijders. Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96(455):1077--1087, 2001. Google ScholarGoogle Scholar
  12. T. Opsahl and P. Panzarasa. Clustering in weighted networks. Social Networks, 31(2):155--163, 2009. Google ScholarGoogle ScholarCross RefCross Ref
  13. T. A. B. Snijders and K. Nowicki. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification, (14):75--100, 1997. Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Particle Filter Inference based on Activities for Overlapping Community Models

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Article Metrics

        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader