| 一个基于关联规则的个性化方法DPARM |
| |
| 引用本文： | 周业茂,丁二玉,赵志宏,骆斌.一个基于关联规则的个性化方法DPARM[J].计算机工程与应用,2008,44(30):145-147. |
| |
| 作者姓名： | 周业茂 丁二玉 赵志宏 骆斌 |
| |
| 作者单位： | 南京大学,软件学院,软件新技术国家重点实验室,南京,210093 |
| |
| 摘 要： | 针对当前个性化中关联规则挖掘的一些问题,尤其是无法及时更新使用数据这一缺点,提出了一种有效的基于关联规则挖掘的个性化方法DPARM,它将用户兴趣模型的更新和在线推荐紧密结合,及时使用新的用户会话更新用户兴趣模型,从而使个性化系统能够更好反映用户访问模式的变换。使用http://www.cs.depaul.edu上的数据进行了实验,结果表明,该方法是有效可行的。
|
| 关 键 词： | 关联规则 Web个性化 在线推荐 |
| 收稿时间： | 2008-4-24 |
| 修稿时间： | 2008-8-15
|
Method of discretization of continuous attributes of decision table |
| |
| ZHOU Ye-mao,DING Er-yu,ZHAO Zhi-hong,LUO Bin.Method of discretization of continuous attributes of decision table[J].Computer Engineering and Applications,2008,44(30):145-147. |
| |
| Authors: | ZHOU Ye-mao DING Er-yu ZHAO Zhi-hong LUO Bin |
| |
| Affiliation: | State Key Laboratory for Novel Software Technology，Institute of Software，Nanjing University，Nanjing 210093，China |
| |
| Abstract: | In order to solve the shortcomings of association rule mining algorithms in Web personalization,especially that it can not reflect the change of user's interest in time,this paper proposes an algorithm for dynamic adaptive Web site based on association rule mining(DPARM).DPARM combines both recommendation and user profile updating,it updates the usage profiles of customers as soon as possible in order to make the personalization system can reflect the diversions of customers' interest.Experiments have been done with the usage data of http://www.cs.depaul.edu,and the experiments show that DPARM is effective and practical. |
| |
| Keywords: | association rule Web personalization online recommendation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
