**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

No evaluation results yet. Help compare methods by
submit
evaluation metrics.

In this work, we collect abundant relationships from common user behaviors and item information, and propose a novel framework named IntentGC to leverage both explicit preferences and heterogeneous relationships by graph convolutional networks.

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

GRAPH EMBEDDING LINK PREDICTION NETWORK EMBEDDING NODE CLASSIFICATION

Many Network Representation Learning (NRL) methods have been proposed to learn vector representations for vertices in a network recently.

DIMENSIONALITY REDUCTION LINK PREDICTION MULTI-LABEL CLASSIFICATION NETWORK EMBEDDING

A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes.

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.

COMMUNITY DETECTION GRAPH CLUSTERING NETWORK EMBEDDING NODE CLASSIFICATION

We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram.

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.

MULTI-CLASS CLASSIFICATION NETWORK EMBEDDING NODE CLASSIFICATION

To this end, we present a Binarized Attributed Network Embedding model (BANE for short) to learn binary node representation.

Ranked #1 on Link Prediction on Wiki

GRAPH EMBEDDING LINK PREDICTION NETWORK EMBEDDING NODE CLASSIFICATION