【24h】

Cluster-Based Analysis and Recommendation of Sellers in Online Auctions

机译:基于集群的在线拍卖中卖方的分析和建议

获取原文
获取原文并翻译 | 示例

摘要

The expansion of the share of online auctions in electronic trade causes exponential growth of theft and deception associated with this retail channel. Trustworthy reputation systems are a crucial factor in fighting dishonest and malicious users. 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 based on the notion of the density of sellers. Our measure uses the topology of connections between sellers and buyers to derive knowledge about trustworthy sellers. We mine the data on past transactions to discover clusters of interconnected sellers, and for each seller we measure the density of the seller's neighborhood. We use discovered clusters both for scoring the reputation of individual sellers, and to assist buyers in informed decision making by generating automatic recommendations. We perform experiments on data acquired from a leading Polish provider of online auctions to examine the properties of discovered clusters. The results of conducted experiments validate the assumptions behind the density reputation measure and provide an interesting insight into clusters of dense sellers.
机译:在线拍卖在电子贸易中所占份额的扩大导致与该零售渠道相关的盗窃和欺骗行为呈指数增长。可信赖的信誉系统是与不诚实和恶意用户作斗争的关键因素。不幸的是,流行的在线拍卖网站仅使用易于欺骗的简单信誉系统,从而为用户提供了针对有组织欺诈的保护。在本文中,我们基于卖方密度的概念提出了一种新的声誉测度。我们的度量方法使用买卖双方之间的联系拓扑来得出有关可信赖卖方的知识。我们从过去的交易中挖掘数据,以发现相互联系的卖方集群,并且对于每个卖方,我们都测量卖方附近的密度。我们使用发现的集群来评估单个卖家的声誉,并通过生成自动推荐来帮助买家做出明智的决策。我们对从波兰领先的在线拍卖提供商那里获取的数据进行实验,以检查发现的集群的属性。进行的实验结果验证了密度信誉测度背后的假设,并提供了对密集卖方集群的有趣了解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号