计算机科学与探索
計算機科學與探索
계산궤과학여탐색
Journal of Frontiers of Computer Science & Technology
2015年
11期
1391-1397
,共7页
田尧%秦永彬%许道云%张丽
田堯%秦永彬%許道雲%張麗
전요%진영빈%허도운%장려
信任推荐%协同过滤%奇异值分解(SVD)%推荐系统%隐式信任
信任推薦%協同過濾%奇異值分解(SVD)%推薦繫統%隱式信任
신임추천%협동과려%기이치분해(SVD)%추천계통%은식신임
trust recommendation%collaborative filtering%singular value decomposition (SVD)%recommender sys-tems%implicit trust
为解决传统协同过滤算法中存在的数据稀疏与冷启动问题,社会化信任推荐机制被引入推荐系统,通过加入用户的显式信任信息,可有效地缓解上述问题.但是显式信任较难获取,并且数据较为稀疏,为了更好地提高推荐效率,在基于显式信任的TrustSVD算法的基础上,加入用户的隐式信任信息,提出了一种基于双信任机制的奇异值分解(singular value decomposition,SVD)算法EITrustSVD.在利用显式信任获得可靠推荐的同时,通过隐式信任的影响获得与用户喜好相关的推荐.通过实验证明,该方法可以较好地解决冷启动问题,且能提高推荐的准确率.
為解決傳統協同過濾算法中存在的數據稀疏與冷啟動問題,社會化信任推薦機製被引入推薦繫統,通過加入用戶的顯式信任信息,可有效地緩解上述問題.但是顯式信任較難穫取,併且數據較為稀疏,為瞭更好地提高推薦效率,在基于顯式信任的TrustSVD算法的基礎上,加入用戶的隱式信任信息,提齣瞭一種基于雙信任機製的奇異值分解(singular value decomposition,SVD)算法EITrustSVD.在利用顯式信任穫得可靠推薦的同時,通過隱式信任的影響穫得與用戶喜好相關的推薦.通過實驗證明,該方法可以較好地解決冷啟動問題,且能提高推薦的準確率.
위해결전통협동과려산법중존재적수거희소여랭계동문제,사회화신임추천궤제피인입추천계통,통과가입용호적현식신임신식,가유효지완해상술문제.단시현식신임교난획취,병차수거교위희소,위료경호지제고추천효솔,재기우현식신임적TrustSVD산법적기출상,가입용호적은식신임신식,제출료일충기우쌍신임궤제적기이치분해(singular value decomposition,SVD)산법EITrustSVD.재이용현식신임획득가고추천적동시,통과은식신임적영향획득여용호희호상관적추천.통과실험증명,해방법가이교호지해결랭계동문제,차능제고추천적준학솔.
To resolve the problems of data sparsity and cold-start of the collaborative filtering algorithms in recom-mender systems, the trust information has being introduced to recommender systems, it can effectively alleviate these problems above by adding the users'explicit trust information. But the explicit trust information is more diffi-cult to obtain or sparse, in order to better improve the efficiency of recommendation, in the basis of TrustSVD algo-rithm based on explicit trust, this paper introduces the implicit trust information, and proposes a singular value decom-position (SVD) algorithm based on double trust mechanism, named EITrustSVD. At the same time of getting a reli-able recommendation by using the explicit trust, the EITrustSVD algorithm gets a recommendation related to user performance through implicit trust. The experimental results show that the proposed algorithm is a better solution to the problem of cold-start, and has a better recommendation accuracy.