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

Pin Ni, Qiao Yuan, Raad Khraishi, Ramin Okhrati, Aldo Lipani, F. Medda
{"title":"Eigenvector-based Graph Neural Network Embeddings and Trust Rating Prediction in Bitcoin Networks","authors":"Pin Ni, Qiao Yuan, Raad Khraishi, Ramin Okhrati, Aldo Lipani, F. Medda","doi":"10.1145/3533271.3561793","DOIUrl":null,"url":null,"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.","PeriodicalId":134888,"journal":{"name":"Proceedings of the Third ACM International Conference on AI in Finance","volume":"623 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third ACM International Conference on AI in Finance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3533271.3561793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

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.
基于特征向量的图神经网络嵌入与比特币网络信任度预测
鉴于其在各种图学习任务上的出色表现,图神经网络(gnn)越来越多地用于金融网络建模。然而,传统的gnn不能捕获高阶拓扑信息,并且在许多常见的金融应用中,它们的性能会随着负边的存在而下降。考虑到负边丰富的语义推理,排除负边作为一个明显的解决方案是不优雅的。另外,另一种基本方法是应用正规范化,但是,这也可能导致信息丢失。我们的工作提出了一个简单而有效的解决方案来克服这两个挑战,通过使用原始邻接矩阵的top-k最大特征值的特征向量进行预嵌入。这些预嵌入包含高阶拓扑知识和负边信息,然后将其馈送到具有正归一化邻接矩阵的GNN中以弥补其缺点。通过全面的实验和分析,我们实证地证明了我们提出的解决方案在比特币用户信誉评分预测任务中的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信