2021
DOI: 10.1111/exsy.12676
|View full text |Cite
|
Sign up to set email alerts
|

A novel meta‐heuristic approach for influence maximization in social networks

Abstract: Influence maximization in a social network focuses on the task of extracting a small set of nodes from a network which can maximize the propagation in a cascade model. Though greedy methods produce good solutions to the aforementioned problem, their high computational complexity is a major drawback. Centrality‐based heuristic methods often fail to overcome local optima, thereby producing sub‐optimal results. To this end, in this article, a framework has been presented which involves community detection in a so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 61 publications
(82 reference statements)
0
4
0
Order By: Relevance
“…Tests are undertaken on three underlying networks of varied sizes. This helps in examining the performance of the presented technique: the NetHEPT Network (large), the NetScience Network (medium) and the Dolphin Network (small) [12]. Detailed data description is provided in Table 2 when IM-CAβCRO is evaluated using 2-hop influence spread.…”
Section: Datasetsmentioning
confidence: 99%
See 1 more Smart Citation
“…Tests are undertaken on three underlying networks of varied sizes. This helps in examining the performance of the presented technique: the NetHEPT Network (large), the NetScience Network (medium) and the Dolphin Network (small) [12]. Detailed data description is provided in Table 2 when IM-CAβCRO is evaluated using 2-hop influence spread.…”
Section: Datasetsmentioning
confidence: 99%
“…We have varied the seed size for comparison purposes. The performance of IM-CAβCRO is compared with CELF [31], CELF++ [23], Degree centrality [26], Page Rank [10], Random [27], CMA-IM [21], DPSO [22], Infuence Maximization using Social Spider Optimization (IM-SSO) [42], Ant-colony optimization (ACO-IM) [43] and HFSLA-IM [12]. The obtained results are depicted in Fig 4 . As it is obvious from the graphs, IM-CAβCRO performs better compared to other techniques.…”
Section: Comparison Based On 2-hop Influence Spreadmentioning
confidence: 99%
“…Researchers have also leveraged local search techniques 16 in combination with global optimizers to enhance exploitation of the search space and thereby achieve a better quality solution. Chatterjee et al 71 proposed a novel local search embedded meta‐heuristic framework for influence maximization in social networks. Yousri et al 72 combined Flower Pollination Algorithm with a fractional‐order calculus based local search method for image segmentation.…”
Section: Related Workmentioning
confidence: 99%
“…However, since the greedy‐based algorithm needs to compute each user's marginal influence in each iteration, most approaches for this direction take long running time and have low efficiency. The other direction is the heuristic‐based algorithms and their extensions which could increase the efficiency while they usually have relatively small influence spread (Boroujeni & Soleimani, 2023; Chatterjee et al, 2021; Chen et al, 2009; He et al, 2019; Jiang et al, 2011; Kim et al, 2013; Ma & Liu, 2019; Tang et al, 2017). Although, many researchers have explored the influence maximization problem, there still lacks an efficient and accurate scheme for the influence maximization problem.…”
Section: Introductionmentioning
confidence: 99%