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

Masao Kobayashi, Takayuki Ito
{"title":"An Approach to Ranking Participants Based on Relationship Network in E-commerce","authors":"Masao Kobayashi, Takayuki Ito","doi":"10.1109/WIIAT.2008.134","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIIAT.2008.134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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)”,采用HITS的技术和互联网拍卖数据。在这个阶段,我们成功地实现了互联网拍卖网站的爬虫,并将我们的算法与互联网拍卖的声誉值进行了比较,并采用了用户排名等几种方法。此外,我们的工作在一个更大的交易网络上拥有一个网络分析系统,可以预测哪些买家和卖家是活跃的,并表现出更好的行为。我们的实验显示了互联网拍卖中的许多行为,并且ANT呈现出与WWW上的HITS不同的分数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信