Extraction and Annotation of Personal Cliques from Social Networks

被引:0
|
作者
Erdmann, Maike [1 ]
Takeyoshi, Tomoya [1 ]
Hattori, Gen [1 ]
Ono, Chihiro [1 ]
机构
[1] KDDI R&D Labs Inc, Intelligent Media Proc Lab, Fujimino, Japan
关键词
Social networks; Keyword extraction; Text mining;
D O I
10.1109/SAINT.2012.32
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In microblogging services such as Twitter, users can choose whose posts they want to read by "following" other user accounts. Twitter users often have large social networks, thus many of them are overwhelmed with managing their network connections and dealing with information overload. We want to address this problem by automatically dividing the social network of a Twitter user into personal cliques, and annotating each clique with keywords to identify the common ground of a clique. Our proposed clique annotation method extracts keywords from the tweet history of the clique members and individually weights the extracted keywords of each clique member according to the relevance of their tweets for the clique. The keyword weight is influenced by two factors. The first factor is calculated based on the number of connections of a user within the clique, and the second factor depends on whether the user mainly publishes personal information or information of general interest. In an experiment, on average 36.25% of the keywords extracted from our proposed method were relevant for the cliques, as opposed to 31.78% for the baseline method, which does not weight keywords but only calculates term frequency. When we annotated only cliques formed around common interests, such as "baseball", our proposed method even extracted 50.67% of relevant keywords, as opposed to 42% for the baseline method. These results clearly indicate that our approach can improve clique annotation in social networks.
引用
收藏
页码:172 / 177
页数:6
相关论文
共 50 条
  • [41] Computing cliques and cavities in networks
    Dinghua Shi
    Zhifeng Chen
    Xiang Sun
    Qinghua Chen
    Chuang Ma
    Yang Lou
    Guanrong Chen
    Communications Physics, 4
  • [42] Computing cliques and cavities in networks
    Shi, Dinghua
    Chen, Zhifeng
    Sun, Xiang
    Chen, Qinghua
    Ma, Chuang
    Lou, Yang
    Chen, Guanrong
    COMMUNICATIONS PHYSICS, 2021, 4 (01)
  • [43] Useful networks and corrupt cliques
    Hirschbiegel, Jan
    ZEITSCHRIFT FUR HISTORISCHE FORSCHUNG, 2008, 35 (03): : 509 - 510
  • [44] Detecting cliques in CONGEST networks
    Artur Czumaj
    Christian Konrad
    Distributed Computing, 2020, 33 : 533 - 543
  • [45] Evolving networks by merging cliques
    Takemoto, K
    Oosawa, C
    PHYSICAL REVIEW E, 2005, 72 (04)
  • [46] Detecting cliques in CONGEST networks
    Czumaj, Artur
    Konrad, Christian
    DISTRIBUTED COMPUTING, 2020, 33 (06) : 533 - 543
  • [47] Useful Networks and corrupt Cliques
    Asch, Ronald G.
    VSWG-VIERTELJAHRSCHRIFT FUR SOZIAL-UND WIRTSCHAFTSGESCHICHTE, 2007, 94 (04): : 484 - 485
  • [48] ON FUZZY CLIQUES IN FUZZY NETWORKS
    YAN, XY
    JOURNAL OF MATHEMATICAL SOCIOLOGY, 1988, 13 (04): : 359 - 389
  • [49] Parallelizing the extraction of fresh information from online social networks
    Guo, Rui
    Wang, Hongzhi
    Chen, Mengwen
    Li, Jianzhong
    Gao, Hong
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 59 : 33 - 46
  • [50] A Novel Query Language for Data Extraction from Social Networks
    Buccafurri, Francesco
    Lax, Gianluca
    Musarella, Lorenzo
    Nardone, Roberto
    WEBIST: PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND TECHNOLOGIES, 2019, : 365 - 371