基于hmm的推荐人声誉评价模型

Weihua Song, V. Phoha, Xin Xu
{"title":"基于hmm的推荐人声誉评价模型","authors":"Weihua Song, V. Phoha, Xin Xu","doi":"10.1109/CEC-EAST.2004.64","DOIUrl":null,"url":null,"abstract":"There is limited research on evaluating an agent's reputation as a recommender. A key challenge is that a recommender's reputation is affected by both the recommender's trustworthiness and the recommender's expertise, including the recommender's trust knowledge of others and the reliability of the recommender's trust evaluation models. We give an ordered depth-first search with threshold (ODFST) algorithm to find the optimal referral chain. We then develop a hidden Markov model (HMM) based approach to measure an agent's reputation as a recommender. This approach models chained recommendation events as an HMM. The features of the trust model are: (1) no explicit requirement of chained recommendation reputations; (2) flexible recommendation network with presence of loops; and (3) integration of learning speed into trust evaluation reliability. The experimental results showed the convergence and reliability of the proposed trust model","PeriodicalId":433885,"journal":{"name":"IEEE International Conference on E-Commerce Technology for Dynamic E-Business","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"The HMM-based model for evaluating recommender's reputation\",\"authors\":\"Weihua Song, V. Phoha, Xin Xu\",\"doi\":\"10.1109/CEC-EAST.2004.64\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There is limited research on evaluating an agent's reputation as a recommender. A key challenge is that a recommender's reputation is affected by both the recommender's trustworthiness and the recommender's expertise, including the recommender's trust knowledge of others and the reliability of the recommender's trust evaluation models. We give an ordered depth-first search with threshold (ODFST) algorithm to find the optimal referral chain. We then develop a hidden Markov model (HMM) based approach to measure an agent's reputation as a recommender. This approach models chained recommendation events as an HMM. The features of the trust model are: (1) no explicit requirement of chained recommendation reputations; (2) flexible recommendation network with presence of loops; and (3) integration of learning speed into trust evaluation reliability. The experimental results showed the convergence and reliability of the proposed trust model\",\"PeriodicalId\":433885,\"journal\":{\"name\":\"IEEE International Conference on E-Commerce Technology for Dynamic E-Business\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on E-Commerce Technology for Dynamic E-Business\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC-EAST.2004.64\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on E-Commerce Technology for Dynamic E-Business","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC-EAST.2004.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

关于评估代理作为推荐人的声誉的研究有限。一个关键的挑战是,推荐人的声誉受到推荐人的可信度和推荐人的专业知识的影响,包括推荐人对他人的信任知识和推荐人信任评估模型的可靠性。给出了一种有序深度优先阈值搜索(ODFST)算法来寻找最优的推荐链。然后,我们开发了一种基于隐马尔可夫模型(HMM)的方法来衡量智能体作为推荐者的声誉。这种方法将链接的推荐事件建模为HMM。信任模型的特点是:(1)对连锁推荐信誉没有明确的要求;(2)存在环路的柔性推荐网络;(3)将学习速度融入信任评估信度。实验结果表明,所提出的信任模型具有较好的收敛性和可靠性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The HMM-based model for evaluating recommender's reputation
There is limited research on evaluating an agent's reputation as a recommender. A key challenge is that a recommender's reputation is affected by both the recommender's trustworthiness and the recommender's expertise, including the recommender's trust knowledge of others and the reliability of the recommender's trust evaluation models. We give an ordered depth-first search with threshold (ODFST) algorithm to find the optimal referral chain. We then develop a hidden Markov model (HMM) based approach to measure an agent's reputation as a recommender. This approach models chained recommendation events as an HMM. The features of the trust model are: (1) no explicit requirement of chained recommendation reputations; (2) flexible recommendation network with presence of loops; and (3) integration of learning speed into trust evaluation reliability. The experimental results showed the convergence and reliability of the proposed trust model
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信