| Using Link Analysis Technique with a Modified Shortest-Path Algorithm to Fight Money Laundering |
| |
| 作者姓名： | CHEN Yunkai MAI Quanwe LU Zhengding |
| |
| 作者单位： | [1]College of Computer Science and Technology,Huazhong University of Science and Technology, Wuhan430074, Hubei, China [2]Department of Informaiton, State Administration ofForeign Exchange, Beijing 100037, China |
| |
| 基金项目： | Supported by the National Tenth Five-Year Plan for Scientific and Technological Development of China （2001BA102A06-11） |
| |
| 摘 要： | Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.
|
| 关 键 词： | 联结分析 短路算法 法律实施 智能处理 |
| 文章编号： | 1007-1202（2006）05-1352-05 |
| 收稿时间： | 2006-03-20 |
Using link analysis technique with a modified shortest-path algorithm to fight money laundering |
| |
| CHEN Yunkai MAI Quanwe LU Zhengding.Using Link Analysis Technique with a Modified Shortest-Path Algorithm to Fight Money Laundering[J].Wuhan University Journal of Natural Sciences,2006,11(5):1352-1356. |
| |
| Authors: | Chen Yunkai Mai Quanwen Lu Zhengding |
| |
| Institution: | (1) College of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan, Hubei, China;(2) Department of Informaton, State Administration of Foreign Exchange, 100037 Beijing, China |
| |
| Abstract: | Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority-First-Search (PFS) algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first. |
| |
| Keywords: | link analysis shortest-path algorithm fight money laundering |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
