基于下确界不可约的概念格属性约简方法  

Attribute Reduction Method of Concept Lattice Based on Infimum Irreducibleness

作　　者：吴杰[1] 梁妍[2] 马垣[1] 

机构地区：[1]辽宁科技大学软件学院,辽宁鞍山114051 [2]辽宁科技大学应用技术学院,辽宁鞍山114051

出　　处：《计算机工程》2016年第11期213-218,共6页Computer Engineering

基　　金：辽宁科技大学青年基金"基于粒计算的概念格约简方法研究"(2014QN21)

摘　　要：对概念格的属性约简方法进行研究。证明概念格中任意属性亏值都为可辨识属性集,下确界不可约概念的属性亏值集合与全部属性亏值集合的辨识函数具有相同的最小析取范式,概念元素为下确界不可约概念当且仅当其必为属性概念,并且每个属性概念的属性亏值中任取一个元素构成的集合必定是一个属性约简。在上述研究的基础上,提出一种针对大背景概念格快速获得全部属性约简的方法,并给出相应算法,证明其时间复杂度与空间复杂度都是多项式形式。分析结果表明,该方法无苛刻条件,化简幅度较大,运行时间快,具有较好的约简效果。This paper researches on attribute reduction method of concept lattice.It proves that any attribute defective value of concept lattice is a discernible attribute set.It also proves that discernibility functions for attribute defective values set of infimum irreducible concepts and all attribute defective value set have the same minimum disjunction normal form.Meanwhile,this paper proves that concept element is an infimum irreducible concept if and only if it is an attribute concept.The set composed of arbitrary elements taken from attribute defective values of each attribute concept definitely is an attribute reduction.A rapid method is presented for obtaining all attribute reductions of concept lattice from the large context based on the existing correlative method and corresponding algorithm is given.The time and space complexity of the algorithm are proved in the polynomial form.Analysis result shows that the proposed method has the advantages of no harsh terms,wide reduction range,short running time and good reduction effect.

关 键 词：概念格 属性亏值 最小析取范式 下确界不可约 属性概念 属性约简 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]