Context propagation based influence maximization model for dynamic link prediction

被引:0
|
作者
Shelke, Vishakha [1 ]
Jadhav, Ashish [2 ]
机构
[1] DY Patil Deemed Univ, Ramrao Adik Inst Technol, Dept Comp Engn, Navi Mumbai 400706, Maharashtra, India
[2] DY Patil Deemed Univ, Ramrao Adik Inst Technol, Dept Informat Technol, Navi Mumbai 400706, Maharashtra, India
来源
INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS | 2024年 / 18卷 / 03期
关键词
IM; social influence analysis; multiplex networks; Wilcoxon Hypothesized community detection; linear scaling based influencing nodes identification; parametric probability theory-based link prediction; COMMUNITY STRUCTURE; SOCIAL NETWORKS; NODES;
D O I
10.3233/IDT-230804
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Influence maximization (IM) in dynamic social networks is an optimization problem to analyze the changes in social networks for different periods. However, the existing IM methods ignore the context propagation of interaction behaviors among users. Hence, context-based IM in multiplex networks is proposed here. Initially, multiplex networks along with their contextual data are taken as input. Community detection is performed for the network using the Wilcoxon Hypothesized K-Means (WH-KMA) algorithm. From the detected communities, the homogeneous network is used for extracting network topological features, and the heterogeneous networks are used for influence path analysis based on which the node connections are weighted. Then, the influence-path-based features along with contextual features are extracted. These extracted features are given for the link prediction model using the Parametric Probability Theory-based Long Short-Term Memory (PPT-LSTM) model. Finally, from the network graph, the most influencing nodes are identified using the Linear Scaling based Clique (LS-Clique) detection algorithm. The experimental outcomes reveal that the proposed model achieves an enhanced performance.
引用
收藏
页码:2371 / 2387
页数:17
相关论文
共 50 条
  • [41] A Reliability-Based Approach for Influence Maximization Using the Evidence Theory
    Jendoubi, Siwar
    Martin, Arnaud
    BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY, DAWAK 2017, 2017, 10440 : 313 - 326
  • [42] A community-based algorithm for influence blocking maximization in social networks
    Jiaguo Lv
    Bin Yang
    Zhen Yang
    Wei Zhang
    Cluster Computing, 2019, 22 : 5587 - 5602
  • [43] Influence maximization in social networks based on discrete particle swarm optimization
    Gong, Maoguo
    Yan, Jianan
    Shen, Bo
    Ma, Lijia
    Cai, Qing
    INFORMATION SCIENCES, 2016, 367 : 600 - 614
  • [44] Influence Maximization in Independent Cascade Networks Based on Activation Probability Computation
    Yang, Wenjing
    Brenner, Leonardo
    Giua, Alessandro
    IEEE ACCESS, 2019, 7 : 13745 - 13757
  • [45] A community-based algorithm for influence blocking maximization in social networks
    Lv, Jiaguo
    Yang, Bin
    Yang, Zhen
    Zhang, Wei
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S5587 - S5602
  • [46] Influence maximization based on community structure and second-hop neighborhoods
    Cheng, Jianjun
    Yang, Ke
    Yang, Zeyi
    Zhang, Handong
    Zhang, Wenbo
    Chen, Xiaoyun
    APPLIED INTELLIGENCE, 2022, 52 (10) : 10829 - 10844
  • [47] Dynamic Model of Malware Propagation Based on Community Structure in Heterogeneous Networks
    Jouyban, Morteza
    Hosseini, Soodeh
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2025, 37 (4-5)
  • [48] Influence maximization in social networks based on TOPSIS
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Khamforoosh, Keyhan
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 108 : 96 - 107
  • [49] Identification of Key Components of CNC Lathe Based on Dynamic Influence of Fault Propagation
    Luan, Lan
    Shen, Guixiang
    Zhang, Yingzhi
    Guo, Guiming
    APPLIED SCIENCES-BASEL, 2022, 12 (12):
  • [50] Influence Maximization: Seeding Based on Community Structure
    Guo, Jianxiong
    Wu, Weili
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2020, 14 (06)