| 基于后缀树的知识点间关联规则挖掘算法 |
| |
| 引用本文： | 董云耀,李笑.基于后缀树的知识点间关联规则挖掘算法[J].杭州电子科技大学学报,2006,26(1):9-13. |
| |
| 作者姓名： | 董云耀 李笑 |
| |
| 作者单位： | 杭州电子科技大学计算机学院,浙江,杭州,310018 |
| |
| 摘 要： | 在个性化的网络学习中,对知识点间的关联规则进行挖掘是一个关键的问题.该文提出了一种基于后缀树的知识点间关联规则挖掘算法,该算法通过对web日志数据构造后缀树进行序列挖掘,动态地挖掘最大频繁序列,进而发现有意义的知识点间的关联规则.
|
| 关 键 词： | 后缀树 关联规则 数据挖掘 |
| 文章编号： | 1001-9146（2006）01-0009-05 |
| 收稿时间： | 2005-09-11 |
| 修稿时间： | 2005-09-11 |
Mining Algorithm of Keyword Association Rule Based on Suffix-Tree |
| |
| DONG Yun-yao,LI Xiao.Mining Algorithm of Keyword Association Rule Based on Suffix-Tree[J].Journal of Hangzhou Dianzi University,2006,26(1):9-13. |
| |
| Authors: | DONG Yun-yao LI Xiao |
| |
| Affiliation: | School Computer College Science, Hangzhou University, Hangzhou Zhejiang 310018, China |
| |
| Abstract: | Analyzing the keyword association rule is a key problem in personalized distance learning system. In this paper, an efficient mining algorithm of keyword association role based on the suffix rithm can mine the maximal frequent sequence and find some significative keyword association rules by constructing a suffix tree on web- log. |
| |
| Keywords: | suffix - tree keyword association role data mining |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
