作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (10): 52-55. doi: 10.3969/j.issn.1000-3428.2010.10.017

• 软件技术与数据库 • 上一篇    下一篇

基于改进概念格的无冗余关联规则提取

刘霜霜1,饶天贵2,孙建华1   

  1. (1. 湖南大学计算机与通信学院,长沙 410082;2. 株洲南车时代电气技术中心,株洲 412001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-20 发布日期:2010-05-20

Non-redundant Association Rules Extraction Based on Improved Concept Lattice

LIU Shuang-shuang1, RAO Tian-gui2, SUN Jian-hua1   

  1. (1. School of Computer and Communication, Hunan University, Changsha 410082; 2. Zhuzhou CSR Times Electric Co., Ltd., Zhuzhou 412001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-20 Published:2010-05-20

摘要: 在介绍概念格相关理论的基础上,提出改进概念格构造算法——Godin算法,在构造概念格的同时增加索引链表,有利于概念格的剪枝。把量化概念格、剪枝概念格与改进算法相结合,给出基于该改进算法的无冗余关联规则提取算法,并证明改进算法和无冗余规则提取算法的正确性和有效性。

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

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.

Key words: concept lattice, association rules, extraction algorithm

中图分类号: