Can I read A novel discrete ICO algorithm for influence maximization in complex networks on EtoBox?

A novel discrete ICO algorithm for influence maximization in complex networks by Vahideh Sahargahi; Vahid Majidnezhad; Saeid Taghavi Afshord; Yasser Jafari is a Computer Science article available to read on EtoBox.

What is A novel discrete ICO algorithm for influence maximization in complex networks about?

It is axiomatic that influence maximization is one of the major issues of the Internet today. In this paper a novel specialized metaheuristic algorithm is proposed to efficiently deal with it. The purpose of influence maximization is to select a subset of seed nodes in the network in order to influence other nodes maximally. The greedy methods present good results for influence maximization, but these algorithms involve very high computational time. Unlike greedy algorithms, meta-heuristic algorithms have acceptable efficiency. The ICO algorithm is just recently proposed as an ensign of meta-heuristic algorithms to solve continuous optimization problems in 2022. In this paper, a discrete version of ICO, called DICO, is proposed. The contribution of the proposed method is to present a new intelligent operator based on the nodes' degree and logistic mapping for initialization of solutions. In addition, novel approaches are proposed to reproduce each parent discretely. Another innovation of the proposed method is to present a new local search operator based on the network topology. In this operator, a tabu list is suggested to decrease the selection probability of nodes influenced by

Who reads A novel discrete ICO algorithm for influence maximization in complex networks?

Author

Vahideh Sahargahi; Vahid Majidnezhad; Saeid Taghavi Afshord; Yasser Jafari

Publisher

Springer Science and Business Media LLC

Published

2023

Language

EN

Field

Computer Science (Physical Sciences)