Influence propagation in social networks: Interest-based community ranking model

被引:6
作者
Abd Al-Azim, Nouran Ayman R. [1 ]
Gharib, Tarek F. [1 ]
Hamdy, Mohamed [1 ]
Afify, Yasmine [1 ]
机构
[1] Ain Shams Univ, Fac Comp & Informat Sci, Informat Syst Dept, Cairo 11566, Egypt
关键词
Influence propagation; Social networks analysis; Graph mining; Community ranking; Ultimate rank; ALGORITHM;
D O I
10.1016/j.jksuci.2020.08.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The driving force behind content dissemination in Social network (SN) is the users' interest in the content, which is strongly reflected in their interactions. Obviously, user interest varies with the disseminated content. Consequently, the dynamic interest results in decomposing SN into dynamic user clusters "interest groups". The objective of this work is to rank interest-based communities using influence propagation. The contribution of this work is threefold: First, to highlight the significance of the indirect influence among interest-based user groups. Second, to study its impact on content dissemination capability. Third, to propose an ultimate ranking model (UltRank) that uniquely considers direct and indirect influences which are reflected in a new reachability metric that considers: 1. Distance among interest groups. 2. Percentage of reachable interest groups. 3. Percentage of reachable nodes. UltRank model has been evaluated in comprehensive experiments. First, clustering quality perspective, the Silhouette coefficient for the identified interest groups is on average 0.996 and the Jaccard coefficient of 97% of different interest groups members equals 0. Second, ranking capability perspective, UltRank model can rank up to 91% of interest groups in SN. Finally, ranking effectiveness perspective, UltRank ranking list has a competing network coverage results against the other benchmark approaches. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of King Saud University.
引用
收藏
页码:2231 / 2243
页数:13
相关论文
共 47 条
  • [1] Influence propagation: Interest groups and node ranking models
    Abd Al-Azim, Nouran Ayman R.
    Gharib, Tarek F.
    Afify, Yasmine
    Hamdy, Mohamed
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 553
  • [2] A new scalable leader-community detection approach for community detection in social networks
    Ahajjam, Sara
    El Haddad, Mohamed
    Badir, Hassan
    [J]. SOCIAL NETWORKS, 2018, 54 : 41 - 49
  • [3] Aki Selim G, 1989, DESIGN ANAL PARALLEL
  • [4] Identifying community structures in dynamic networks
    Alvari, Hamidreza
    Hajibagheri, Alireza
    Sukthankar, Gita
    Lakkaraju, Kiran
    [J]. SOCIAL NETWORK ANALYSIS AND MINING, 2016, 6 (01)
  • [5] Customer segmentation using online platforms: isolating behavioral and demographic segments for persona creation via aggregated user data
    An, Jisun
    Kwak, Haewoon
    Jung, Soon-gyo
    Salminen, Joni
    Jansen, Bernard J.
    [J]. SOCIAL NETWORK ANALYSIS AND MINING, 2018, 8 (01)
  • [6] [Anonymous], 2018, INT C COMMUNICATIONS, V500
  • [7] Large-scale community detection based on a new dissimilarity measure
    Asmi K.
    Lotfi D.
    El Marraki M.
    [J]. Social Network Analysis and Mining, 2017, 7 (1)
  • [8] Ayman N., 2019, INT C ADV MACHINE LE, P928
  • [9] Community detection in social networks
    Bedi, Punam
    Sharma, Chhavi
    [J]. WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2016, 6 (03) : 115 - 135
  • [10] Towards Maximising Cross-Community Information Diffusion
    Belak, Vaclav
    Lam, Samantha
    Hayes, Conor
    [J]. 2012 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2012, : 171 - 178