Combining ranking concept and social network analysis to detect collusive groups in online auctions

被引:24
作者
Lin, Shi-Jen [2 ]
Jheng, Yi-Ying [2 ]
Yu, Cheng-Hsien [1 ,2 ]
机构
[1] China Univ Technol, Hsinchu, Taiwan
[2] Natl Cent Univ, Jhongli, Taoyuan, Taiwan
关键词
Ranking method; Collusive group detection; Online auction;
D O I
10.1016/j.eswa.2012.02.039
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the popularity of online auction markets, auction fraud has become common. Typically, fraudsters will create many accounts and then transact among these accounts to get a higher rating score. This is easy to do because of the anonymity and low fees of the online auction platform. A literature review revealed that previous studies focused on detection of abnormal rating behaviors but did not provide a ranking method to evaluate how dangerous the fraudsters are. Therefore, we propose a process which can provide a method to detect collusive fraud groups in online auctions. First, we implement a Web crawling agent to collect real auction cases and identify potential collusive fraud groups based on a k-core clustering algorithm. Second, we define a data cleaning process to remove the unrelated data. Third, we use the Page-Rank algorithm to discover the critical accounts of the groups. Fourth, we developed a ranking method for auction fraud evaluation. This method is an extension of the standard Page-Rank algorithm and combines the concepts of Web structure and risk evaluation. Finally, we conduct experiments using the Adaptive Neuro-Fuzzy Inference System (ANFIS) neural network and verify the performance of our method by applying it to real auction cases. In summary, we find that the proposed ranking method is effective in identifying potential collusive fraud groups. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:9079 / 9086
页数:8
相关论文
共 33 条
[1]  
[Anonymous], P 1996 ACM SIGCPR SI
[2]  
[Anonymous], 1998, Connections
[3]  
[Anonymous], J KNOWLEDGE INFORMAT
[4]  
[Anonymous], 2000, ACM SIGKDD EXPLORATI, DOI DOI 10.1145/846183.846188
[5]  
[Anonymous], 2008, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data
[6]  
Borgatti S., 2010, WHAT IS SOCIAL NETWO
[7]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[8]   Formal methods: State of the art and future directions [J].
Clarke, EM ;
Wing, JM .
ACM COMPUTING SURVEYS, 1996, 28 (04) :626-643
[9]  
Cooley R, 1997, ICTAI
[10]   Combating online in -auction fraud: Clues, techniques and challenges' [J].
Dong, Fei ;
Shatz, Sol M. ;
Xu, Haiping .
COMPUTER SCIENCE REVIEW, 2009, 3 (04) :245-258