Papers with Code 아카이브

Graph Learning

태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.

하위 태스크
2
평가표
1
보존된 평가 기록
1

Graph learning is a branch of machine learning that focuses on the analysis and interpretation of data represented in graph form. In this context, a graph is a collection of nodes (or vertices) and edges, where nodes represent entities and edges represent the relationships or interactions between these entities. This structure is particularly useful for modeling complex networks found in various domains such as social networks, biological networks, and communication networks.

Graph learning leverages the relationships and structures within the graph to learn and make predictions. It includes techniques like graph neural networks (GNNs), which extend the concept of neural networks to handle graph-structured data. These models are adept at capturing the dependencies and influence of connected nodes, leading to more accurate predictions in scenarios where relationships play a key role.

Key applications of graph learning include recommender systems, drug discovery, social network analysis, and fraud detection. By utilizing the inherent structure of graph data, graph learning algorithms can uncover deep insights and patterns that are not apparent with traditional machine learning approaches.

기법

관련 논문에서 소개한 기법입니다. 이 태스크에서의 평가 여부는 평가 결과에서 확인하세요.

EGT

Transformer neural networks have achieved state-of-the-art results for unstructured data such as text and images but their adoption for graph-structured data has been limited. This is partly due to the difficulty of incorporating complex structural information in the basic transformer framework. We propose a simple yet powerful extension to the transformer - residual edge channels. The resultant framework, which we call Edge-augmented Graph Transformer (EGT), can directly accept, process and output structural information as well as node information. It allows us to use global self-attention, the key element of transformers, directly for graphs and comes with the benefit of long-range interaction among nodes. Moreover, the edge channels allow the structural information to evolve from layer to layer, and prediction tasks on edges/links can be performed directly from the output embeddings of these channels. In addition, we introduce a generalized positional encoding scheme for graphs based on Singular Value Decomposition which can improve the performance of EGT. Our framework, which relies on global node feature aggregation, achieves better performance compared to Convolutional/Message-Passing Graph Neural Networks, which rely on local feature aggregation within a neighborhood. We verify the performance of EGT in a supervised learning setting on a wide range of experiments on benchmark datasets. Our findings indicate that convolutional aggregation is not an essential inductive bias for graphs and global self-attention can serve as a flexible and adaptive alternative.

Global Self-Attention as a Replacement for Graph Convolution

Graph Contrastive Coding

Graph Contrastive Coding is a self-supervised graph neural network pre-training framework to capture the universal network topological properties across multiple networks. GCC's pre-training task is designed as subgraph instance discrimination in and across networks and leverages contrastive learning to empower graph neural networks to learn the intrinsic and transferable structural representations.

GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training

출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.