一种基于距离的欺诈风险分析方法

中国管理科学 ›› 2003, Vol. ›› Issue (1): 38-41.

一种基于距离的欺诈风险分析方法

柳炳祥¹, 盛昭瀚²

1. 东南大学经济管理学院南京 210096;
2. 南京大学管理科学与工程研究院南京 210093

收稿日期:2002-01-29 出版日期:2003-02-28 发布日期:2012-03-06
基金资助:
国家自然科学基金资助项目(79830010)

A Research Method of Cheating Risks Based on Distance

LIU Bing-xiang¹, SHENG Zhao-han²

1. School of Economics and Management, Southeast University, Nanjing 210096, China;
2. Institute of Management Science and Engineering, Nanjing University, Nanjing 210093, China

Received:2002-01-29 Online:2003-02-28 Published:2012-03-06

摘要/Abstract

摘要： 叙述了欺诈的基本概念,分析了欺诈风险产生的原因,研究了欺诈风险的识别、分析和评价方法,指出了传统的欺诈风险分析模型存在的局限性,提出了一种基于距离的欺诈风险分析方法,并通过一个信用卡欺诈的模拟实验说明了该方法的可行性和有效性,为欺诈风险的分析提供了一种新的思路和分析方法。

关键词: 欺诈, 距离, 意外规则, 离群数据, k个最近邻居点

Abstract: This paper tells the basic concept of the cheat and analyses the procreant reason of resulting in the cheat.The method of identification,analyzing and estimation of the cheat risks are discussed.It points out the existent problems of the tradition analyzing models in evaluating cheat risks.In the end,this paper puts forward to a research method of cheat risks based on distance and validates this method’s validity by a simulation experiment.The research work supplies a basis for further study of applying data mining for the enterprise cheating risks anglicizing.

Key words: cheating, distance, exceptional rules, outlier data, k-th nearest neighbor point

中图分类号:

F224.3

柳炳祥,盛昭瀚. 一种基于距离的欺诈风险分析方法[J]. 中国管理科学, 2003, (1): 38-41.

LIU Bing-xiang,SHENG Zhao-han. A Research Method of Cheating Risks Based on Distance[J]. Chinese Journal of Management Science, 2003, (1): 38-41.

参考文献

[1] 基特·塞德格洛失[英].商务风险管理完全指南[M].沈阳:沈阳出版社,2001.
[2] 詹姆斯·德阿克[美].企业的泛风险管理[M].长春:吉林人民出版社,2001.
[3] Marilyn Greenstein,Todd M Feinman.Electronic commerce:Security,Risk Management and Control[M].McGraw-Hill Companies,2000.
[4] 玛丽莲·格林斯坦[美].电子商务的安全与风险管理[美].北京:华夏出版社,2001.
[5] Fayyad U M,Piatetsky-Shapiro G,Smyth P.Advance in knowledge discover and data mining[M].California,The MIT Press,1996,1-25.
[6] 郑斌祥,杜秀华,席裕庚.一种时序数据的离群数据挖掘新算法[J].控制与决策,2002,(5):324-327.
[7] 孙海洪,夏克俭,扬炳儒.一种挖掘意外规则的快速算法[J].计算机工程与应用,2001,(19):49-51.
[8] 史东辉,张春阳,蔡庆生.离群数据的挖掘方法研究[J].小型微型计算机系统,2001,(10):1234-1237
[9] Jiawei Han,Micheline Kamber.数据挖掘概念与技术[M].北京:机械工业出版社,2001.
[10] 王越.KDD方法在金融欺诈检测中的应用研究[J].计算机工程与设计,2002,(5):43-46.
[11] Ahn B S,Cho S SmKim C Y.The integrated methodology of rough set theory and artificial neural network for business failure prediction[J].Expert System with Application,2000,18:65-74.
[12] Huges.The complete database marketer:second generation strategies and techniques for tapping the power of your customer database[M].Chicago,Irwin Professional,1996.
[13] Alex Berson.构建面向CRM的数据挖掘应用[M].北京:人民邮电出版社,2001.
[14] Charles X.Ling,Chenghui Li.Data Mining for Direct Marketing:Problems and solutions[C].In Proceedings of KDD98:the AAAI-18 workshop on Knowledge Discovery in Databases,AAAI Technical Report,1998.
[15] 刘同明.数据挖掘技术及其应用[M].北京:国防工业出版社,2001.