Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Node2Vec #1075

Open
JoshInnis opened this issue Dec 26, 2023 · 0 comments
Open

Node2Vec #1075

JoshInnis opened this issue Dec 26, 2023 · 0 comments
Assignees
Labels
enhancement New feature or request Functionality

Comments

@JoshInnis
Copy link
Contributor

Description (via Wikipedia)

node2vec is an algorithm to generate vector representations of nodes on a graph. The node2vec framework learns low-dimensional representations for nodes in a graph through the use of random walks through a graph starting at a target node. It is useful for a variety of machine learning applications. Besides reducing the engineering effort, representations learned by the algorithm lead to greater predictive power.[1] node2vec follows the intuition that random walks through a graph can be treated like sentences in a corpus. Each node in a graph is treated like an individual word, and a random walk is treated as a sentence. By feeding these "sentences" into a skip-gram, or by using the continuous bag of words model paths found by random walks can be treated as sentences, and traditional data-mining techniques for documents can be used. The algorithm generalizes prior work which is based on rigid notions of network neighborhoods, and argues that the added flexibility in exploring neighborhoods is the key to learning richer representations of nodes in graphs.[2] The algorithm is considered one of the best graph classifiers.[3]

See also

Struc2vec
Graph Neural Network

References

"node2vec: Scalable Feature Learning for Networks".
Grover, Aditya; Leskovec, Jure (2016). "Node2vec". Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Vol. 2016. pp. 855–864. arXiv:1607.00653. Bibcode:2016arXiv160700653G. doi:10.1145/2939672.2939754. ISBN 9781450342322. PMC 5108654. PMID 27853626.
Khosla, Megha; Setty, Vinay; Anand, Avishek (2020). "A Comparative Study for Unsupervised Network Representation Learning". IEEE Transactions on Knowledge and Data Engineering: 1. arXiv:1903.07902. doi:10.1109/tkde.2019.2951398. S2CID 207870054.

Some Useful Links

https://medium.com/illumination/unravelling-node2vec-a-guide-to-node-embeddings-with-python-implementation-c131603153bd
https://stellargraph.readthedocs.io/en/stable/demos/node-classification/node2vec-node-classification.html
https://snap.stanford.edu/node2vec/
https://en.wikipedia.org/wiki/Node2vec

@JoshInnis JoshInnis self-assigned this Dec 26, 2023
@JoshInnis JoshInnis moved this to 🆕 New in Embeddings Dec 26, 2023
@JoshInnis JoshInnis added enhancement New feature or request Functionality labels Dec 26, 2023
@JoshInnis JoshInnis added this to the Graph Machine Learning milestone Dec 26, 2023
@JoshInnis JoshInnis removed this from the Graph Machine Learning milestone May 22, 2024
@github-project-automation github-project-automation bot moved this from 🆕 New to ✅ Done in Embeddings May 22, 2024
@JoshInnis JoshInnis reopened this Sep 21, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request Functionality
Projects
No open projects
Status: ✅ Done
Development

No branches or pull requests

1 participant