| 一种基于序列末项位置信息的序列模式挖掘算法 |
| |
| 引用本文： | 缪裕青,吴孔玲,朱晓雁,苏 杰.一种基于序列末项位置信息的序列模式挖掘算法[J].计算机应用研究,2012,29(7):2505-2508. |
| |
| 作者姓名： | 缪裕青 吴孔玲 朱晓雁 苏 杰 |
| |
| 作者单位： | 桂林电子科技大学计算机科学与工程学院,广西桂林,541004 |
| |
| 基金项目： | 广西可信软件重点实验室开放基金; 广西研究生科研创新项目（2011105950812M22） |
| |
| 摘 要： | 针对PrefixSpan算法中反复扫描投影数据库寻找局部频繁项并重复构造挖掘大量重复投影数据库的不足,提出一种基于序列末项位置信息的序列模式挖掘算法SPM-LIPT。通过连接2-序列位置信息表(LIPT)找到序列模式的下一项,实现序列模式增长,避免对投影数据库反复扫描;同时通过检查相同末项序列首位置信息表(SLIFPT)进行前向剪枝;消除大量重复投影的构建。最后通过实验证明了算法的有效性。
|
| 关 键 词： | 数据挖掘 序列模式挖掘 位置信息 投影数据库 |
Sequential pattern mining algorithm based on last item location information of sequence |
| |
| MIAO Yu-qing,WU Kong-ling,ZHU Xiao-yan,SU Jie.Sequential pattern mining algorithm based on last item location information of sequence[J].Application Research of Computers,2012,29(7):2505-2508. |
| |
| Authors: | MIAO Yu-qing WU Kong-ling ZHU Xiao-yan SU Jie |
| |
| Affiliation: | School of Computer Science & Engineering, Guilin University of Electronic Technology, Guilin Guangxi 541004, China |
| |
| Abstract: | In order to solve the defects of repeatedly scanning projection database looking for local frequent item and producing, mining large number of duplicated project databases in PrefixSpan algorithm, this paper proposed the SPM-LIPT algorithm for sequential pattern mining. By connecting the 2-sequence LIPT last item position table, the algorithm found the next item of the sequence, realized sequential pattern growth and avoided repeatedly scanning projection database. At the same time, it also could avoid producing and mining large number of duplicated project databases by checking SLIFPT same last item first position table prior to pruning. Experiments show that the algorithm is effective. |
| |
| Keywords: | data mining sequential pattern mining position information projected database |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
