English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Information diffusion in networks has received a lot of recent attention.Most previous work addresses the influence maximization problem of selecting anappropriate set of seed nodes to initiate the diffusion process so that thelargest number of nodes is reached. Since the seed selection problem is NPhard, most solutions are sub-optimal. Furthermore, there may be settings inwhich the seed nodes are predetermined. Thus, a natural question that arise is:given a set of seed nodes, can we select a small set of nodes such that if weimprove their reaction to the diffusion process, the largest increase indiffusion spread is achieved? We call this problem, the boost set selectionproblem. In this paper, we formalize this problem, study its complexity andpropose appropriate algorithms. We also evaluate the effect of boosting in anumber of real networks and report the increase of influence spread achievedfor different seed sets, time limits in the diffusion process and otherdiffusion parameters.

Boosting Nodes for Improving the Spread of Influence