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

Time-sensitive Positive Influence Maximization in signed social networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…They also formulated an algorithm for knapsack seeding of the network that runs on each layer of the multiplex in parallel. Wang et al [ 24 ] proposed the time-sensitive positive influence maximization problem by considering two factors simultaneously, to select the seed node set that would achieve the maximum spreading of positive influence within a specified time limit. Furthermore, they constructed a heat diffusion-based polarity influence diffusion model and an improved k -step greedy seed node selection algorithm to solve the TP-IM problem.…”
Section: Related Workmentioning
confidence: 99%
“…They also formulated an algorithm for knapsack seeding of the network that runs on each layer of the multiplex in parallel. Wang et al [ 24 ] proposed the time-sensitive positive influence maximization problem by considering two factors simultaneously, to select the seed node set that would achieve the maximum spreading of positive influence within a specified time limit. Furthermore, they constructed a heat diffusion-based polarity influence diffusion model and an improved k -step greedy seed node selection algorithm to solve the TP-IM problem.…”
Section: Related Workmentioning
confidence: 99%