首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进概念格的无冗余关联规则提取
引用本文:刘霜霜,饶天贵,孙建华. 基于改进概念格的无冗余关联规则提取[J]. 计算机工程, 2010, 36(10): 52-55
作者姓名:刘霜霜  饶天贵  孙建华
作者单位:1. 湖南大学计算机与通信学院,长沙,410082
2. 株洲南车时代电气技术中心,株洲,412001
摘    要:在介绍概念格相关理论的基础上,提出改进概念格构造算法——Godin算法,在构造概念格的同时增加索引链表,有利于概念格的剪枝。把量化概念格、剪枝概念格与改进算法相结合,给出基于该改进算法的无冗余关联规则提取算法,并证明改进算法和无冗余规则提取算法的正确性和有效性。

关 键 词:概念格  关联规则  提取算法

Non-redundant Association Rules Extraction Based on Improved Concept Lattice
LIU Shuang-shuang,RAO Tian-gui,SUN Jian-hua. Non-redundant Association Rules Extraction Based on Improved Concept Lattice[J]. Computer Engineering, 2010, 36(10): 52-55
Authors:LIU Shuang-shuang  RAO Tian-gui  SUN Jian-hua
Affiliation:(1. School of Computer and Communication, Hunan University, Changsha 410082; 2. Zhuzhou CSR Times Electric Co., Ltd., Zhuzhou 412001)
Abstract:After introducing the basic theory of concept lattice, this paper brings forward an improved construction algorithm named Godin algorithm, adds the index for pruning, which can be helpful to pruned concept lattice, combines quantified concept lattice, pruned concept lattice with the improved algorithm, and gives non-redundant rules extraction algorithm. Theoretic analysis and experiment show that the algorithm and the non-redundant rules extraction algorithm are correct and effective.
Keywords:concept lattice  association rules  extraction algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号