Cluster-based analysis and recommendation of sellers in online auctions

被引:0
作者
Morzy, Mikolaj [1 ]
机构
[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland
来源
COMPUTER SYSTEMS SCIENCE AND ENGINEERING | 2007年 / 22卷 / 05期
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Online auctions are quickly becoming one of the leading branches of e-commerce. Unfortunately, this popular and powerful retail channel is exposed to various types of fraud, some of which are very sophisticated. The main weapons against scam in online auctions are reputation systems. Unfortunately, popular online auction sites use only simple reputation systems that are easy to deceive, thus offering users little protection against organized fraud. in this paper we present a new reputation measure that is both robust and resistant to fraud. Our measure is based on the notion of the density of online auction sellers. It uses indirect information about the performance of sellers, making it extremely difficult for fraudsters to gain unearned reputation. Furthermore, the design of the density reputation measure allows to unearth natural clusters of sellers appearing in the auction data. Based on these clusters, fully automated and description independent recommendations can be generated. Density reputation measure uses the topology of connections between sellers and buyers of online auctions to derive knowledge about trustworthy sellers. To evaluate our proposal we perform experiments on a large body of data acquired from a leading Polish provider of online auctions.
引用
收藏
页码:279 / 287
页数:9
相关论文
共 20 条
  • [1] Aberer K., 2001, Proceedings of the 2001 ACM CIKM. Tenth International Conference on Information and Knowledge Management, P310, DOI 10.1145/502585.502638
  • [2] [Anonymous], 2003, P 4 ACM C EL COMM
  • [3] Building trust in online auction markets through an economic incentive mechanism
    Ba, SL
    Whinston, AB
    Zhang, H
    [J]. DECISION SUPPORT SYSTEMS, 2003, 35 (03) : 273 - 286
  • [4] BEAM C, 1998, AUCTIONS INTERNET FI
  • [5] CHEN M, 2001, EC 01, P154
  • [6] Guha Ramanthan, 2004, P 13 INT C WORLD WID, P403, DOI DOI 10.1145/988672.988727
  • [7] HOUSER D, 2001, REPUTATION AUTCTIONS
  • [8] Kleinberg JM., 1998, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, P668
  • [9] Krishna V., 2002, Auction theory
  • [10] MALAGA RA, 2001, ELECT COMMERCE RES, V4