Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A k-means clustering based algorithm for shill bidding recognition in online auction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Bin Lei ; Sch. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China ; Huichao Zhang ; Huiyu Chen ; Lili Liu
more authors

A new method based on k-means clustering is proposed for the shill bidding detection in online auction. Through analyzing the behavioral characteristics of buyers, the proposed method extracts and quantifies four characteristics for every buyer, that is to say each buyer will be represented by a vector of four elements. Then all buyers are divided into two categories, i.e., shill bidding buyers and general buyers by the proposed k-means clustering based algorithm. An example that collects actual data of an online auction from one online store and then analyzes the data with SPSS is given to show that two types of buyers differ significantly on the four characteristics. The results illustrate that this new method is effective and suitable to be generally used.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012