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

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.

[1]  Toramatsu Shintani,et al.  A new approach to detecting shill bids in e-auctions , 2007, Int. J. Intell. Inf. Database Syst..

[2]  Jarrod Trevathan,et al.  Detecting Collusive Shill Bidding , 2007, Fourth International Conference on Information Technology (ITNG'07).

[3]  T. Matsuo,et al.  An approach to avoiding shill bids based on combinatorial auction in volume discount , 2005, Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems (RRS'05).

[4]  D. Silva,et al.  The effect of shill bidding upon prices: Experimental evidence , 2007 .

[6]  Shill Bidding in Online English Auction , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.