期刊文献+

银行交易网络的链路预测 被引量:1

Link Prediction on Bank Transaction Network
下载PDF
导出
摘要 基于银行交易具有动态变化、时效性和重复性的特点,文中通过对银行网络进行清洗和压缩,研究银行网络的基本拓扑统计性质和聚类结构,并得到交易网络满足复杂网络的小世界和无标度特性。针对已有的链路预测算法在动态网络预测中的不足,提出一种自适应的动态链路算法对银行客户交易进行预测。该方法在预测网络的基础上添加了节点重要性与节点连接强弱性两个特性,并将3种预测算法结合随机算法进行了对比分析。随后将这3种算法运用到具有动态交易特性的3类真实数据集中进行实验验证。实验结果显示,新算法的预测精度约为75%。将该算法与经典的预测算法进行比较发现,提出的算法在预测方面的性能提升了5%~10%。 Based on the dynamic changes in bank transactions and the characteristics of timeliness and repeatability, the basic topology statistical properties and clustering structure of the bank's network were studied, and obtained the transaction network satisfied with the small-world and scale-free characteristics.Based on the deficiency of existing link prediction algorithms in dynamic network prediction, a new dynamic link algorithm was proposed to predict bank customer transactions. Then, based on the algorithm mentioned above, two characteristics, the three predictive algorithms combined with the random algorithm were compared. These three algorithms were applied to the three types of real data sets with dynamic transaction characteristics for experimental verification. The results showed that the prediction accuracy of the algorithm was about 75%. Finally, comparing the algorithm with the classical prediction algorithm, the proposed algorithm improved the prediction by 5% to 10%.
作者 马青青 闫光辉 王雅斐 武昱 MA Qingqing;YAN Guanghui;WANG Yafei;WU Yu(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)
出处 《电子科技》 2019年第5期55-61,80,共8页 Electronic Science and Technology
基金 国家自然科学基金(61662066)~~
关键词 复杂网络 链路预测 银行网络 节点重要性 强弱性 准确度 complex network link prediction bank network node centrality strength and weakness accuracy
  • 相关文献

参考文献4

二级参考文献99

  • 1GETOOR L,DIEHL C P.Link mining:a survey[J].ACM SIGKDD Explorations Newsletter,2005,7(2):3-12.
  • 2SARUKKAI R R.Link prediction and path analysis using markov chains[J].Computer Networks,2000,33(1-6):377-386.
  • 3ZHU J,HONG J,HUGHES J G Using markov chains for link prediction in adaptive web sites[J].Lect Notes Comput Sci,2002,2311:60-73.
  • 4POPESCUL A,UNGAR L.Statistical relational learning for link prediction[C] //Proceedings of the Workshop on Learning Statistical Models from Relational Data.New York:ACM Press,2003:81-87.
  • 5O'MADADHAIN J,HUTCHINS J,SMYTH P.Prediction and ranking algorithms for event-based network data[C] //Proceedings of the ACM SIGKDD 2005.New York:ACM Press,2005:23-30.
  • 6LIN D.An information-theoretic definition of similarity[C] //Proceedings of the 15th Intl Conf Mach.Learn..San Francisco,Morgan Kaufman Publishers,1998:296-304.
  • 7LIBEN-NOWELL D,KLEINBERG J.The link-prediction problem for social networks[J].J Am Soc Inform Sci Technol,2007,58(7):1019-1031.
  • 8CLAUSET A,MOORE C,NEWMAN M E J.Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453:98-101.
  • 9HOLLAND P W,LASKEY K B,LEINHARD S.Stochastic blockmodels:First steps[J].Social Networks,1983,5:109-137.
  • 10GUIMERA R,SALES-PARDO M.Missing and spurious interactions and the reconstruction of complex networks[J].Proc Natl Sci Acad USA,2009,106(52):22073-22078.

共引文献263

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部