Graph Embeddings (node2vec) explained - How nodes get mapped to vectors

preview_player
Показать описание
Learn how the node2vec algorithm works. 🚀

To unlock Machine Learning Algorithms on graphs, we need a way to represent our data networks as vectors.

I will help you understand how simple the node2vec approach is.

We will walk through the maths and explore how we can generate powerful graph embeddings.

1. Understand the problem
2. What's the context of a node in a graph
3. The equation of the optimization problem.
Рекомендации по теме
Комментарии
Автор

Very good explanation. Thank you. I have one question if you don't mind. At time 6:48 you are showing the contexts of nodes u and v. However I am not sure how to interpret the contexts. Why are 4 and 8 left out of the context of u, and why are 3, 4 and 6 left out of the context of v?

farrugiamarc
Автор

Pretty detailed and well-structured explanation, thanks!

AlexanderSergeenko
Автор

Hi phillip,
Are we training on only positive contexts? Cant we show some negative contexts to model to make it more context aware

unknownfacts-mfhr
Автор

Thank you for covering a not so popular topic. Much appreciated!

Till 6:35 I could follow along perfectly but afterwards, I was left confused. What is node v? Why are the context vectors different from both DFS and BFS from the previous slide? The orders are different and some numbers are missing.

prateekyadav
Автор

Pretty Good! Philipp! Your explanation is easy to understand! I think it would be better if you can include the implementation of the technology with some popular coding techniques such as Python! Wait for more amazing videos!

zhiyuzhang
Автор

Thank you for the explanation. Could you please provide the details of the paper you mentioned in the video?

suhailamsooppy
Автор

Thank you for the lecture. Please guide on how to use these embeddings for Question _answer task using knowledge Graph

pranitamahajan
Автор

Great content Phillip!, is it possible to create a more practical playlist for beginners?
Something we can follow

reubenseyram
Автор

Thank you, I think that I get rough imagination of the paper.

linyaka