Eigenvector-based Graph Neural Network Embeddings and Trust Rating Prediction in Bitcoin Networks

5Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given their strong performance on a variety of graph learning tasks, Graph Neural Networks (GNNs) are increasingly used to model financial networks. Traditional GNNs, however, are not able to capture higher-order topological information, and their performance is known to degrade with the presence of negative edges that may arise in many common financial applications. Considering the rich semantic inference of negative edges, excluding them as an obvious solution is not elegant. Alternatively, another basic approach is to apply positive normalization, however, this also may lead to information loss. Our work proposes a simple yet effective solution to overcome these two challenges by employing the eigenvectors with top-k largest eigenvalues of the raw adjacency matrix for pre-embeddings. These pre-embeddings contain high-order topological knowledge together with the information on negative edges, which are then fed into a GNN with a positively normalized adjacency matrix to compensate for its shortcomings. Through comprehensive experiments and analysis, we empirically demonstrate the superiority of our proposed solution in a Bitcoin user reputation score prediction task.

Cite

CITATION STYLE

APA

Ni, P., Yuan, Q., Khraishi, R., Okhrati, R., Lipani, A., & Medda, F. (2022). Eigenvector-based Graph Neural Network Embeddings and Trust Rating Prediction in Bitcoin Networks. In Proceedings of the 3rd ACM International Conference on AI in Finance, ICAIF 2022 (pp. 27–35). Association for Computing Machinery, Inc. https://doi.org/10.1145/3533271.3561793

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free