–tags: Graph Embedding Techniques

Deepwalk:

  • uses concept of walk as embedding process

  • walk: traversal of graph by moving from one node to another as long as they have common edge

  • Traversal can be represented by having one node representation after other and continue the chain.

  • Similar to word vectors: inputs can be splits of the sequence of such giant representation of walk.

  • Now, the probability of having some node as output given the total representation is computed.

  • Instead of running along word corpus, the graph network instead runs across graphs

  • Operation is similar to Word2Vec

  • Problem: Whenever a new node is added, the network must be retrained again to incorporate it’s info.