Measurement and Analysis of the Swarm Social Network With Tens of Millions of Nodes

被引：13

作者：

Chen, Yang ^{[1
,2
,3
]}

Hu, Jiyao ^{[1
,2
,3
]}

Zhao, Hao ^{[1
,2
,3
]}

Xiao, Yu ^{[4
]}

Hui, Pan ^{[5
,6
]}

机构：

[1] Fudan Univ, Sch Comp Sci, Shanghai 200433, Peoples R China

[2] Minist Educ, Engn Res Ctr Cyber Secur Auditing & Monitoring, Shanghai 200433, Peoples R China

[3] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710126, Shaanxi, Peoples R China

[4] Aalto Univ, Dept Commun & Networking, Espoo 02150, Finland

[5] Univ Helsinki, Dept Comp Sci, Helsinki 00100, Finland

[6] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China

来源：

IEEE ACCESS | 2018年 / 6卷

基金：

芬兰科学院; 中国国家自然科学基金; 上海市自然科学基金;

关键词：

Social network analytics; Swarm app; social graph; user-generated contents;

D O I：

10.1109/ACCESS.2018.2789915

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Social graphs have been widely used for representing the relationship among users in online social networks (OSNs). As crawling an entire OSN is resource-and time-consuming, most of the existing works only pick a sampled subgraph for study. However, this may introduce serious inaccuracy into the analytic results, not to mention that some important metrics cannot even be calculated. In this paper, we crawl the entire social network of Swarm, a leading mobile social app with more than 60 million users, using a distributed approach. Based on the crawled massive user data, we conduct a data-driven study to get a comprehensive picture of the whole Swarm social network. This paper provides a deep analysis of social interactions between Swarm users, and reveals the relationship between social connectivity and check-in activities.

引用

页码：4547 / 4559

页数：13

共 56 条

[1]

Ahn YY, 2007, WWW '07: Proceedings of the 16th international conference on World Wide Web, P835

[2]

[Anonymous], 1999, SIDLWP19990120 STANF

[3]

[Anonymous], 2009, SIGKDD Explorations, DOI DOI 10.1145/1656274.1656278

[4]

[Anonymous], 2010, IMC 2010 P

[5]

[Anonymous], 2012, P 2012 INTERNET MEAS

[6]

[Anonymous], 2021, PROC INT AAAI C WEB

[7]

[Anonymous], 2012, PROC INTERNET MEAS

[8]

[Anonymous], 2007, P 16 ACM C C INF KNO, DOI DOI 10.1145/1321440.1321588

[9]

[Anonymous], 2012, ACM International Conference on Web Search and Data Mining

[10]

[Anonymous], 2010, P 2010 ACM SIGMOD IN, DOI [10.1145/1807167.1807184, DOI 10.1145/1807167.1807184]

← 1 2 3 4 5 6 →