| 基于二维数组的序列模式挖掘方法研究 |
| |
| 引用本文： | 安立奎,韩丽艳,李金山.基于二维数组的序列模式挖掘方法研究[J].长春师范学院学报,2009(6). |
| |
| 作者姓名： | 安立奎 韩丽艳 李金山 |
| |
| 作者单位： | 渤海大学数学系;渤海大学公共计算机教研部; |
| |
| 基金项目： | 辽宁省教育厅项目“知识管理与应用集成系统设计的研究”(2005030) |
| |
| 摘 要： | 本文介绍了两种主要的序列模式挖掘方法,在已有二进制算法的基础上提出了一种基于二维数组与二进制形式的频繁序列的计算方法。该方法通过二维数组实现事务数据库的存储,利用"或"、"与"、"异或"等逻辑运算计算序列的支持度计数和确定频繁序列模式,减少了数据库的扫描次数,降低了算法实现的难度,提高了挖掘效率,具有较好的创新性和理论价值。
|
| 关 键 词： | 数据挖掘 频繁集 序列模式 二进制 |
Study on Sequential Pattern Mining Methods Based on 2-Dimention Array |
| |
| AN Li-kui,HAN Li-yan,LI Jin-shan.Study on Sequential Pattern Mining Methods Based on 2-Dimention Array[J].Journal of Changchun Teachers College,2009(6). |
| |
| Authors: | AN Li-kui HAN Li-yan LI Jin-shan |
| |
| Institution: | 1.Department of Mathematics;Bohai University;Jinzhou 121003;China;2.Department of Public Computer;Jinhou 121003;China |
| |
| Abstract: | This paper introduces two main sequential pattern mining methods,and puts forward an algorithm of frequent sequence based on 2-dimention array and binary form.The algorithm stores the transaction database by 2-dimention array,calculates support of frequent sequential pattern and generates frequent sequential pattern by some logical operation.The algorithm decreases the amount for searching database and the difficulty of realizing it,and increases the mining efficiency with the better creativity and the valu... |
| |
| Keywords: | data mining frequent item set sequential pattern binary |
| 本文献已被 CNKI 等数据库收录！ |
