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

顾客偏好的动态挖掘算法
引用本文:杨静,高琳琦.顾客偏好的动态挖掘算法[J].信息与控制,2007,36(1):125-128.
作者姓名:杨静  高琳琦
作者单位:1. 天津现代职业技术学院,天津,300222
2. 天津师范大学管理学院,天津,300384
基金项目:国家自然科学基金;天津市教委资助项目;天津师范大学校科研和教改项目
摘    要:基于顾客偏好随时间变化的特性,采用聚类、关联规则等技术,对顾客偏好进行动态挖掘.通过追踪顾客购买序列,最终产生Top N产品推荐,旨在提高推荐系统的推荐质量.然后选取协同过滤算法作对照,并采用MovieLens站点提供的测试数据集.通过对召回率和精度两项指标的分析,表明该动态挖掘算法具有较高的推荐准确度和全面性.

关 键 词:顾客偏好  协同过滤  购买序列  关联规则  推荐系统
文章编号:1002-0411(2007)01-0125-04
修稿时间:2005-10-10

Dynamic Mining Algorithm for Customer Preference
YANG Jing,GAO Lin-qi.Dynamic Mining Algorithm for Customer Preference[J].Information and Control,2007,36(1):125-128.
Authors:YANG Jing  GAO Lin-qi
Affiliation:1. Tianjin Modern Vocational Technology College, Tianfin 300222, China; 2. Management College, Tianjin Normal University, Tianjin 300384, China
Abstract:According to the characteristics of customer preference that changes with time, customer preferences are mined dynamically with such technologies as clustering and association rules. Purchase sequences of customers are traced, and Top-N product recommendations are generated to improve the recommending quality of the recommen- dation system. Then collaborative filtering algorithm is chosen as a contrast and the test data set provided by MovieLens web site is adopted. Analysis on recall rate and precision demonstrates that the presented dynamic mining algorithm is of higher recommendation accuracy and comprehensiveness.
Keywords:customer preference  collaborative filtering  purchase sequence  association rule  recommendation system
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《信息与控制》浏览原始摘要信息
点击此处可从《信息与控制》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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