Network Embedding is a collective term for techniques for mapping graph nodes to vectors of real numbers in a multidimensional space. To be useful, a good embedding should preserve the structure of the graph. The vectors can then be used as input to various network and graph analysis tasks, such as link prediction
Implementation and experiments of graph embedding algorithms. deep walk, LINE(Large-scale Information Network Embedding), node2vec, SDNE(Structural Deep Network Embedding), struc2vec
Ranked #2 on Node Classification on Wikipedia
Therefore, how to ﬁnd a method that is able to effectively capture the highly non-linear network structure and preserve the global and local structure is an open yet important problem.
Ranked #2 on Graph Classification on BP-fMRI-97
This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction.
Ranked #5 on Node Classification on Wikipedia
Many Network Representation Learning (NRL) methods have been proposed to learn vector representations for vertices in a network recently.
Latent factor models for community detection aim to find a distributed and generally low-dimensional representation, or coding, that captures the structural regularity of network and reflects the community membership of nodes.
TENE learns the representations of nodes under the guidance of both proximity matrix which captures the network structure and text cluster membership matrix derived from clustering for text information.
As opposed to manual feature engineering which is tedious and difficult to scale, network representation learning has attracted a surge of research interests as it automates the process of feature learning on graphs.