{"title":"SWTrust:在线社交网络信任评估的可信图生成","authors":"Wenjun Jiang, Guojun Wang","doi":"10.1109/TrustCom.2011.251","DOIUrl":null,"url":null,"abstract":"To solve the problem of \"Can Alice trust Bob on a service in a social network setting\", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"SWTrust: Generating Trusted Graph for Trust Evaluation in Online Social Networks\",\"authors\":\"Wenjun Jiang, Guojun Wang\",\"doi\":\"10.1109/TrustCom.2011.251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the problem of \\\"Can Alice trust Bob on a service in a social network setting\\\", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.\",\"PeriodicalId\":289926,\"journal\":{\"name\":\"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TrustCom.2011.251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom.2011.251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
SWTrust: Generating Trusted Graph for Trust Evaluation in Online Social Networks
To solve the problem of "Can Alice trust Bob on a service in a social network setting", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.