点击次数：

所属单位：计算机科学与技术学院/人工智能学院/软件学院

发表刊物：CLOUD COMPUTING AND SECURITY, PT II

关键字：Kernel searching Degree Betweenness Trust-aware recommender system

摘要：A trust-aware recommender system (TARS) is widely used in social media to find useful information. Recommender searching mechanism is an important research issue in TARS. We propose a new searching strategy for recommender searching mechanism of TARS, which named kernel searching strategy. A kernel, which consists of hub nodes of the trust network, is involved in trust propagations. The kernel can be obtained from node degree or node betweenness, take these hub nodes as active users and then finds the recommenders via trust propagations from the kernel, most of the nodes in the network will be covered. Comparing the results of these two methods, the coverage rate of these hub nodes which is obtained from the node degree is almost less than that obtained from the node betweenness. To get better coverage rate, we take both degree and betweenness into consideration. The results show that the combination can get better coverage rate only compared with the node degree. However, the combination has better convergence effect compared with the node betweenness.

ISSN号：0302-9743

是否译文：否

发表时间：2017-01-01

合写作者：袁伟伟,He, Kangya,李臣亮,李乾贵

通讯作者：周良强