Alibabacloud, Machine Learning, Graph Representation, Negative Sampling.
Metropolis-Hastings algorithm to solve this problem. The following figure shows the MCNS framework that we propose. This framework traverses the graph through depth first traversal (DFS) to acquire the Markov chain of the last node. It then uses the Metropolis-Hastings algorithm to reduce the time