Xuning Tang
Abstract
Detecting evolving hidden communities within dynamic social networks has attracted significant attention recently due to its broad applications in e-commerce, online social media, security intelligence, public health, and other areas. Many community network detection techniques employ a two-stage approach to identify and detect evolutionary relationships between communities of two adjacent time epochs. These techniques often identify communities with high temporal variation, since the two-stage approach detects communities of each epoch independently without considering the continuity of communities across two time epochs. Other techniques require identification of a predefined number of hidden communities which is not realistic in many applications. To overcome these limitations, we propose the Dynamic Stochastic Blockmodel with Temporal Dirichlet Process, which enables the detection of hidden communities and tracks their evolution simultaneously from a network stream. The number of hidden communities is automatically determined by a temporal Dirichlet process without human intervention. We tested our proposed technique on three different testbeds with results identifying a high performance level when compared to the baseline algorithm.
- Amr Ahmed and Eric P. Xing. 2008. Dynamic non-parametric mixture models and the recurrent Chinese restaurant process. In Proceedings of SDM'08.Google Scholar
- Edoardo M. Airoldi, David M. Blei, Stephen E. Fienberg, and Eric P. Xing. 2008. Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9, 1981--2014. Google ScholarDigital Library
- Alex Arenas, Leon Danon, Albert Diaz-Guilera, Pablo M. Gleiser, and Roger Guimera. 2004. Community analysis in social networks. Euro. Phys. J. B - Condensed Matter and Complex Systems 38, 373--380.Google ScholarCross Ref
- Sitaram Asur, Srinivasan Parthasarathy, and Duygu Ucar. 2007. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 913--921. Google ScholarDigital Library
- Tanya Y. Berger-Wolf and Jared Saia. 2006. A framework for analysis of dynamic social networks. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 523--528. Google ScholarDigital Library
- Meeyoung Cha, Alan Mislove, and Krishna P. Gummadi. 2009. A measurement-driven analysis of information propagation in the Flickr social network. In Proceedings of the 18th International Conference on World Wide Web. ACM, 721--730. Google ScholarDigital Library
- Yun Chi, Xiaodan Song, Dengyong Zhou, Koji Hino, and Belle L. Tseng. 2007. Evolutionary spectral clustering by incorporating temporal smoothness. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 153--162. Google ScholarDigital Library
- Inderjit S. Dhillon, Yuqiang Guan, and Brian Kulis. 2004. Kernel k-means: Spectral clustering and normalized cuts. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 551--556. Google ScholarDigital Library
- Tanja Falkowski, Jorg Bartelheimer, and Myra Spiliopoulou. 2006. Mining and visualizing the evolution of subgroups in social networks. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence. IEEE Computer Society, 52--58. Google ScholarDigital Library
- Wenjie Fu, Le Song, and Eric P. Xing. 2009. Dynamic mixed membership blockmodel for evolving networks. In Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 329--336. Google ScholarDigital Library
- M. Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99, 7821--7826.Google ScholarCross Ref
- Keith Henderson, Tina Eliassi-rad, Spiros Papadimitriou, and Christos Faloutsos. 2010. HCDF: A hybrid community discovery framework. In Proceedings of the SDM'10. SIAM. 754--765.Google ScholarCross Ref
- Brian Karrer, Elizaveta Levina, and M. E. J. Newman. 2008. Robustness of community structure in networks. Phys. Rev. E 77.Google ScholarCross Ref
- Charles Kemp, Thomas L. Griffiths, and Joshua B. Tenenbaum. 2004. Discovering Latent Classes in Relational Data. Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory Series Report.Google Scholar
- Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, and Belle L. Tseng. 2008. FacetNet: A framework for analyzing communities and their evolutions in dynamic networks. In Proceedings of the 17th International Conference on World Wide Web. ACM, 685--694. Google ScholarDigital Library
- Radford M. Neal. 2000. Markov chain sampling methods for Dirichlet process mixture models. J. Comput. Graph. Stat. 9, 249--265.Google Scholar
- M. E. J. Newman. 2004. Detecting community structure in networks. Euro. Phys. J. B 38, 321--330.Google Scholar
- M. E. J. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69.Google Scholar
- Krzysztof Nowicki and Tom A. B. Snijders. 2001. Estimation and prediction for stochastic blockstructures. J. Am. Stat. Assoc. 96, 1077--1087.Google ScholarCross Ref
- John Scott. 2000. Social Network Analysis: A Handbook. Sage Publications Ltd.Google Scholar
- Jianbo Shi and Jitendra Malik. 2002. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intelli. 22, 888--905. Google ScholarDigital Library
- Tom A. B. Snijders and Krzysztof Nowicki. 1997. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 14, 75--100.Google ScholarCross Ref
- Jimeng Sun, Christos Faloutsos, Spiros Papadimitriou, and Philip S. Yu. 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. ACM, 687--696. Google ScholarDigital Library
- Yizhou Sun, Jie Tang, Jiawei Han, Manish Gupta, and Bo Zhao. 2010. Community evolution detection in dynamic heterogeneous information networks. In Proceedings of the 8th Workshop on Mining and Learning with Graphs. ACM, 137--146. Google ScholarDigital Library
- Chayant Tantipathananandh, Tanya Berger-Wolf, and David Kempe. 2007. A framework for community identification in dynamic social networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 717--726. Google ScholarDigital Library
- Masashi Toyoda and Masaru Kitsuregawa. 2003. Extracting evolution of Web communities from a series of Web archives. In Proceedings of the 14th ACM Conference on Hypertext and Hypermedia. ACM, 28--37. Google ScholarDigital Library
- Tianbing Xu, Zhongfei Zhang, P. S. Yu, and Bo Long. 2008. Dirichlet process based evolutionary clustering. In Proceeding of the 8th IEEE International Conference on Data Mining (ICDM). 648--657. Google ScholarDigital Library
- Zhao Xu, Volker Tresp, Kai Yu, and Hans-Peter Kriegel. 2006. Infinite hidden relational models. In Proceedings of the 22nd International Conference on Uncertainity in Artificial Intelligence (UAI).Google Scholar
- Tianbao Yang, Yun Chi, Shenghuo Zhu, Yihong Gong, and Rong Jin. 2009. A Bayesian approach toward finding communities and their evolutions in dynamic social networks. In Proceedings of SDM'09, 990--1001.Google ScholarCross Ref
- Hongyuan Zha, Xiaofeng He, Chris Ding, Horst Simon, and Ming Gu. 2002. Spectral relaxation for k-means clustering. In Proceedings of the Conference on Advances in Neural Information Processing Systems 2. 1057--1064.Google Scholar
Index Terms
- Detecting Social Media Hidden Communities Using Dynamic Stochastic Blockmodel with Temporal Dirichlet Process
Recommendations
Detecting Communities in Dynamic Social Networks using Modularity Ensembles SOM
Social network analysis has gained much importance these days. Social network analysis is the process of recording various patterns of interactions between a set of social entities. An important phenomenon that draws the attention of analysis is the ...
Detecting antagonistic and allied communities on social media
ASONAM '18: Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and MiningCommunity detection on social media has attracted considerable attention for many years. However, existing methods do not reveal the relations between communities. Communities can form alliances or engage in antagonisms due to various factors, e.g., ...
Towards the Dynamic Community Discovery in Decentralized Online Social Networks
The community structure is one of the most studied features of the Online Social Networks (OSNs). Community detection guarantees several advantages for both centralized and decentralized social networks. Decentralized Online Social Networks (DOSNs) have ...
Comments