{"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}
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