计算机工程 ›› 2008, Vol. 34 ›› Issue (4): 66-70.doi: 10.3969/j.issn.1000-3428.2008.04.023

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

基于FCA挖掘重述数据集的非冗余规则

杨伟传1,魏媛媛2   

  1. (1. 江门职业技术学院教学科研处,江门 529000;2. 武汉科技学院计算机科学学院,武汉 430079)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-02-20 发布日期:2008-02-20

Non-redundant Rules for Redescription Datasets MiningBased on FCA

YANG Wei-chuan1, WEI Yuan-yuan2   

  1. (1. Department of Teaching and Scientific Research, Jiangmen PolyTechnic, Jiangmen 529000;2. School of Computer Science, Wuhan University of Science and Engineering, Wuhan 430079)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-20 Published:2008-02-20

摘要: 以FCA为理论基础,应用Galois联络性质及其闭包运算,提出精确重述规则生成基和条件重述规则特征基的概念以及生成算法,论证由此构造的重述规则是最小非冗余的结论,设计最小非冗余重述规则挖掘的NRRM算法,并进行仿真计算和计算复杂性分析。

关键词: 形式概念分析, Galois联络, 重述规则, 数据挖掘, NRRM算法

Abstract: The notions and algorithms of generating basis for exact rules and the proper basis for conditional rules of redescription database are presented using operations of formal concept analysis and closure operator of Galois connection in the paper. It is true that constructed rules of redescription database are minimal non-redundant. And a new algorithm, called NRRM, for to discover minimal non-redundant and conditional rules is addressed, and simulation computation and computation complexity of NRRM algorithm are analyzed.

Key words: formal concept analysis, Galois connection, redescription rules, data mining, NRRM algorithm

中图分类号: