Centrality-Based Group Profiling: A Comparative Study in Co-authorship Networks

被引:0
|
作者
João E. A. Gomes
Ricardo B. C. Prudêncio
André C. A. Nascimento
机构
[1] Campus Serra Talhada,Centro de Informática
[2] Instituto Federal do Sertão Pernambucano (IFSertão-PE),Dep. de Estatística e Informática
[3] Universidade Federal de Pernambuco (UFPE),undefined
[4] Universidade Federal Rural de Pernambuco (UFRPE),undefined
来源
New Generation Computing | 2018年 / 36卷
关键词
Social network analysis; Communities; Group profiling; Relational information; Centrality;
D O I
暂无
中图分类号
学科分类号
摘要
Group profiling methods aim to construct a descriptive profile for communities in social networks. This task is similar to the traditional cluster labeling task, commonly adopted in document clustering to identify tags which characterize each derived cluster. This similarity encourages the direct application of cluster labeling methods for group profiling problems. However, in group profiling, an important additional information can be leveraged, which is the presence of links among the clustered individuals. This work extends our previous work by incorporating relational information to better describe communities. The proposed approach, so-called Centrality-based Group Profiling approach, makes use of network centrality measures in the selection of nodes for the characterization, i.e., nodes that generalize the content of the observed communities. The use of relational information to select relevant nodes in a community significantly reduces the complexity of the profiling task, at the same time retaining enough representative content to produce a good characterization. Experiments were conducted in a co-authorship network to evaluate different profiling strategies. The results demonstrated the ability of the proposed approach to producing good profiles for the observed groups with both group profiling and standard cluster labeling methods, with a considerably lower computational cost.
引用
收藏
页码:59 / 89
页数:30
相关论文
共 50 条
  • [41] Discussion of "Co-citation and Co-authorship Networks of Statisticians"
    Zhu, Xiaojing
    Kolaczyk, Eric D.
    [J]. JOURNAL OF BUSINESS & ECONOMIC STATISTICS, 2022, 40 (02) : 494 - 496
  • [42] Analysis of dynamic networks based on the lsing model for the case of study of co-authorship of scientific articles
    Andrea Hurtado-Marin, V
    Dario Agudelo-Giraldo, J.
    Robledo, Sebastian
    Restrepo-Parra, Elisabeth
    [J]. SCIENTIFIC REPORTS, 2021, 11 (01)
  • [43] Centrality-based Peer Rewiring in Semantic Overlay Networks
    Yang, Yulian
    Calabretto, Sylvie
    Brunie, Lionel
    [J]. 2013 IEEE SEVENTH INTERNATIONAL CONFERENCE ON RESEARCH CHALLENGES IN INFORMATION SCIENCE (RCIS), 2013,
  • [44] Centrality-based identification of important edges in complex networks
    Broehl, Timo
    Lehnertz, Klaus
    [J]. CHAOS, 2019, 29 (03)
  • [45] Random Walks on Networks with Centrality-Based Stochastic Resetting
    Zelenkovski, Kiril
    Sandev, Trifce
    Metzler, Ralf
    Kocarev, Ljupco
    Basnarkov, Lasko
    [J]. ENTROPY, 2023, 25 (02)
  • [46] Co-authorship networks in social sciences: The case of Turkey
    Cédric Gossart
    Müge Özman
    [J]. Scientometrics, 2009, 78 : 323 - 345
  • [47] Analyzing Interdisciplinary Research Using Co-Authorship Networks
    Ullah, Mati
    Shahid, Abdul
    ud Din, Irfan
    Roman, Muhammad
    Assam, Muhammad
    Fayaz, Muhammad
    Ghadi, Yazeed
    Aljuaid, Hanan
    [J]. Complexity, 2022, 2022
  • [48] Co-authorship networks in South African chemistry and mathematics
    Durbach, Ian N.
    Naidoo, Deevashan
    Mouton, Johann
    [J]. SOUTH AFRICAN JOURNAL OF SCIENCE, 2008, 104 (11-12) : 487 - 492
  • [49] Co-authorship patterns and networks of Korean radiation oncologists
    Choi, Jinhyun
    Kang, Jin Oh
    Park, Seo Hyun
    Kim, Sang Ki
    [J]. RADIATION ONCOLOGY JOURNAL, 2011, 29 (03): : 164 - 173
  • [50] Centrality-Based Traffic Restriction in Delayed Epidemic Networks
    Darabi, Atefe
    Siami, Milad
    [J]. SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2023, 22 (04): : 3165 - 3207