Attribute reductions in object-oriented concept lattices
Attribute reductions in object-oriented concept lattices
复制标题
DOI：
10.1007/s13042-013-0214-0
复制
发表时间：
2013-12
影响因子：
5.6
通讯作者：
Jianmin Ma;Y. Leung;Wenxiu Zhang
中科院分区：
文献类型：
--
作者：
Jianmin Ma;Y. Leung;Wenxiu Zhang
属性约简是概念格研究的主要内容之一。本文主要研究基于粗糙集理论构造的面向对象概念格的属性约简问题。定义了面向对象概念格的属性秩，讨论了属性秩与面向对象概念格的关系。研究了基于属性秩的面向对象概念生成算法。定义了面向对象概念格的面向对象一致集和面向对象约简。讨论了面向对象概念格的面向对象一致集的调整定理，以及属性子集成为面向对象概念格的面向对象一致集的充要条件。在此基础上，定义了面向对象概念格的面向对象相容性矩阵，并研究了其性质。基于面向对象概念格的可归约矩阵，提出了一种面向对象概念格的面向对象约简方法，并分析了其属性特征。
Attribute reduction is one of the main issues in the study of concept lattice. This paper mainly deals with attribute reductions of an object-oriented concept lattice constructed on the basis of rough set. Attribute rank of object-oriented concept lattice is first defined, and relationships between attribute rank and object-oriented concepts are then discussed. Based on attribute rank, generating algorithm of object-oriented concepts is investigated. The object-oriented consistent set and object-oriented reduction of an object-oriented concept lattice are defined. Adjustment theorems of the object-oriented consistent set, and the necessary and sufficient conditions for a attribute subset to be an object-oriented consistent set of an object-oriented concept lattice are discussed. Then the object-oriented discernibility matrix of an object-oriented concept lattice is defined and its properties are also studied. Based on the object-oriented discernibility matrix, an approach to object-oriented reductions of an object-oriented concept lattice is proposed, and the attribute characteristics are also analyzed.