| 基于最大频繁项目序列集挖掘ISS_DM算法的改进 |
| |
| 引用本文： | 宋卫林,徐惠民.基于最大频繁项目序列集挖掘ISS_DM算法的改进[J].计算机工程与设计,2007,28(3):500-503. |
| |
| 作者姓名： | 宋卫林 徐惠民 |
| |
| 作者单位： | 北京邮电大学,电信工程学院,北京,100876;北京邮电大学,电信工程学院,北京,100876 |
| |
| 摘 要： | 阐述了挖掘最大频繁项目序列集ISS_DM算法,针对该算法不能有效地解决客户序列视图数据库的数据挖掘问题,结合序列模式提出了改进的ISS_DM算法,并进行了相应的验证.实践证明,改进后的算法同原算法相比,对相同的数据量进行挖掘,算法执行时间明显减少,效益较高.
|
| 关 键 词： | 数据挖掘 序列模式 最大频繁项目序列集 最大频繁客户序列集 关联规则 |
| 文章编号： | 1000-7024（2007）03-0500-04 |
| 修稿时间： | 2006-01-25 |
Improvement of ISS_DM algorithm based on mining of maximal frequent item sequence sets |
| |
| SONG Wei-lin,XU Hui-min.Improvement of ISS_DM algorithm based on mining of maximal frequent item sequence sets[J].Computer Engineering and Design,2007,28(3):500-503. |
| |
| Authors: | SONG Wei-lin XU Hui-min |
| |
| Affiliation: | School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
| Abstract: | The ISS_DM algorithm for mining of maximal frequent item sequence sets is described,the algorithm can not solve the problem of data mining about customer sequence view database validly,and the improved ISS_DM algorithm combining with sequential patterns is put forward.The algorithms are validated accordingly.The result shows that the execution time of the improved algorithm is reduced and efficiency is good when both algorithms are applied to mine the same datum. |
| |
| Keywords: | data mining sequence pattern maximum frequent item sequence sets maximum frequent customer sequence sets association rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
