A Study on Twitter User-Follower Network A network based analysis

被引:0
作者
Martha, VenkataSwamy [1 ]
Zhao, Weizhong [2 ]
Xu, Xiaowei [2 ]
机构
[1] WalmartLabs, Mountain View, CA 94041 USA
[2] Univ Arkansas Little Rock, Little Rock, AR USA
来源
2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM) | 2013年
关键词
Twitter; Social network analysis; Behavior analysis; Social media;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Substantial percent of global Internet users are now actively use Twitter. In recent times, Twitter has been experiencing explosive growth, attracting celebrities consequently a growing mass of user coverage. Insights of such a social network aid researchers in understanding behavioral dynamics of the society. Though there have been attempts to study social networks, they did not scale to process social networks on the scale of Twitter user-follower network. In this paper we uncovered some of the essential properties of the complete Twitter user-follower network. The properties include degree distribution, connectivity, strength of following relationships, clustering coefficient. Our investigations showed that the Twitter user-follower network follows power-law degree distribution. We found Twitter being a connected network. The strength of the relationships among users is distributed nearly uniform on the scale of 0.0 to 1.0. Nearly 90% of the users possess '0' clustering coefficient, which refers to the least possibility to find communities in the network. In addition to the listed properties, this study found communities of users with high clustering coefficient despite many users with low clustering coefficient. A sample of the communities is validated manually for accuracy. The validation proved that the communities are representing users of similar interests. The communities found from this work yields to friend recommendations, target based advertisements, etc.
引用
收藏
页码:1405 / 1409
页数:5
相关论文
共 9 条
  • [1] [Anonymous], OSDI04
  • [2] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [3] Bhat A. U., 2012, SCALABLE COMMUNITY D
  • [4] THE STRENGTH OF WEAK TIES
    GRANOVETTER, MS
    [J]. AMERICAN JOURNAL OF SOCIOLOGY, 1973, 78 (06) : 1360 - 1380
  • [5] Kwak H, 2010, P 19 INT C WORLD WID, P591, DOI DOI 10.1145/1772690.1772751
  • [6] Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
    Lancichinetti, Andrea
    Fortunato, Santo
    [J]. PHYSICAL REVIEW E, 2009, 80 (01)
  • [7] Martha VenkataSwamy, 2013, THESIS U ARKANSAS LI
  • [8] SCAN: A Structural Clustering Algorithm for Netwo
    Xu, Xiaowei
    Yuruk, Nurcan
    Feng, Zhidan
    Schweiger, Thomas A. J.
    [J]. KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2007, : 824 - +
  • [9] PSCAN: A Parallel Structural Clustering Algorithm for Big Networks in MapReduce
    Zhao, Weizhong
    Martha, VenkataSwamy
    Xu, Xiaowei
    [J]. 2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, : 862 - 869