REVIEW 4 cited by
A Review on Graph Neural Network Methods in Financial Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
With multiple components and relations, financial data are often presented as graph data, since it could represent both the individual features and the complicated relations. Due to the complexity and volatility of the financial market, the graph constructed on the financial data is often heterogeneous or time-varying, which imposes challenges on modeling technology. Among the graph modeling technologies, graph neural network (GNN) models are able to handle the complex graph structure and achieve great performance and thus could be used to solve financial tasks. In this work, we provide a comprehensive review of GNN models in recent financial context. We first categorize the commonly-used financial graphs and summarize the feature processing step for each node. Then we summarize the GNN methodology for each graph type, application in each area, and propose some potential research areas.
Forward citations
Cited by 4 Pith papers
-
Heterogeneous Graph Backdoor Attack
HGBA is a backdoor attack against heterogeneous graph neural networks that uses a single relation-based trigger edge to achieve high attack success with low budget and resistance to defenses.
-
Universality and Approximation Rates of Graph Neural Networks with Random Features
PENNs with random node features universally approximate measurable perm-invariant/equivariant graph functions in probability, with explicit approximation rates for C^k targets.
-
EVINET: Towards Open-World Graph Learning via Evidential Reasoning Network
EviNet uses Beta embeddings and subjective logic to jointly detect misclassifications and out-of-distribution nodes on graphs, outperforming baselines on five benchmarks.
-
Efficient Recommendations via Graph Coarsening and Label Propagation
On a 13-million-user telecom graph, business-rule coarsening plus two label-propagation stages lifts NDCG@5 by up to 24% over full-graph LPA; a GNN first stage boosts it further.
Discussion (0). Sign in to comment.