Analyzing communities and their evolutions in dynamic social networks

Author:

Lin Yu-Ru1,Chi Yun2,Zhu Shenghuo2,Sundaram Hari1,Tseng Belle L.3

Affiliation:

1. Arizona State University, Tempe, AZ

2. NEC Laboratories America, Cupertino, CA

3. YAHOO! Inc., Santa Clara, CA

Abstract

We discover communities from social network data and analyze the community evolution. These communities are inherent characteristics of human interaction in online social networks, as well as paper citation networks. Also, communities may evolve over time, due to changes to individuals' roles and social status in the network as well as changes to individuals' research interests. We present an innovative algorithm that deviates from the traditional two-step approach to analyze community evolutions. In the traditional approach, communities are first detected for each time slice, and then compared to determine correspondences. We argue that this approach is inappropriate in applications with noisy data. In this paper, we propose FacetNet for analyzing communities and their evolutions through a robust unified process. This novel framework will discover communities and capture their evolution with temporal smoothness given by historic community structures. Our approach relies on formulating the problem in terms of maximum a posteriori (MAP) estimation, where the community structure is estimated both by the observed networked data and by the prior distribution given by historic community structures. Then we develop an iterative algorithm, with proven low time complexity, which is guaranteed to converge to an optimal solution. We perform extensive experimental studies, on both synthetic datasets and real datasets, to demonstrate that our method discovers meaningful communities and provides additional insights not directly obtainable from traditional methods.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference29 articles.

1. An event-based framework for characterizing the evolutionary behavior of interaction graphs

2. Bach F. R. and Jordan M. I. 2006. Learning spectral clustering with application to speech separation. J. Mach. Lean. Resea. 7. Bach F. R. and Jordan M. I. 2006. Learning spectral clustering with application to speech separation. J. Mach. Lean. Resea. 7.

3. Evolutionary clustering

4. Evolutionary spectral clustering by incorporating temporal smoothness

5. Chung F. R. K. 1997. Spectral Graph Theory. American Mathematical Society. Chung F. R. K. 1997. Spectral Graph Theory. American Mathematical Society.

Cited by 211 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3