2021
DOI: 10.1016/j.jnca.2020.102973
|View full text |Cite
|
Sign up to set email alerts
|

LIDDE: A differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(11 citation statements)
references
References 23 publications
0
11
0
Order By: Relevance
“…Meanwhile, only the undergraduates' political opinions are collected. In addition, three previous researches, that is, CAOM, 10 IMGA 11 and LIDDE 12 are used as the benchmarks. CAOM is a community‐based approach which includes community detection, selection of candidate nodes and generation of seed nodes.…”
Section: Methodsmentioning
confidence: 99%
“…Meanwhile, only the undergraduates' political opinions are collected. In addition, three previous researches, that is, CAOM, 10 IMGA 11 and LIDDE 12 are used as the benchmarks. CAOM is a community‐based approach which includes community detection, selection of candidate nodes and generation of seed nodes.…”
Section: Methodsmentioning
confidence: 99%
“…The population number parameter, the mutation weight parameter, and the C parameter are the probability of recombination or intersection, which is multiplied by the difference of the two vectors and added to the third vector. The F parameter is usually set between 0 and 2 and the C r parameter is between 0 and 1 [47]. In general, this algorithm has different stages, mutation, intersection or recombination, and finally the selection, which is described in Fig.…”
Section: Differential Evolution (De)mentioning
confidence: 99%
“…Tang et al [9] analyzed the effect of network topology characteristics, based on which a discrete shuffled frog-leaping algorithm was used for IM. Liu et al [34] used a local-influence-descending (LID) search strategy to construct a candidate set of nodes with relatively large influence, based on which a differential evolution (LIDDE) algorithm was developed for the IM problem. With sufficient iterations, LIDDE can perform with both accuracy and efficiency, but the results may be affected by network structures.…”
Section: Metaheuristic Approachesmentioning
confidence: 99%
“…Designing a metaheuristic algorithm for an NP-hard problem does not require an investigation of the properties of the problem, which saves considerable time and energy over problem-specific algorithms [37,31], such as the greedy-based CELF [19]. Evolutionary approaches have been reported to have good global search capability [30,34,31], and adaptive simulated annealing approaches can accelerate convergence [38,26,39,40]. Hence, we adopt these two approaches.…”
Section: Phased Hybrid Evaluation-enhanced Frameworkmentioning
confidence: 99%
See 1 more Smart Citation