File(s) under permanent embargo
Most influential community search over large social networks
conference contributionposted on 2017-01-01, 00:00 authored by Jianxin LiJianxin Li, Xinjue Wang, Ke Deng, Xiaochun Yang, Timos Sellis, Jeffrey Xu Yu
Detecting social communities in large social networks provides an effective way to analyze the social media users' behaviors and activities. It has drawn extensive attention from both academia and industry. One essential aspect of communities in social networks is outer influence which is the capability to spread internal information of communities to external users. Detecting the communities of high outer influence has particular interest in a wide range of applications, e.g., Ads trending analytics, social opinion mining and news propagation pattern discovery. However, the existing detection techniques largely ignore the outer influence of the communities. To fill the gap, this work investigates the Most Influential Community Search problem to disclose the communities with the highest outer influences. We firstly propose a new community model, maximal kr-Clique community, which has desirable properties, i.e., society, cohesiveness, connectivity, and maximum. Then, we design a novel tree-based index structure, denoted as C-Tree, to maintain the offline computed r-cliques. To efficiently search the most influential communities, we also develop four advanced index-based algorithms which improve the search performance of non-indexed solution by about 200 times. The efficiency and effectiveness of our solution have been extensively verified using six real datasets and a small case study.
EventData Engineering. Conference (2017 : 33rd : San Diego, California)
Pagination871 - 882
LocationSan Diego, California
Place of publicationPiscataway, N.J.
Publication classificationE1.1 Full written paper - refereed
Title of proceedingsICDE 2017 : Proceedings of the IEEE 33rd International Conference on Data Engineering
CategoriesNo categories selected