首页> 外文会议>IEEE/WIC/ACM Joint International Conference on Web Intelligence and Intelligent Agent Technology >An Approach to Ranking Participants Based on Relationship Network in E-commerce
【24h】

An Approach to Ranking Participants Based on Relationship Network in E-commerce

机译:基于电子商务关系网络排名参与者的方法

获取原文

摘要

In recently years, many people easily access Internet auctions in e-commerce trading. At the same time, network structures like the WWW have become huge and are analyzed on a grand scale. In Internet auctions, users face the problem of really knowing the credit and trustworthiness of participants, and the simple rating mechanism widely used in Internet auctions fails to represent this accurately. This paper proposes participant ranking methods based on relationships in Internet auctions. Our algorithm called "Auction Network Trust (ANT)" employs HITS's techniques and Internet auction data. At this stage, we successfully implemented a crawler for Internet auction sites and compared our algorithm to a reputation value of Internet auctions with several approaches such as user rankings. Furthermore, our work possesses a network analyzing system on a larger trading network that predicts which buyers and sellers are active and demonstrate better behaviors. Our experiments show many behaviors in the Internet auctions and that ANT presents different scores from HITS on the WWW.
机译:最近,许多人在电子商务交易中轻松访问互联网拍卖。与此同时,WWW这样的网络结构已经变得巨大,并在大规模上分析。在互联网拍卖中,用户面临着真正了解参与者的信誉和可信度的问题,并且广泛用于互联网拍卖的简单评级机制无法准确表示。本文提出了基于互联网拍卖中关系的参与者排名方法。我们的算法称为“拍卖网络信任(Ant)”采用命中的技术和互联网拍卖数据。在此阶段,我们成功地实施了互联网拍卖网站的爬虫,并将算法与互联网拍卖的声誉值与诸如用户排名等若干方法进行了互联网拍卖。此外,我们的工作在更大的交易网络上拥有网络分析系统,预测哪个买家和卖家的活跃并展示更好的行为。我们的实验在互联网拍卖中显示了许多行为,并且ant在WWW上的命中呈现出不同的分数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号