计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (10): 144-146.DOI: 10.3778/j.issn.1002-8331.2009.10.043

• 数据库、信号与信息处理 • 上一篇    下一篇

基于概念格外延信息量的属性约简算法

李金海,吕跃进,梁斌梅   

  1. 广西大学 数学与信息科学学院,南宁 530004
  • 收稿日期:2008-02-25 修回日期:2008-05-06 出版日期:2009-04-01 发布日期:2009-04-01
  • 通讯作者: 李金海

Algorithm for attribute reduction based on information quantity of concept lattice extension

LI Jin-hai,LV Yue-jin,LIANG Bin-mei   

  1. School of Mathematics and Information Science,Guangxi University,Nanning 530004,China
  • Received:2008-02-25 Revised:2008-05-06 Online:2009-04-01 Published:2009-04-01
  • Contact: LI Jin-hai

摘要: 概念格是知识处理与分析的一个有力的工具,在知识约简和数据挖掘方面有着重要的利用。首先给出了概念格外延信息量的概念,在此基础上研究了合理刻画属性重要性的指标,并给出了概念格核心属性的判定定理,然后以这些指标作为启发式信息设计了一种新颖的概念格启发式属性约简算法,最后通过实例表明了该约简算法的可行性与有效性。

Abstract: The concept lattice is useful in knowledge processing and analying.And it has been used with a high intensity to knowledge reduction and data mining.This paper first puts forward information quantity of concept lattice extension,then studies new and relatively reasonable formulas measuring attribute significance and proposes a theory for justifying whether an attribute is a key attribute on concept lattice or not.And then those formulas are used as heuristic information to design a novel and heuristic algorithm for attribute reduction on concept lattice.Finally,a real example is used to demonstrate both its feasibility and effectiveness.