Influence maximization algorithm based on Gaussian propagation model
From MaRDI portal
Recommendations
- Influence maximization in social networks under an independent cascade-based model
- Mixed heuristic and greedy strategies based algorithm for influence maximization in social networks
- An improved community-based greedy algorithm for solving the influence maximization problem in social networks
- An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks
- Influence Maximization in Social Networks
Cites work
- An efficient linear programming based method for the influence maximization problem in social networks
- Influence maximization with deactivation in social networks
- Interaction-Aware Influence Maximization in Social Networks
- Maximizing positive influence in competitive social networks: a trust-based solution
- The first passage time problem for Gauss-diffusion processes: algorithmic approaches and applications to LIF neuronal model
Cited in
(4)- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
- An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks
- Influence maximization in social networks using role-based embedding
- Influencer identification of threshold models in hypergraphs
This page was built for publication: Influence maximization algorithm based on Gaussian propagation model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086341)