%0 Journal Article %T Approach to collaborative filtering recommendation based on HMM
基于HMM模型的协同过滤推荐方法 %A HUANG Guang-qiu %A ZHAO Yong-mei %A
黄光球 %A 赵永梅 %J 计算机应用 %D 2008 %I %X Considering that browse route, browse time, browse times and so on are the important factors to influence the accuracy of commendation, a dynamic collaboration filtering recommendation method based on Hidden Markov Model (HMM) was proposed. First, it simulated users' behaviors while a user was browsing Web pages, and set up the nearest-neighbor set according to his behaviors. Because the data it used was not users' rating but users' browse route, the problem of data sparseness and initial rating was resolved. When HMM was used to replace the similitude model to measure users' similarity, the accuracy of nearest-neighbor commendation was improved greatly. And it settled the on-time recommendation problem and the extensible data space problem. Then the concept of fancy degree was set up, which made the recommendation become more suitable. Finally, the fancy degree was applied to establish the prediction model of dynamic collaboration filtering recommendation. A case study shows the excellent performance of this model. %K Hidden Markov Model (HMM) %K collaborative filtering recommendation %K forward (backward) estimation algorithm %K browse route %K fancy degree
隐马尔可夫模型 %K 协同过滤推荐 %K 前(后)向评估算法 %K 浏览路径 %K 喜好度 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=0879E0B13983056347CE10422D9784DB&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=B31275AF3241DB2D&sid=D5BC5BD8C68CDE3A&eid=AFA030E84E3FC132&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=15