Learning node representation via Motif Coarsening
Motifs, as fundamental units of the graph, play a significant role in modeling complex systems in a variety of domains, including social networks, as well as biology and neuroscience. Motif preservation is a widely studied problem that provides new avenues for structure preservation. This paper is dedicated to exploring the significance of motifs with various patterns and effectively incorporating different motif patterns into node-level graph representation learning. We propose a novel node Representation learning framework via Motif Coarsening (RMC), which effectively incorporates different granularity structural information into node representation learning. RMC consists of two parallel components, the node representation learning aggregator and the motif-based node representation learning aggregator. In the node representation learning process, RMC directly encodes lower-order structures into node representation by a one-layer graph convolution network. For the motif-based node representation learning process, we propose a Motif Coarsening strategy for incorporating motif structure into the graph representation learning process. Furthermore, the MotifRe-Weighting strategy is proposed to biased convert motif representation into motif-based node representation. We verify the effectiveness of RMC by several node-related tasks on a series of widely used real-world datasets. Experimental results demonstrate that our proposed framework delivers superior promising representation performance to existing benchmarks. Ablation experiments proved that RMC has potential as an auxiliary framework, which indicates the excellent quality of Motif Coarsening and MotifRe-Weighting strategies over existing benchmarks from several evaluation metrics, involving mean classification accuracy, Micro-F1, and Macro-F1.
Code (1)
Tasks
Graph Representation LearningRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Gromov-Wasserstein Graph Coarsening
We study the problem of graph coarsening within the Gromov-Wasserstein geometry. Specifically, we propose two algorithms that leverage a novel representation of the distortion induced by merging pairs of nodes. The first…
An Efficient Loop and Clique Coarsening Algorithm for Graph Classification
Graph Transformers (GTs) have made remarkable achievements in graph-level tasks. However, most existing works regard graph structures as a form of guidance or bias for enhancing node representations, which focuses on nod…
Graph ClassificationGraph Representation LearningRepresentation LearningScaling Up Graph Neural Networks Via Graph Coarsening
Scalability of graph neural networks remains one of the major challenges in graph machine learning. Since the representation of a node is computed by recursively aggregating and transforming representation vectors of its…
Stochastic OptimizationMolecular Representation Learning via Heterogeneous Motif Graph Neural Networks
We consider feature representation learning problem of molecular graphs. Graph Neural Networks have been widely used in feature representation learning of molecular graphs. However, most existing methods deal with molecu…
graph constructionGraph Neural NetworkGraph Representation Learningmolecular representation+2Motif Graph Neural Network
Graphs can model complicated interactions between entities, which naturally emerge in many important applications. These applications can often be cast into standard graph learning tasks, in which a crucial step is to le…
Graph ClassificationGraph EmbeddingGraph LearningGraph Neural Network+1