Unsupervised Network Embedding Beyond Homophily
Network embedding (NE) approaches have emerged as a predominant technique to represent complex networks and have benefited numerous tasks. However, most NE approaches rely on a homophily assumption to learn embeddings with the guidance of supervisory signals, leaving the unsupervised heterophilous scenario relatively unexplored. This problem becomes especially relevant in fields where a scarcity of labels exists. Here, we formulate the unsupervised NE task as an r-ego network discrimination problem and develop the SELENE framework for learning on networks with homophily and heterophily. Specifically, we design a dual-channel feature embedding pipeline to discriminate r-ego networks using node attributes and structural information separately. We employ heterophily adapted self-supervised learning objective functions to optimise the framework to learn intrinsic node embeddings. We show that SELENE's components improve the quality of node embeddings, facilitating the discrimination of connected heterophilous nodes. Comprehensive empirical evaluations on both synthetic and real-world datasets with varying homophily ratios validate the effectiveness of SELENE in homophilous and heterophilous settings showing an up to 12.52% clustering accuracy gain.
Code (1)
Tasks
Network EmbeddingSelf-Supervised LearningSimilar Papers 제목 키워드 기반
Graph Representation Learning Beyond Node and Homophily
Unsupervised graph representation learning aims to distill various graph information into a downstream task-agnostic dense vector embedding. However, existing graph representation learning approaches are designed mainly …
Edge ClassificationGraph EmbeddingGraph Representation LearningNode Classification+1Beyond Node Embedding: A Direct Unsupervised Edge Representation Framework for Homogeneous Networks
Network representation learning has traditionally been used to find lower dimensional vector representations of the nodes in a network. However, there are very important edge driven mining tasks of interest to the classi…
Link PredictionNetwork EmbeddingRepresentation LearningBeyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
We investigate the representation power of graph neural networks in the semi-supervised node classification task under heterophily or low homophily, i.e., in networks where connected nodes may have different class labels…
Graph Neural NetworkNode ClassificationNode Classification on Non-Homophilic (Heterophilic) GraphsMulti-View Graph Representation Learning Beyond Homophily
Unsupervised graph representation learning(GRL) aims to distill diverse graph information into task-agnostic embeddings without label supervision. Due to a lack of support from labels, recent representation learning meth…
AttributeGraph Representation LearningRepresentation LearningSelf-Supervised LearningFeature-Centric Unsupervised Node Representation Learning Without Homophily Assumption
Unsupervised node representation learning aims to obtain meaningful node embeddings without relying on node labels. To achieve this, graph convolution, which aggregates information from neighboring nodes, is commonly emp…
Representation Learning