| 带数据项约束的序列模式挖掘 |
| |
| 引用本文： | 肖仁财,薛安荣,段西强.带数据项约束的序列模式挖掘[J].计算机工程与设计,2008,29(12). |
| |
| 作者姓名： | 肖仁财 薛安荣 段西强 |
| |
| 作者单位： | 江苏大学,计算机科学与通信工程学院,江苏,镇江,212013 |
| |
| 基金项目： | 国家自然科学基金
,
江苏省高校自然科学基金 |
| |
| 摘 要： | 传统的数据挖掘方法会生成大量的模式和规则,且难以理解,而实际上用户感兴趣的只是其中的一小部分.针对该问题,在挖掘序列模式的PrefixSpan算法基础上提出一种带数据项约束的序列模式挖掘方法,通过数据项约束,减少了搜索空间.实验结果表明,该方法可以有效地挖掘出满足数据项约束的序列模式.
|
| 关 键 词： | 数据挖掘 序列模式 数据项约束 投影 前缀 后缀 |
Mining sequential patterns with item constraints |
| |
| XIAO Ren-cai,XUE An-rong,DUAN Xi-qiang.Mining sequential patterns with item constraints[J].Computer Engineering and Design,2008,29(12). |
| |
| Authors: | XIAO Ren-cai XUE An-rong DUAN Xi-qiang |
| |
| Affiliation: | XIAO Ren-cai,XUE An-rong,DUAN Xi-qiang(School of Computer Science , Telecommunication Engineering,Jiangsu University,Zhenjiang 212013,China) |
| |
| Abstract: | Conventional data mining can generates very large number of patterns and rules,and it is hard to understand.However users may be interested in only little of them.Based on PrefixSpan algorithm,a method is proposed that mining sequential pattern with item constraints.Search space is reduced via item constraints.The experiments show that the algorithm can mine sequential pattern with item constraints efficiently. |
| |
| Keywords: | data mining sequential pattern item constraints projection prefix postfix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
