Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning

by   Costas Mavromatis, et al.

Unsupervised (or self-supervised) graph representation learning is essential to facilitate various graph data mining tasks when external supervision is unavailable. The challenge is to encode the information about the graph structure and the attributes associated with the nodes and edges into a low dimensional space. Most existing unsupervised methods promote similar representations across nodes that are topologically close. Recently, it was shown that leveraging additional graph-level information, e.g., information that is shared among all nodes, encourages the representations to be mindful of the global properties of the graph, which greatly improves their quality. However, in most graphs, there is significantly more structure that can be captured, e.g., nodes tend to belong to (multiple) clusters that represent structurally similar nodes. Motivated by this observation, we propose a graph representation learning method called Graph InfoClust (GIC), that seeks to additionally capture cluster-level information content. These clusters are computed by a differentiable K-means method and are jointly optimized by maximizing the mutual information between nodes of the same clusters. This optimization leads the node representations to capture richer information and nodal interactions, which improves their quality. Experiments show that GIC outperforms state-of-art methods in various downstream tasks (node classification, link prediction, and node clustering) with a 0.9 over the best competing approach, on average.


page 1

page 2

page 3

page 4


HeMI: Multi-view Embedding in Heterogeneous Graphs

Many real-world graphs involve different types of nodes and relations be...

Self-Supervised Graph Representation Learning via Global Context Prediction

To take full advantage of fast-growing unlabeled networked data, this pa...

HDMI: High-order Deep Multiplex Infomax

Networks have been widely used to represent the relations between object...

An unsupervised cluster-level based method for learning node representations of heterogeneous graphs in scientific papers

Learning knowledge representation of scientific paper data is a problem ...

RepBin: Constraint-based Graph Representation Learning for Metagenomic Binning

Mixed communities of organisms are found in many environments (from the ...

Semi-Supervised Deep Learning for Multiplex Networks

Multiplex networks are complex graph structures in which a set of entiti...

node2coords: Graph Representation Learning with Wasserstein Barycenters

In order to perform network analysis tasks, representations that capture...

Please sign up or login with your details

Forgot password? Click here to reset