Two-level Graph Neural Network
Graph Neural Networks (GNNs) are recently proposed neural network structures for the processing of graph-structured data. Due to their employed neighbor aggregation strategy, existing GNNs focus on capturing node-level information and neglect high-level information. Existing GNNs therefore suffer from representational limitations caused by the Local Permutation Invariance (LPI) problem. To overcome these limitations and enrich the features captured by GNNs, we propose a novel GNN framework, referred to as the Two-level GNN (TL-GNN). This merges subgraph-level information with node-level information. Moreover, we provide a mathematical analysis of the LPI problem which demonstrates that subgraph-level information is beneficial to overcoming the problems associated with LPI. A subgraph counting method based on the dynamic programming algorithm is also proposed, and this has time complexity is O(n^3), n is the number of nodes of a graph. Experiments show that TL-GNN outperforms existing GNNs and achieves state-of-the-art performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph Neural NetworkSubgraph CountingVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoders
Generative models for graph data are an important research topic in machine learning. Graph data comprise two levels that are typically analyzed separately: node-level properties such as the existence of a link between a…
Graph GenerationDiscriminative Graph-level Anomaly Detection via Dual-students-teacher Model
Different from the current node-level anomaly detection task, the goal of graph-level anomaly detection is to find abnormal graphs that significantly differ from others in a graph set. Due to the scarcity of research on …
Anomaly DetectionEnhancing the Utility of Higher-Order Information in Relational Learning
Higher-order information is crucial for relational learning in many domains where relationships extend beyond pairwise interactions. Hypergraphs provide a natural framework for modeling such relationships, which has moti…
Relational ReasoningGraph-Level Embedding for Time-Evolving Graphs
Graph representation learning (also known as network embedding) has been extensively researched with varying levels of granularity, ranging from nodes to graphs. While most prior work in this area focuses on node-level r…
Anomaly DetectionGraph Representation LearningGraph SimilarityLanguage Modeling+4Multi-level Graph Matching Networks for Deep and Robust Graph Similarity Learning
While the celebrated graph neural networks yield effective representations for individual nodes of a graph, there has been relatively less success in extending to graph similarity learning. Recent works have considered e…
Graph ClassificationGraph MatchingGraph Neural NetworkGraph Similarity