GNPA: a hybrid model for social influence maximization in dynamic networks

被引:1
作者
Agarwal, Sakshi [1 ]
Mehta, Shikha [1 ]
机构
[1] Jaypee Inst Informat Technol, Comp Sci & Informat Technol, Noida 201309, India
关键词
Social network; Influence maximization; Genetic algorithm; Genetic network programming; Apriori algorithm; Graph theory; FEATURE-SELECTION; ALGORITHM; CLASSIFICATION; OPTIMIZATION; EFFICIENT;
D O I
10.1007/s11042-021-11606-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the growing size of online social communities, influence propagation in social networks has become a hot topic of the research. Most of the studies in this area are based on the assumption that the structure of the social network is static and does not change during the information spread process. However, real-world social networks are dynamic. Modeling this continuous dynamic behavior of social networks is a challenge that must be tackled. This paper proposes a hybrid Genetic Network Programming with Apriori algorithm (GNPA) for Influence Maximization (IM) in social networks. Proposed GNPA is a meta-heuristic based optimization algorithm that handles the dynamicity, i.e. user attribute values or connection between users that changes with time. The working of GNPA is divided into 5 steps. It begins with the identification of the initial population of seeds using discounted degree method. Next, it predicts the future changes using the Apriori algorithm and updates the network accordingly. After updating the network dynamics, the influence score is estimated using the local consistent Factorization machines for each edge of the network. Finally, the diffusion score of each individual of the population is calculated using a linear cascade model. After the completion of all the above steps, the population is updated by replacing the weak individuals with new individuals using mutation and crossover, which is the last step of GNPA. The efficacy of GNPA is evaluated over two real and two synthetic datasets with low out-degree ratio and high out-degree ratio. Experimental results demonstrated that GNPA is able to predict the changing behavior of the users close to the actual-time network and improved the influence propagation 16% to 38% as compared to the contemporary counterparts.
引用
收藏
页码:3057 / 3084
页数:28
相关论文
共 57 条
[1]  
Agarwal Sakshi, 2020, International Conference on Innovative Computing and Communications. Proceedings of ICICC 2019. Advances in Intelligent Systems and Computing (AISC 1087), P97, DOI 10.1007/978-981-15-1286-5_9
[2]  
Agarwal S., 2019, IJITEE, V8, P2560
[3]  
AGARWAL S, 2017, ANN DATA SCI, V4, P547
[4]   Effective influence estimation in twitter using temporal, profile, structural and interaction characteristics [J].
Agarwal, Sakshi ;
Mehta, Shikha .
INFORMATION PROCESSING & MANAGEMENT, 2020, 57 (06)
[5]  
Agarwal S, 2018, INT CONF CONTEMP, P29
[6]  
Agrawal R., P 20 INT C VERY LARG
[7]  
[Anonymous], 1995, INKDD192197
[8]   Influence Maximization in Social Networks with Genetic Algorithms [J].
Bucur, Doina ;
Iacca, Giovanni .
APPLICATIONS OF EVOLUTIONARY COMPUTATION, EVOAPPLICATIONS 2016, PT I, 2016, 9597 :379-392
[9]   Feature selection for text classification with Naive Bayes [J].
Chen, Jingnian ;
Huang, Houkuan ;
Tian, Shengfeng ;
Qu, Youli .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) :5432-5435
[10]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207