Chinese Journal of Network and Information Security ›› 2019, Vol. 5 ›› Issue (5): 48-55.doi: 10.11959/j.issn.2096-109x.2019050

• Special Column: Routing Technology in Complex Network Environment • Previous Articles     Next Articles

Frequent path discovery algorithm for financial network

Fang LYU, Fenghe TANG, Junheng HUANG, Bailing WANG()   

  1. School of Computer Science and Technology,Harbin Institute of Technology(weihai),Weihai 264209,China
  • Revised:2019-02-10 Online:2019-10-15 Published:2019-11-02
  • Supported by:
    The National Key Research and Development Program of China(2018YFB2004201);The National Key Research and Development Program of China(2017YFB0801804);Frontier Science and Technology in Notation of China(2016QY05X1002-2);National Regional Innovation Center Science and Technology Special Project of China(2017QYCX14);Key Research and Development Program of Shandong Province(2017CXGC0706);The Fundamental Research Funds for the Central Universities(HIT.NSRIF.2020098);2017 University Co-construction Project in Weihai City

Abstract:

With the proliferation of various illegal financial activities,more and more attention is paid to the research of finding criminal cues in financial network by scholars.The characteristics of the transaction data generated by bank accounts are analyzed in detail,and a general model of bank account transaction network is established.On this basis,a two-direction active edge searching method is proposed to solve the problem of evaluating the relationship strength between financial entities.And then,a breadth-first frequent path discovery algorithm with depth controlled is presented,with which the way how the financial flows is restored.Experiment results on the real bank data show that the above two methods are effective in solving the problem of peer prediction and financial tracking respectively.

Key words: two-direction active edge, frequent path, peer prediction, financial tracking

CLC Number: 

No Suggested Reading articles found!