EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data

• URL: http://arxiv.org/abs/2009.14588v1
• Date: Wed, 30 Sep 2020 12:09:28 GMT
• Title: EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data
• Authors: Ivan Sukharev, Valentina Shumovskaia, Kirill Fedyanin, Maxim Panov and Dmitry Berestnev
• Abstract summary: We show that information about connections between clients based on money transfers between them allows us to significantly improve the quality of credit scoring. We develop a new graph neural network model EWS-GCN that combines ideas of graph convolutional and recurrent neural networks via attention mechanism.
• Score: 2.1169216065483996
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we discuss how modern deep learning approaches can be applied to the credit scoring of bank clients. We show that information about connections between clients based on money transfers between them allows us to significantly improve the quality of credit scoring compared to the approaches using information about the target client solely. As a final solution, we develop a new graph neural network model EWS-GCN that combines ideas of graph convolutional and recurrent neural networks via attention mechanism. The resulting model allows for robust training and efficient processing of large-scale data. We also demonstrate that our model outperforms the state-of-the-art graph neural networks achieving excellent results

Related papers

• Analysis of Information Propagation in Ethereum Network Using Combined Graph Attention Network and Reinforcement Learning to Optimize Network Efficiency and Scalability [2.795656498870966]
  We develop a Graph Attention Network (GAT) and Reinforcement Learning (RL) model to optimize the network efficiency and scalability. In the experimental evaluation, we analyze the performance of our model on a large-scale dataset. The results indicate that our designed GAT-RL model achieves superior results compared to other GCN models in terms of performance.
  arXiv  Detail & Related papers  (2023-11-02T17:19:45Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• AoI-based Temporal Attention Graph Neural Network for Popularity Prediction and Content Caching [9.16219929722585]
  Information-centric network (ICN) aims to proactively keep limited popular content at the edge of network based on predicted results. In this paper, we leverage an effective dynamic graph neural network (DGNN) to jointly learn the structural and temporal patterns embedded in the bipartite graph. We also propose an age of information (AoI) based attention mechanism to extract valuable historical information.
  arXiv  Detail & Related papers  (2022-08-18T02:57:17Z)
• Spiking Graph Convolutional Networks [19.36064180392385]
  SpikingGCN is an end-to-end framework that aims to integrate the embedding of GCNs with the biofidelity characteristics of SNNs. We show that SpikingGCN on a neuromorphic chip can bring a clear advantage of energy efficiency into graph data analysis.
  arXiv  Detail & Related papers  (2022-05-05T16:44:36Z)
• Neural Capacitance: A New Perspective of Neural Network Selection via Edge Dynamics [85.31710759801705]
  Current practice requires expensive computational costs in model training for performance prediction. We propose a novel framework for neural network selection by analyzing the governing dynamics over synaptic connections (edges) during training. Our framework is built on the fact that back-propagation during neural network training is equivalent to the dynamical evolution of synaptic connections.
  arXiv  Detail & Related papers  (2022-01-11T20:53:15Z)
• BScNets: Block Simplicial Complex Neural Networks [79.81654213581977]
  Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning. We present Block Simplicial Complex Neural Networks (BScNets) model for link prediction. BScNets outperforms state-of-the-art models by a significant margin while maintaining low costs.
  arXiv  Detail & Related papers  (2021-12-13T17:35:54Z)
• Graph-Based Neural Network Models with Multiple Self-Supervised Auxiliary Tasks [79.28094304325116]
  Graph Convolutional Networks are among the most promising approaches for capturing relationships among structured data points. We propose three novel self-supervised auxiliary tasks to train graph-based neural network models in a multi-task fashion.
  arXiv  Detail & Related papers  (2020-11-14T11:09:51Z)
• Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
  We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training. FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
  arXiv  Detail & Related papers  (2020-10-19T21:51:47Z)
• GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
  Graph representation learning has emerged as a powerful technique for addressing real-world problems. We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework. We conduct experiments on three graph learning tasks and ten graph datasets.
  arXiv  Detail & Related papers  (2020-06-17T16:18:35Z)
• Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data [2.1169216065483996]
  We propose a new graph neural network model, which uses not only the topological structure of the network but rich time-series data available for the graph nodes and edges. The proposed model outperforms the existing approaches, with a significant gap in ROC AUC score on link prediction problem and also allows to improve the quality of credit scoring.
  arXiv  Detail & Related papers  (2020-01-23T10:02:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.