采用改进的属性拓扑图探索形式背景属性约简之方法  

Using an Improved Attribute Topology Graph to Explore a Method of Attribute Reduction in Formal Context

作　　者：毛华[1] 苗会茹 

机构地区：[1]河北大学数学与信息科学学院,河北保定071002

出　　处：《小型微型计算机系统》2017年第12期2812-2816,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61572011)资助;河北省自然科学基金项目(A2013201119)资助

摘　　要：形式背景的属性约简可以使概念格的结构更加简便,从而有利于数据的规则提取.首先,从图论的角度研究形式背景的属性约简问题,即结合有向图的性质,提出了改进的属性拓扑图,并给出了在此图下的关联矩阵.其次,通过对属性拓扑图的分析,给出了净化形式背景中的关于概念和交不可约元的判断定理.进而,利用概念中属性特征和交不可约元之间的关系,提出了不必要属性的判别定理,并在此基础之上,给出了求形式背景属性约简的算法.最后,实例分析表明新的属性约简方法在一定程度上提高了概念格的构造效率,从而验证了该算法的可行性和有效性.An attribute reduction in formal context can make the structure of a concept lattice more convenient. Thereby ,it is beneficial to find rules from data. At first, a problem of attribute reduction in formal context is proposed in terms of graph theory. That is, based on the properties of directed graphs, an improved attribute topology graph is presented and its correlation matrix is given. Next, accord- ing to the study of the improved attribute topology graph, the judgment theorem is given for determining concepts and irreducible ele- ments in a purified formal context. After that,using the relationships between the attribute characteristics and the irreducible elements in concepts, a judgment theorem of the unnecessary attribute is proposed, and based on this, an algorithm of attribute reduction in a formal context is presented. Finally, a concrete example demonstrates that the new attribute reduction method can improve the efficiency of constructing the concept lattice to some extent, and verifies the feasibility and effectiveness of the algorithm.

关 键 词：形式背景 属性约简 改进的属性拓扑图 交不可约元 

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