Implementation of Influence Maximisation on a graph dataset.
-
Updated
Dec 12, 2018 - C++
Implementation of Influence Maximisation on a graph dataset.
Influential nodes identification & CELF implementation
In this repo. , "Cost Effective Lazy Forward Selection" Algorithm is implemented from scratch in python with only numpy library.
Add a description, image, and links to the celf topic page so that developers can more easily learn about it.
To associate your repository with the celf topic, visit your repo's landing page and select "manage topics."