Research on social network influence maximization algorithm based on time sequential relationship
For the time sequential relationship between nodes in a dynamic social network,social network influence maximization based on time sequential relationship was proved.The problem was to find k nodes on a time sequential social network to maximize the spread of information.Firstly,the propagation prob...
Saved in:
Main Authors: | Jing CHEN, Ziyi QI |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2020-10-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020191/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Influence maximization algorithm of social networks based on Transformer model
by: YU Shuke, et al.
Published: (2024-12-01) -
Influence maximization algorithm based on social network
by: Xuan WANG, et al.
Published: (2022-08-01) -
Greedy algorithms: a review and open problems
by: Andrea García
Published: (2025-02-01) -
Spreading Social Influence with both Positive and Negative Opinions in Online Networks
by: Jing (Selena) He, et al.
Published: (2019-06-01) -
EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks
by: Chuanhuang LI, et al.
Published: (2024-02-01)