FP-tree上频繁概念格的无冗余关联规则提取

计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (15): 12-15.

FP-tree上频繁概念格的无冗余关联规则提取

王慧1，2，王京1

1.北京科技大学信息工程学院，北京 100083
2.中国人民公安大学信息安全工程系，北京 100038

出版日期:2012-05-21 发布日期:2012-05-30

Non-redundant association rules extraction of frequent concept lattice based on FP-tree

WANG Hui1，2, WANG Jing1

1.School of Information Engineering, University of Science and Technology Beijing, Beijing 100083, China
2.Department of Information Security Engineering, Chinese People’s Public Security University, Beijing 100038, China

Online:2012-05-21 Published:2012-05-30

摘要/Abstract

摘要： 为解决经典关联规则生成算法挖掘效率低及形成规则冗余性大的问题，提出在FP-tree基础上直接生成频繁概念格并提取无冗余关联规则的算法。其建格过程根据FP-tree频繁项目头表中各项的索引可分别独立进行，由支持度计数约束进行结点的筛选，形成频繁概念格的Hasse图，图中结点包含频繁项集及其支持度计数信息，通过对全部叶子结点的扫描可生成无冗余关联规则。通过实例验证该算法行之有效。

关键词: 数据挖掘, 关联规则, 频繁项集, 概念格

Abstract: The classical algorithm for mining association rules has low efficiency and high redundancy in the process of generating rules. To solve these problems, a new algorithm of finding non-redundant association rules based on frequent concept lattice is proposed. This concept lattice is generated on the basis of the FP-tree. During building lattice, all of nodes are formated according to the index of items which are found in the fequent-item head table. At the same time these nodes are selected by comparing supports. The Hasse graph is composed. In this graph, the intention of node is frequent itemset and the extension of node is support count of this itemset. And the non-redundant association rules are gained by scanning the leaf nodes of lattice. The simulation shows the feasibility of the algorithm proposed.

Key words: data mining, association rules, frequent itemsets, concept lattice

王慧1，2，王京1. FP-tree上频繁概念格的无冗余关联规则提取[J]. 计算机工程与应用, 2012, 48(15): 12-15.

WANG Hui1，2, WANG Jing1. Non-redundant association rules extraction of frequent concept lattice based on FP-tree[J]. Computer Engineering and Applications, 2012, 48(15): 12-15.

[1]	宗晓萍，陶泽泽. 基于掌握速度的知识追踪模型[J]. 计算机工程与应用, 2021, 57(6): 117-123.
[2]	高天宇，王庆荣，杨磊. 粗糙集属性依赖度强化的应急数据挖掘模型[J]. 计算机工程与应用, 2021, 57(3): 87-93.
[3]	马洋，赵旭俊. 基于相关子空间的多源离群检测算法[J]. 计算机工程与应用, 2021, 57(17): 88-95.
[4]	张呈玲，李进金，林艺东. 基于OE-概念格的形式背景属性约简[J]. 计算机工程与应用, 2021, 57(15): 82-89.
[5]	张念蓬，吴旭，朱强. 基于熵的过采样框架[J]. 计算机工程与应用, 2021, 57(13): 96-101.
[6]	张博文，刘智，桑国明. 基于核密度波动的异常检测算法[J]. 计算机工程与应用, 2021, 57(12): 132-136.
[7]	张振海，张湘婷. 上下文感知的高铁信息服务推荐方法研究[J]. 计算机工程与应用, 2021, 57(12): 231-236.
[8]	饶加旺，马荣华. 改进核密度估计的空间点密度算法[J]. 计算机工程与应用, 2021, 57(11): 260-265.
[9]	杨葛英，沈夏炯，史先进，张磊. 以概念格为背景的关联规则可视化[J]. 计算机工程与应用, 2021, 57(1): 84-91.
[10]	王杰，陈志刚，刘加玲，程宏兵. 基于聚类的云隐私行为挖掘技术[J]. 计算机工程与应用, 2020, 56(5): 80-84.
[11]	王子龙，李进，宋亚飞. 基于距离和权重改进的K-means算法[J]. 计算机工程与应用, 2020, 56(23): 87-94.
[12]	纪文璐，王海龙，苏贵斌，柳林. 基于关联规则算法的推荐方法研究综述[J]. 计算机工程与应用, 2020, 56(22): 33-41.
[13]	衣俊艳，吴博雅，雍巧玲. 具有加权特性的弹性网络聚类算法研究[J]. 计算机工程与应用, 2020, 56(22): 55-65.
[14]	顾军华，苏鸣，张亚娟，张丹红. 基于位编码链表的快速频繁模式挖掘算法研究[J]. 计算机工程与应用, 2020, 56(19): 86-93.
[15]	刘文芬，穆晓东，黄月华. 基于多分辨率网格的异常检测方法[J]. 计算机工程与应用, 2020, 56(17): 78-85.