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 条
  • [1] Influence maximization algorithm based on Gaussian propagation model
    Li, WeiMin
    Li, Zheng
    Luvembe, Alex Munyole
    Yang, Chao
    INFORMATION SCIENCES, 2021, 568 : 386 - 402
  • [2] Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks
    Zhang, Lin
    Li, Kan
    MATHEMATICS, 2022, 10 (08)
  • [3] Topic Propagation Prediction Based on Dynamic Probability Model
    Wang, Jing
    Zhao, Hui
    Liu, Zhijing
    IEEE ACCESS, 2019, 7 : 58685 - 58694
  • [4] Targeted influence maximization under a multifactor-based information propagation model
    Li, Lingfei
    Liu, Yezheng
    Zhou, Qing
    Yang, Wei
    Yuan, Jiahang
    INFORMATION SCIENCES, 2020, 519 : 124 - 140
  • [5] Influence Maximization in Independent Cascade Model with Limited Propagation Distance
    Lv, Shunming
    Pan, Li
    WEB TECHNOLOGIES AND APPLICATIONS, APWEB 2014, PT II, 2014, 8710 : 23 - 34
  • [6] A community-based algorithm for influence maximization on dynamic social networks
    Wei, Jia
    Cui, Zhenyu
    Qiu, Liqing
    Niu, Weinan
    INTELLIGENT DATA ANALYSIS, 2020, 24 (04) : 959 - 971
  • [7] A homophilic and dynamic influence maximization strategy based on independent cascade model in social networks
    Wang, Gang
    Du, Shangyi
    Jiang, Yurui
    Li, Xianyong
    FRONTIERS IN PHYSICS, 2025, 12
  • [8] Influence Maximization by Link Activation in Social Networks
    Yang, Wenjing
    Brenner, Leonardo
    Giua, Alessandro
    2018 IEEE 23RD INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2018, : 1248 - 1251
  • [9] Influence maximization algorithm based on cross propagation in location-based social networks
    Zhang, Zhen
    Zhang, Zhenyu
    Wu, Xiaohong
    WIRELESS NETWORKS, 2020, 26 (07) : 5035 - 5046
  • [10] Influence maximization algorithm based on cross propagation in location-based social networks
    Zhen Zhang
    Zhenyu Zhang
    Xiaohong Wu
    Wireless Networks, 2020, 26 : 5035 - 5046