A learning-based influence maximization framework for complex networks via K-core hierarchies and reinforcement learning
- 14 September 2024
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 259
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (62172167)
This publication has 44 references indexed in Scilit:
- Identifying hidden target nodes for spreading in complex networksChaos, Solitons & Fractals, 2023
- FIP: A fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networksExpert Systems with Applications, 2022
- Influence maximization in social networks using graph embedding and graph neural networkInformation Sciences, 2022
- Identification of spreading influence nodes via multi-level structural attributes based on the graph convolutional networkExpert Systems with Applications, 2022
- A dynamic algorithm based on cohesive entropy for influence maximization in social networksExpert Systems with Applications, 2021
- An efficient path-based approach for influence maximization in social networksExpert Systems with Applications, 2021
- Influential nodes detection in dynamic social networks: A surveyExpert Systems with Applications, 2020
- Maximum likelihood-based influence maximization in social networksApplied Intelligence, 2020
- Community-based influence maximization for viral marketingApplied Intelligence, 2019
- Scalable influence maximization for independent cascade model in large-scale social networksData Mining and Knowledge Discovery, 2012