Miao-WANG-Trista/Influence-Maximization-on-Graph-Data
Influential nodes identification & CELF implementation
When you need to spread a message or product through a network, like social media or professional connections, this helps you identify the most impactful individuals. It takes information about how people are connected (who knows whom) and outputs a list of 'seed' individuals who, if targeted, will maximize the spread of your message within a set budget. This is for marketers, campaign managers, or anyone needing to achieve viral growth through word-of-mouth.
No commits in the last 6 months.
Use this if you need to find the most influential people in a network to kickstart a viral marketing campaign or information spread.
Not ideal if your decision relies heavily on individual characteristics beyond network connections, such as a person's recent activity or seniority.
Stars
9
Forks
1
Language
Jupyter Notebook
License
—
Category
Last pushed
Jun 01, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Miao-WANG-Trista/Influence-Maximization-on-Graph-Data"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
pyg-team/pytorch_geometric
Graph Neural Network Library for PyTorch
a-r-j/graphein
Protein Graph Library
raamana/graynet
Subject-wise networks from structural MRI, both vertex- and voxel-wise features (thickness, GM...
pykale/pykale
Knowledge-Aware machine LEarning (KALE): accessible machine learning from multiple sources for...
dmlc/dgl
Python package built to ease deep learning on graph, on top of existing DL frameworks.