| 一种基于FP-树的最大频繁模式增量更新挖掘算法 |
| |
| 引用本文： | 李忠哗,任春龙,何丕廉.一种基于FP-树的最大频繁模式增量更新挖掘算法[J].计算机应用与软件,2007,24(5):47-49. |
| |
| 作者姓名： | 李忠哗 任春龙 何丕廉 |
| |
| 作者单位： | [1]河北北方学院计算机系,河北张家口075000 [2]天津大学计算机学院,天津300072 |
| |
| 基金项目： | 天津市科技发展基金
,
天津市应用基础研究项目 |
| |
| 摘 要： | 挖掘关联规则是数据挖掘领域的一个重要研究方向,人们已经提出了许多用于发现数据库中关联规则的算法,但对关联规则的增量维护问题的研究较少.深入分析了增量更新情况,使用了目前较高效的最大频繁模式挖掘算法FP-Max,并对其进行改进.基本思想:①基于FP-树;②考虑了数据集中,数据增加情况下FP-树的更新;③对FP-Max算法进行改进来更新、维护已经挖掘出来的最大频繁模式.
|
| 关 键 词： | 数据挖掘 关联规则 频繁模式树 最大频繁模式 最大频繁模式 增量更新 挖掘算法 MINING PATTERNS FREQUENT MAXIMAL ALGORITHM INCREMENTAL UPDATING 增量维护 更新情况 数据集 思想 改进 使用 分析 问题 数据库 发现 方向 |
| 修稿时间： | 2006-02-22 |
AN FP-TREE BASED INCREMENTAL UPDATING ALGORITHM FOR MAXIMAL FREQUENT PATTERNS MINING |
| |
| Li Zhonghua,Ren Chunlong,He Pilian.AN FP-TREE BASED INCREMENTAL UPDATING ALGORITHM FOR MAXIMAL FREQUENT PATTERNS MINING[J].Computer Applications and Software,2007,24(5):47-49. |
| |
| Authors: | Li Zhonghua Ren Chunlong He Pilian |
| |
| Affiliation: | 1. Computer Science Department, Hebei North University,Zhangjiakou 075000, Hebei, China; 2. Department of Computer, Tianjin University, Tianjin 300072, China |
| |
| Abstract: | Association rules is an important research topic in data mining area. Many approaches have been proposed to mine association rules. But little work was done on their maintenance. The case of adding new data into the database is analyzed in this paper. An algorithm which based FP-Max algorithm is presented. The main idea of this paper is that,(1) It is a FP-tree based algorithm for mining maximal frequent patterns. (2)Updating of FP-tree is considered. (3)FP-Max algorithm is improved and maximal frequent patterns which have been mined are updated. |
| |
| Keywords: | Data mining Association rule Frequent pattern tree Maximal frequent pattern |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
