首页 | 本学科首页   官方微博 | 高级检索  
     

基于加权关联规则的个性化推荐研究
引用本文:王涛伟,Ren Yibo.基于加权关联规则的个性化推荐研究[J].计算机应用与软件,2008,25(8).
作者姓名:王涛伟  Ren Yibo
作者单位:浙江万里学院计算机与信息学院,浙江,宁波,315100
摘    要:关联规则是个性化推荐系统中最重要的技术手段之一.传统的基于关联规则的个性化推荐认为,每个项目都具有相同的重要性,在实际应用中缺乏一定的针对性.在New-Apriori算法的加权支持度基础上结合Fp-growth算法思想,提出了基于Fp-树的加权关联规则算法.在实验中采用网页被用户选择的频率作为权重值,在个性化推荐系统中对该算法进行了实现.实验结果表明该算法具有较高的准确性和效率.

关 键 词:加权关联规则  个性化推荐  New-Apriori算法  加权支持度  加权频繁集

STUDY ON PERSONALIZED RECOMMENDATION BASED ON WEIGHTED ASSOCIATION RULE
Wang Taowei,Ren Yibo.STUDY ON PERSONALIZED RECOMMENDATION BASED ON WEIGHTED ASSOCIATION RULE[J].Computer Applications and Software,2008,25(8).
Authors:Wang Taowei  Ren Yibo
Affiliation:Wang Taowei1 Ren Yibo21(College of Computer Science , Information Technology,Zhejiang Wanli University,Ningbo 315100,Zhejiang,China)2(Department of Computer,Zhejiang Business Technology Institute,Ningbo 315012,China)
Abstract:Association rule is one of the most important techniques in personalized recommendation system.Conventional personalized recommendation based on association rule considers that every item is of the same importantance,and the recommendation lacks some pertinency.Based on the weighted support of New-Apriori algorithm and with the combination of Fp-growth algorithm,a weighted association rule algorithm based on Fp-tree is put forward.In experiment,the visit frequency of web page is used as weight,and the algor...
Keywords:Weighted association rule Personalized recommendation New-Apriori algorithm Weighted support Weighted frequent item sets  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号