Motif Prediction with Graph Neural Networks
Link prediction is one of the central problems in graph mining. However, recent studies highlight the importance of higher-order network analysis, where complex structures called motifs are the first-class citizens. We first show that existing link prediction schemes fail to effectively predict motifs. To alleviate this, we establish a general motif prediction problem and we propose several heuristics that assess the chances for a specified motif to appear. To make the scores realistic, our heuristics consider - among others - correlations between links, i.e., the potential impact of some arriving links on the appearance of other links in a given motif. Finally, for highest accuracy, we develop a graph neural network (GNN) architecture for motif prediction. Our architecture offers vertex features and sampling schemes that capture the rich structural properties of motifs. While our heuristics are fast and do not need any training, GNNs ensure highest accuracy of predicting motifs, both for dense (e.g., k-cliques) and for sparse ones (e.g., k-stars). We consistently outperform the best available competitor by more than 10% on average and up to 32% in area under the curve. Importantly, the advantages of our approach over schemes based on uncorrelated link prediction increase with the increasing motif size and complexity. We also successfully apply our architecture for predicting more arbitrary clusters and communities, illustrating its potential for graph mining beyond motif analysis.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph MiningGraph Neural NetworkLink PredictionPredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Financial Default Prediction via Motif-preserving Graph Neural Network with Curriculum Learning
User financial default prediction plays a critical role in credit risk forecasting and management. It aims at predicting the probability that the user will fail to make the repayments in the future. Previous methods main…
Binary ClassificationGraph Neural NetworkM-GLC: Motif-Driven Global-Local Context Graphs for Few-shot Molecular Property Prediction
Molecular property prediction (MPP) is a cornerstone of drug discovery and materials science, yet conventional deep learning approaches depend on large labeled datasets that are often unavailable. Few-shot Molecular prop…
Molecular Property PredictionDrug DiscoveryMotifExplainer: a Motif-based Graph Neural Network Explainer
We consider the explanation problem of Graph Neural Networks (GNNs). Most existing GNN explanation methods identify the most important edges or nodes but fail to consider substructures, which are more important for graph…
Graph Neural NetworkMulti-MotifGAN (MMGAN): Motif-targeted Graph Generation and Prediction
Generative graph models create instances of graphs that mimic the properties of real-world networks. Generative models are successful at retaining pairwise associations in the underlying networks but often fail to captur…
Generative Adversarial NetworkGraph GenerationPredictionMotif-based Graph Self-Supervised Learning for Molecular Property Prediction
Predicting molecular properties with data-driven methods has drawn much attention in recent years. Particularly, Graph Neural Networks (GNNs) have demonstrated remarkable success in various molecular generation and predi…
Molecular Property PredictionProperty PredictionRetrosynthesisSelf-Supervised Learning