Whether or Network Graph embedding embedding is via node (node) and FIG side, embedding a learning vector for each node.
More popular algorithms:
General application framework as follows:
1, FIG. Construction: Item item and the co-occurrence similarity matrix may constitute a network, wherein each item is a node, two item similarity reaches a predetermined threshold value has a direct connection side, of the degree of similarity smaller than the threshold is not connected.
2, walk strategy: inside the network, have come from a random node to the next node connection. Go several steps, we get a sequence of nodes.
deepwalk probability for selecting the next all edges connected to the node similarity value taken softmax, i.e. the probability scale value of 0 to 1. node2vec method combines DFS and BFS manner.
3, learning embedding vector: the sequence into which random walk model learning word2vec give embedding vector for each node.
4, learned embedding vector machine learning methods for classification.
Links summary: https://github.com/shenweichen/GraphEmbedding