Most influential community search over large social networks

Jianxin Li, Xinjue Wang, Ke Deng, Xiaochun Yang, Timos Sellis, Jeffrey Xu Yu

Research output: Chapter in Book/Conference paperConference paper

29 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE)
Place of PublicationSan Diego, California
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages871-882
Number of pages12
ISBN (Electronic)9781509065431
DOIs
Publication statusPublished - 16 May 2017
Event33rd IEEE International Conference on Data Engineering, ICDE 2017 - San Diego, United States
Duration: 19 Apr 201722 Apr 2017

Conference

Conference33rd IEEE International Conference on Data Engineering, ICDE 2017
CountryUnited States
CitySan Diego
Period19/04/1722/04/17

Fingerprint

Industry

Cite this

Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., & Yu, J. X. (2017). Most influential community search over large social networks. In Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE) (pp. 871-882). [7930032] San Diego, California: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICDE.2017.136
Li, Jianxin ; Wang, Xinjue ; Deng, Ke ; Yang, Xiaochun ; Sellis, Timos ; Yu, Jeffrey Xu. / Most influential community search over large social networks. Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE). San Diego, California : IEEE, Institute of Electrical and Electronics Engineers, 2017. pp. 871-882
@inproceedings{abe796f4edbe4a73b4305ce92a2715b4,
title = "Most influential community search over large social networks",
abstract = "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.",
author = "Jianxin Li and Xinjue Wang and Ke Deng and Xiaochun Yang and Timos Sellis and Yu, {Jeffrey Xu}",
year = "2017",
month = "5",
day = "16",
doi = "10.1109/ICDE.2017.136",
language = "English",
pages = "871--882",
booktitle = "Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
address = "United States",

}

Li, J, Wang, X, Deng, K, Yang, X, Sellis, T & Yu, JX 2017, Most influential community search over large social networks. in Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE)., 7930032, IEEE, Institute of Electrical and Electronics Engineers, San Diego, California, pp. 871-882, 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, United States, 19/04/17. https://doi.org/10.1109/ICDE.2017.136

Most influential community search over large social networks. / Li, Jianxin; Wang, Xinjue; Deng, Ke; Yang, Xiaochun; Sellis, Timos; Yu, Jeffrey Xu.

Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE). San Diego, California : IEEE, Institute of Electrical and Electronics Engineers, 2017. p. 871-882 7930032.

Research output: Chapter in Book/Conference paperConference paper

TY - GEN

T1 - Most influential community search over large social networks

AU - Li, Jianxin

AU - Wang, Xinjue

AU - Deng, Ke

AU - Yang, Xiaochun

AU - Sellis, Timos

AU - Yu, Jeffrey Xu

PY - 2017/5/16

Y1 - 2017/5/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85021239199&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2017.136

DO - 10.1109/ICDE.2017.136

M3 - Conference paper

SP - 871

EP - 882

BT - Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE)

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - San Diego, California

ER -

Li J, Wang X, Deng K, Yang X, Sellis T, Yu JX. Most influential community search over large social networks. In Proceedings - 2017 IEEE 33rd International Conference on Data Engineering (ICDE). San Diego, California: IEEE, Institute of Electrical and Electronics Engineers. 2017. p. 871-882. 7930032 https://doi.org/10.1109/ICDE.2017.136