Detecting Fraudulent Personalities in Networks of Online Auctioneers Duen Horng (“Polo”) Chau Shashank Pandit Christos Faloutsos School of Computer Science.

Slides:

Advertisements

Similar presentations

By: Jason Baltazar MIS 304 Credit Card Fraud and Prevention.

Advertisements

Gated Graphs and Causal Inference

BiG-Align: Fast Bipartite Graph Alignment

CMU SCS I2.2 Large Scale Information Network Processing INARC 1 Overview Goal: scalable algorithms to find patterns and anomalies on graphs 1. Mining Large.

School of Computer Science Carnegie Mellon University Duke University DeltaCon: A Principled Massive- Graph Similarity Function Danai Koutra Joshua T.

School of Computer Science Carnegie Mellon University National Taiwan University of Science & Technology Unifying Guilt-by-Association Approaches: Theorems.

Clustering by Passing Messages Between Data Points Brendan J. Frey and Delbert Dueck Science, 2007.

Voroat Kong ENG393 Section 501 Date: 6 th May, 2010.

Xiaowei Ying, Xintao Wu, Daniel Barbara Spectrum based Fraud Detection in Social Networks 1.

Node labels as random variables prior belief observed neighbor potentials compatibility potentials Opinion Fraud Detection in Online Reviews using Network.

CMU SCS C. Faloutsos (CMU)#1 Large Graph Algorithms Christos Faloutsos CMU McGlohon, Mary Prakash, Aditya Tong, Hanghang Tsourakakis, Babis Akoglu, Leman.

Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.

CMU SCS Mining Billion-node Graphs Christos Faloutsos CMU.

Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.

Co-Training and Expansion: Towards Bridging Theory and Practice Maria-Florina Balcan, Avrim Blum, Ke Yang Carnegie Mellon University, Computer Science.

Positive Feedback Loops in DHTs or Be Careful How You Simulate January 13, 2004 Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz From “Handling.

Belief Propagation, Junction Trees, and Factor Graphs

09/28/2007 CIS Dept., UMass Dartmouth 1 Trustworthy Agent-Based Online Auction Systems Prof. Haiping Xu Concurrent Software Systems Laboratory Computer.

Understanding Belief Propagation and its Applications Dan Yuan June 2004.

Belief Propagation Kai Ju Liu March 9, Statistical Problems Medicine Finance Internet Computer vision.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

Internet Fraud By Brianna Byard. What is it? The Internet is a place where you can buy products, meet people, and socialize. But it is very easy for people.

Computer Viruses. Where the name came from This is a phrase coined from biology to describe a piece of software that behaves very much like a real virus.

GAYATRI SWAMYNATHAN, CHRISTO WILSON, BRYCE BOE, KEVIN ALMEROTH AND BEN Y. ZHAO UC SANTA BARBARA Do Social Networks Improve e-Commerce? A Study on Social.

Traffic Sign Recognition Using Artificial Neural Network Radi Bekker

Models of Influence in Online Social Networks

Web Payments via Christopher Woods Aaron Buma. Agenda  Introduction  About it  Why to use it  Services they Provide  Seller Protection  Ebay Aspect.

Mining Large Graphs Part 3: Case studies Jure Leskovec and Christos Faloutsos Machine Learning Department Joint work with: Lada Adamic, Deepay Chakrabarti,

CMU SCS Big (graph) data analytics Christos Faloutsos CMU.

CS490D: Introduction to Data Mining Prof. Chris Clifton April 14, 2004 Fraud and Misuse Detection.

Faculty: Dr. Chengcui Zhang Students: Wei-Bang Chen Song Gao Richa Tiwari.

How I Bought My New Mobile Online. The reluctance and the resistance…

Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.

School of Computer Science Carnegie Mellon University National Taiwan University of Science & Technology Unifying Guilt-by-Association Approaches: Theorems.

CMU SCS KDD'09Faloutsos, Miller, Tsourakakis P0-1 Large Graph Mining: Power Tools and a Practitioner’s guide Christos Faloutsos Gary Miller Charalampos.

Carnegie Mellon School of Computer Science Modeling Website Popularity Competition in the Attention-Activity Marketplace Bruno Ribeiro Christos Faloutsos.

1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.

1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.

GraphLab: how I understood it with sample code Aapo Kyrola, Carnegie Mellon Univ. Oct 1, 2009.

Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.

CMU SCS Large Graph Mining Christos Faloutsos CMU.

Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Jon Kleinberg (Cornell), Christos.

Online Auction b 資管一 JOSEPHINE 周家裕. INTRODUCTION ． NOWADAYS, ONLINE AUCTION IS VERY POPULAR ． THE MOST FAMOUS AND LARGEST ONLINE AUCTION COMPANY.

Survey Propagation. Outline Survey Propagation: an algorithm for satisfiability 1 – Warning Propagation – Belief Propagation – Survey Propagation Survey.

Evaluating Network Security with Two-Layer Attack Graphs Anming Xie Zhuhua Cai Cong Tang Jianbin Hu Zhong Chen ACSAC (Dec., 2009) 2010/6/151.

INTERNET: The Good, The Bad and The Ugly

Understanding e-Commerce A-Level Ict. E-Commerce is impossible to avoid now days.Almost everyone in the western world is at one point a consumer of the.

1 Mean Field and Variational Methods finishing off Graphical Models – Carlos Guestrin Carnegie Mellon University November 5 th, 2008 Readings: K&F:

On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.

MindReader: Querying databases through multiple examples Yoshiharu Ishikawa (Nara Institute of Science and Technology, Japan) Ravishankar Subramanya (Pittsburgh.

Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.

Tools for large graph mining WWW 2008 tutorial Part 4: Case studies Jure Leskovec and Christos Faloutsos Machine Learning Department Joint work with: Lada.

Single-Pass Belief Propagation

Trusted P2P Transactions with Fuzzy Reputation Aggregation Authors: S. song, K. Hwang, and R. Zhou University of Southern California Yu-Kwong Kwok University.

Efficient Belief Propagation for Image Restoration Qi Zhao Mar.22,2006.

1 Relational Factor Graphs Lin Liao Joint work with Dieter Fox.

CopyCatch: Stopping Group Attacks by Spotting Lockstep Behavior in Social Networks (WWW2013) BEUTEL, ALEX, WANHONG XU, VENKATESAN GURUSWAMI, CHRISTOPHER.

1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.

Sybil Attacks VS Identity Clone Attacks in Online Social Networks Lei Jin, Xuelian Long, Hassan Takabi, James B.D. Joshi School of Information Sciences.

Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University

Fraud Detection with Machine Learning: A Case Study from Sift Science

CNP Fraud. Occurs when a fraudster falsifies an application to acquire a credit card using an individual’s personal information. (Eg: postal intercept)

Inferring Networks of Diffusion and Influence

Emotion propagation in online communities

Distributed voting application for handheld devices

Cognitive Computer Vision

Integrating Deep Learning with Cyber Forensics

Large Graph Mining: Power Tools and a Practitioner’s guide

Markov Networks.

Mean Field and Variational Methods Loopy Belief Propagation

Presentation transcript:

Detecting Fraudulent Personalities in Networks of Online Auctioneers Duen Horng (“Polo”) Chau Shashank Pandit Christos Faloutsos School of Computer Science Carnegie Mellon PKDD ’06, Berlin, Germany

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 2 Duen Horng (Polo) CHAU (author of these foils – used with his permission) Shashank PANDIT

Online auctions: very popular

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 4 Why care about auction fraud? REASON 1: it’s a serious problem 14,500 complaints received by Internet Crime Complaint Center in USA in 2005 Average loss per incident: > US$385 REASON 2: it’s a hard problem No systematic approaches, until now.

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 5 Potential Buyer CPotential Buyer B Potential Buyer A $$$ Example of an online auction Seller $ $$ Buyer A Transaction

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 6 $$$ Example of an online auction Seller Buyer A Transaction What if something goes BAD in the transaction? Non-delivery fraud Very Common We focus on dealing with it.

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 7 Buyer Feedback score: 15 $$$ Feedback on an online auction Seller Feedback score: 70 A Transaction + 1 = = 14 Each user has a feedback score (= # positive feedback - # negative feedback)

How to game the feedback system? (and how to guard against gaming?)

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 9

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 10 Do fraudsters follow some patterns when they boost reputation? Too “wasteful”; whole (near) clique will be lost Will never deliver

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 11 They form near-bipartite cores The bad guys (humans) create 2 types of users Accomplice Trade mostly with honest users Looks legitimate Fraudster Trade mostly with accomplices Don’t trade with other fraudsters

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 12 Why near-bipartite cores? Allow accomplices to be reused Hard to discover because they look very legitimate Fraudsters will get voided, but only one at a time Will never deliver

Research Goal: Detect the suspicious near-bipartite cores Our Approach: Use the belief propagation (BP) algorithm

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 14 Belief Propagation (BP) algorithm Efficient way to solve inference problems based on passing local messages E.g. Used in early vision problem, such as image restoration Useful for our problem as well! (Thanks to John Lafferty for pointers!) Details

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 15 Belief at each node Probability being fraudster Probability being accomplice Probability being honest Details

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 16 Example Message passing is iterative. Beliefs keep being updated, until equilibrium is reached A C B E D Details

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 17 Edge Compatibility Function The function specifies how the belief of a node affects its neighbors (in our case, it captures the bipartite core structure) In our context, the function can be represented as the following matrix: Entry(i, j) = probability that a node is in state j given that it has a neighbor in state i Details

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 18 Belief propagation -- mathematically Details Message to send out from a node based on its belief Belief at a node Edge compatibility function

Experiments

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 20 Fraudsters Accomplices Honest Confirmed Fraudsters Effectiveness on real data Real data from eBay 60K users; 1M edges (more data – 12Gb/day…)

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 21

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 22 In the news (thanks to Byron Spice) WSJ online AP LA Times San Jose Mercury News KDKA USA Today

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 23 Industrial etc interest e-bay Symantec (thanks to Bill Courtright of PDL) ‘Belgian police’ -> probably fraudster in disguise (!?)

“Detecting Fraudulent Personalities in Networks of Online Auctioneers” Polo Chau, Shashank Pandit, Christos Faloutsos School of Computer Science, Carnegie Mellon University, USA 24 Conclusions Method to detect auction fraud Use belief propagation Detect the near bipartite cores Evaluated with real eBay data and synthetic data