计算机科学与探索
計算機科學與探索
계산궤과학여탐색
JOURNAL OF FRONTIERS OF COMPUTER SCIENCE & TECHNOLOGY
2015年
7期
812-820
,共9页
李建军%张汝波%杨玉%苏泯元
李建軍%張汝波%楊玉%囌泯元
리건군%장여파%양옥%소민원
信任关系%最大流%二分图
信任關繫%最大流%二分圖
신임관계%최대류%이분도
trust relationship%maximum flow%bipartite graph
从互联网海量信息中快速准确地获取有效的信息变得非常重要。依据用户间信任关系给出推荐是一种非常有效的快速获取信息的方法,然而用户间信任关系通常非常的稀疏,很难为用户找到合适的信任关系,极大地影响了推荐效果。提出将扩展用户信任关系的过程转化成求解用户间信任最大流的问题,通过求解用户集合中的最大流得到用户信任关系。在Epinions数据集上的实验结果表明,基于最大流求解的信任关系给出的推荐比基于概率的矩阵分解、社会推荐、基于信任和不信任推荐方法有更好的效果。
從互聯網海量信息中快速準確地穫取有效的信息變得非常重要。依據用戶間信任關繫給齣推薦是一種非常有效的快速穫取信息的方法,然而用戶間信任關繫通常非常的稀疏,很難為用戶找到閤適的信任關繫,極大地影響瞭推薦效果。提齣將擴展用戶信任關繫的過程轉化成求解用戶間信任最大流的問題,通過求解用戶集閤中的最大流得到用戶信任關繫。在Epinions數據集上的實驗結果錶明,基于最大流求解的信任關繫給齣的推薦比基于概率的矩陣分解、社會推薦、基于信任和不信任推薦方法有更好的效果。
종호련망해량신식중쾌속준학지획취유효적신식변득비상중요。의거용호간신임관계급출추천시일충비상유효적쾌속획취신식적방법,연이용호간신임관계통상비상적희소,흔난위용호조도합괄적신임관계,겁대지영향료추천효과。제출장확전용호신임관계적과정전화성구해용호간신임최대류적문제,통과구해용호집합중적최대류득도용호신임관계。재Epinions수거집상적실험결과표명,기우최대류구해적신임관계급출적추천비기우개솔적구진분해、사회추천、기우신임화불신임추천방법유경호적효과。
To obtain information quickly and accurately from Internet is very important. Recommendation according to trust relationship between users is a very effective method to get information rapidly, however trust relationship is usually very sparse, it is hard to achieve appropriate trust relationship, which influences the recommendation results. This paper proposes a method which converts the process of extending trust relationship into the problem of maxi-mum flow match of trust, and calculates the trust relationship based on the maximum flow between users. The exper-imental results in Epinions dataset show that the method for finding trust relationship based on maximum flow is more accurate than the probability-based matrix decomposition, social recommendation, trust and distrust-based rec-ommendation methods.