ACM Home Page
Please provide us with feedback. Feedback
Netprobe: a fast and scalable system for fraud detection in online auction networks
Full text PdfPdf (1.19 MB)
Source
International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents
Banff, Alberta, Canada
SESSION: Mining in social networks table of contents
Pages: 201 - 210  
Year of Publication: 2007
ISBN:978-1-59593-654-7
Authors
Shashank Pandit  Carnegie Mellon University, Pittsburgh, PA
Duen Horng Chau  Carnegie Mellon University, Pittsburgh, PA
Samuel Wang  Carnegie Mellon University, Pittsburgh, PA
Christos Faloutsos  Carnegie Mellon University, Pittsburgh, PA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 165,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242600
What is a DOI?

ABSTRACT

Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe, a system that we propose for solving this problem. NetProbe models auction users and transactions as a Markov Random Field tuned to detect the suspicious patterns that fraudsters create, and employs a Belief Propagation mechanism to detect likely fraudsters. Our experiments show that NetProbe is both efficient and effective for fraud detection. We report experiments on synthetic graphs with as many as 7,000 nodes and 30,000 edges, where NetProbe was able to spot fraudulent nodes with over 90% precision and recall, within a matter of seconds. We also report experiments on a real dataset crawled from eBay, with nearly 700,000 transactions between more than 66,000users, where NetProbe was highly effective at unearthing hidden networks of fraudsters, within a realistic response time of about 6 minutes. For scenarios where the underlying data is dynamic in nature, we propose IncrementalNetProbe, which is an approximate, but fast, variant of NetProbe. Our experiments prove that Incremental NetProbe executes nearly doubly fast as compared to NetProbe, while retaining over 99% of its accuracy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Auctionbytes: ebay auction fraud spawns vigilantism trend. http://www.auctionbytes.com/cab/abn/y02/m10/i12/s01, 2002.
 
2
 
3
D. H. Chau and C. Faloutsos. Fraud detection in electronic auction. In European Web Mining Forum at ECML/PKDD, 2005.
 
4
D. H. Chau, S. Pandit, and C. Faloutsos. Detecting fraudulent personalities in networks of online auctioneers. In Proc. ECML/PKDD, 2006.
 
5
 
6
ebay inc. announces third quarter 2006 financial results. http: //biz.yahoo.com/bw/061018/20061018005916.html?.v=1, October 2006.
 
7
ebay: Avoiding fraud. http://pages.ebay.com/securitycenter/avoiding fraud.html, 2006.
 
8
Federal trade commission: Internet auctions: A guide for buyers and sellers. http: //www.ftc.gov/bcp/conline/pubs/online/auctions.htm, 2004.
 
9
Z. Gyongyi, H. G. Molina, and J. Pedersen. Combating web spam with trustrank. In VLDB, 2004.
 
10
Internet fraud complaint center: Ic3 2004 internet fraud -- crime report. http://www.ifccfbi.gov/strategy/statistics.asp, 2005.
 
11
 
12
 
13
M. Melnik and J. Alm. Does a seller's ecommerce reputation matter? evidence from ebay auctions. Journal of Industrial Economics, 50:337--49, 2002.
 
14
J. Neville and D. Jensen. Collective classification with relational dependency networks. In 2nd Multi-Relational Data Mining Workshop, SIGKDD, 2003.
15
16
17
 
18
P. Resnick, R. Zeckhauser, J. Swanson, and K. Lockwood. The value of reputation on ebay: A controlled experiment, 2003.
 
19
 
20
Usa today: How to avoid online auction fraud. http://www.usatoday.com/tech/columnist/2002/05/07/yaukey.htm, 2002.
21
 
22
23
 
24
25


Collaborative Colleagues:
Shashank Pandit: colleagues
Duen Horng Chau: colleagues
Samuel Wang: colleagues
Christos Faloutsos: colleagues