DEDGAT: Dual Embedding of Directed Graph Attention Networks for Detecting Financial Risk

by   Jiafu Wu, et al.

Graph representation plays an important role in the field of financial risk control, where the relationship among users can be constructed in a graph manner. In practical scenarios, the relationships between nodes in risk control tasks are bidirectional, e.g., merchants having both revenue and expense behaviors. Graph neural networks designed for undirected graphs usually aggregate discriminative node or edge representations with an attention strategy, but cannot fully exploit the out-degree information when used for the tasks built on directed graph, which leads to the problem of a directional bias. To tackle this problem, we propose a Directed Graph ATtention network called DGAT, which explicitly takes out-degree into attention calculation. In addition to having directional requirements, the same node might have different representations of its input and output, and thus we further propose a dual embedding of DGAT, referred to as DEDGAT. Specifically, DEDGAT assigns in-degree and out-degree representations to each node and uses these two embeddings to calculate the attention weights of in-degree and out-degree nodes, respectively. Experiments performed on the benchmark datasets show that DGAT and DEDGAT obtain better classification performance compared to undirected GAT. Also,the visualization results demonstrate that our methods can fully use both in-degree and out-degree information.


page 1

page 2

page 3

page 4


Edge-Featured Graph Attention Network

Lots of neural network architectures have been proposed to deal with lea...

Asymmetric Graph Representation Learning

Despite the enormous success of graph neural networks (GNNs), most exist...

Local Graph Embeddings Based on Neighbors Degree Frequency of Nodes

We propose a local-to-global strategy for graph machine learning and net...

Heterophily-Aware Graph Attention Network

Graph Neural Networks (GNNs) have shown remarkable success in graph repr...

Why Using Either Aggregated Features or Adjacency Lists in Directed or Undirected Graph? Empirical Study and Simple Classification Method

Node classification is one of the hottest tasks in graph analysis. In th...

How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision

Attention mechanism in graph neural networks is designed to assign large...

Sampling unknown large networks restricted by low sampling rates

Graph sampling plays an important role in data mining for large networks...

Please sign up or login with your details

Forgot password? Click here to reset