Trust expansion and listwise learning-to-rank based service recommendation method |
| |
Authors: | Chen FANG Hengwei ZHANG Ming ZHANG Jindong WANG |
| |
Affiliation: | 1. The Third College,Information Engineering University,Zhengzhou 450001,China;2. State Key Laboratory of Mathematical Engineering and Advanced Computing,Zhengzhou 450001,China |
| |
Abstract: | In view of the problem of trust relationship in traditional trust-based service recommendation algorithm,and the inaccuracy of service recommendation list obtained by sorting the predicted QoS,a trust expansion and listwise learning-to-rank based service recommendation method (TELSR) was proposed.The probabilistic user similarity computation method was proposed after analyzing the importance of service sorting information,in order to further improve the accuracy of similarity computation.The trust expansion model was presented to solve the sparseness of trust relationship,and then the trusted neighbor set construction algorithm was proposed by combining with the user similarity.Based on the trusted neighbor set,the listwise learning-to-rank algorithm was proposed to train an optimal ranking model.Simulation experiments show that TELSR not only has high recommendation accuracy,but also can resist attacks from malicious users. |
| |
Keywords: | service recommendation learning-to-rank probabilistic user similarity trust relationship |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|