DocumentCode
2667221
Title
A k-means clustering based algorithm for shill bidding recognition in online auction
Author
Bin Lei ; Huichao Zhang ; Huiyu Chen ; Lili Liu ; Dingwei Wang
Author_Institution
Sch. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
fYear
2012
fDate
23-25 May 2012
Firstpage
939
Lastpage
943
Abstract
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.
Keywords
Internet; commerce; pattern clustering; Internet; behavioral characteristics; k-means clustering based algorithm; online auction; shill bidding recognition; Character recognition; Clustering algorithms; Cost accounting; Educational institutions; Internet; Support vector machine classification; Time factors; Character extraction; K-means clustering; Online auction; Shill bidding identification;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2012 24th Chinese
Conference_Location
Taiyuan
Print_ISBN
978-1-4577-2073-4
Type
conf
DOI
10.1109/CCDC.2012.6244147
Filename
6244147
Link To Document