{"title":"多智能体电子商务系统中基于信誉的信任网络建模与简化","authors":"Zaobin Gan, Qian Ding, V. Varadharajan","doi":"10.1109/NWESP.2009.13","DOIUrl":null,"url":null,"abstract":"In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.","PeriodicalId":326450,"journal":{"name":"2009 Fifth International Conference on Next Generation Web Services Practices","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reputation-Based Trust Network Modelling and Simplification in Multiagent-Based E-Commerce Systems\",\"authors\":\"Zaobin Gan, Qian Ding, V. Varadharajan\",\"doi\":\"10.1109/NWESP.2009.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.\",\"PeriodicalId\":326450,\"journal\":{\"name\":\"2009 Fifth International Conference on Next Generation Web Services Practices\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Next Generation Web Services Practices\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NWESP.2009.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Next Generation Web Services Practices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NWESP.2009.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reputation-Based Trust Network Modelling and Simplification in Multiagent-Based E-Commerce Systems
In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.