Adaptive strategy for boosting node costs minimization in multi-round influence
CSTR:
Author:
Affiliation:

1.College of Computer Science and Technology, Zhejiang University, Hangzhou 310027 , China ; 2.School of Computer and Computing Science, Hangzhou City University, Hangzhou 310015 , China ; 3.Zhejiang Provincial Key Laboratory of Social Security Governance Big Data, Hangzhou 310016 , China

Clc Number:

TP301

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to reduce the marketing costs of merchants promoting products over multiple rounds on social networks,this study made a exploration on the selection of boosting nodes during the process of multi-round influence propagation. Based on the model of multi-round influence boosting propagation mode, an adaptive strategy for choosing boosting nodes was designed. Given known seed nodes, this strategy could find an efficient method to minimize the number of marketing rounds needed to reach a certain threshold of social influence, with nearly linear algorithmic complexity. Experimental results show that compared to existing heuristic algorithms and non-adaptive algorithms, the designed adaptive strategy can reduce the promotion rounds required to reach a specified threshold by 7.3%~18.3%, effectively reducing the promotion cost.

    Reference
    Related
    Cited by
Get Citation

张龙姣, 付冰洋, 史麒豪, 等. 多轮次影响传播下的增益节点成本最小化动态策略[J]. 国防科技大学学报, 2025, 47(3): 21-31.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 06,2023
  • Revised:
  • Adopted:
  • Online: June 03,2025
  • Published:
Article QR Code