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

一种基于MFSP-DG的个性化推荐算法
引用本文:张忠平,宋晓辉,赵海亮.一种基于MFSP-DG的个性化推荐算法[J].计算机工程与应用,2008,44(35):142-144.
作者姓名:张忠平  宋晓辉  赵海亮
作者单位:燕山大学 信息科学与工程学院,河北 秦皇岛 066004
基金项目:国家自然科学基金 , 教育部科学技术研究重点项目 , 河北省教育厅科研计划  
摘    要:提出一种基于最大频繁序列模式有向图的页面个性化推荐技术,由于考虑了用户会话的页面访问顺序,比一些不考虑页面访问顺序的推荐技术有更高的准确率。有向图结构压缩存储了所有最大频繁序列模式,推荐引擎依据截取的用户最近访问页面子序列,与有向图的部分路径进行匹配并进行横向推荐和纵向推荐,无需在整个模式库中搜索相同或相似的模式,从而加快了模式匹配的速度,更好地满足了页面推荐的特性和实时要求。实验证明,方法是有效的。

关 键 词:最大频繁序列模式  个性化推荐  横向推荐  纵向推荐  
收稿时间:2007-12-20
修稿时间:2008-3-3  

Efficient algorithm for personalized recommendation based on MFSP-DG
ZHANG Zhong-ping,SONG Xiao-hui,ZHAO Hai-liang.Efficient algorithm for personalized recommendation based on MFSP-DG[J].Computer Engineering and Applications,2008,44(35):142-144.
Authors:ZHANG Zhong-ping  SONG Xiao-hui  ZHAO Hai-liang
Affiliation:College of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China
Abstract:A technology based on maximal frequent sequential pattern direct graph is presented to perform personalization recommendation.Because of taking the access sequence of pageviews into account in this technology,a higher accuracy can be obtained.Direct graph structure compresses and stores all maximal frequent sequences discovered from Web usage mining,recom- mendation engine matches some sub paths of the direct graph and has a recomentdation both on breadthwise and lengthways according to nearest access subsequence form user active session,without need to find the identical or similar patterns in the whole pattern database,which enormously improves the speed of patterns matching to satisfy the need and specific of real-time recommendation better.The results of experiments show that the approach is effective in speed and precision.
Keywords:maximal frequent sequential pattern  personalization recommendation  breadthwise recommendation  lengthways recommendation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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