| 一种基于聚合链的改进FP-Growth算法 |
| |
| 引用本文： | 焦明海,姜慧研,唐加福.一种基于聚合链的改进FP-Growth算法[J].东北大学学报(自然科学版),2006,27(2):153-156. |
| |
| 作者姓名： | 焦明海 姜慧研 唐加福 |
| |
| 作者单位： | 东北大学,计算中心,辽宁,沈阳,110004;东北大学,信息科学与工程学院,辽宁,沈阳,110004 |
| |
| 基金项目： | 辽宁省自然科学基金资助项目(20042020) |
| |
| 摘 要： | 提出了一种基于聚合链挖掘频繁模式的改进FP-growth算法.该算法引入聚合链的单链表结构,改进了FP树结构.改进后的FP树是单向的,每个结点只保留指向父结点的指针,节省了树空间;相同项的不同节点的路径信息压缩进聚合链中,避免了生成节点链和条件模式库.用Agrawa方法生成实验数据进行分析,实验结果验证了该算法在时间上的优势.
|
| 关 键 词： | 数据挖掘 频繁模式 FP树 聚合链 FP-growth算法 |
| 文章编号： | 1005-3026（2006）02-0153-04 |
| 收稿时间： | 2005-04-18 |
| 修稿时间： | 2005年4月18日 |
An Improved FP-Growth Algorithm Based on Aggregative Chains |
| |
| JIAO Ming-hai,JIANG Hui-yan,TANG Jia-fu.An Improved FP-Growth Algorithm Based on Aggregative Chains[J].Journal of Northeastern University(Natural Science),2006,27(2):153-156. |
| |
| Authors: | JIAO Ming-hai JIANG Hui-yan TANG Jia-fu |
| |
| Institution: | (1) Computer Center, Northeastern University, Shenyang 110004, China; (2) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China |
| |
| Abstract: | An improved FP-growth algorithm based on aggregative chains is proposed.A kind of single linked lists named aggregative chain is introduced to the algorithm,thus improving the architecture of FP tree.The new FP tree is a one-way tree and only the pointers to point its children at each node are kept to save the space of tree in comperison with the former one.Route information of different nodes in the same term are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases.Agrawa tests data verified the advantage of time occupancy of the algorithm proposed. |
| |
| Keywords: | data mining frequent pattern FP tree aggregative chains FP-growth algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文 |
