粗糙概念格构造的算法  

Algorithm of constructing rough concept lattice

作　　者：谢霖铨[1] 付悦华 毛伊敏[2] 

机构地区：[1]江西理工大学理学院,江西赣州341000 [2]江西理工大学应用科学学院,江西赣州341000

出　　处：《计算机工程与设计》2015年第3期674-678,709,共6页Computer Engineering and Design

基　　金：国家自然科学基金项目(41362015);江西省教育厅科技基金项目(GJJ14434)

摘　　要：针对形式背景,利用概念外延与内涵之间特殊的关系,结合粗糙集上下近似概念,提出一种粗糙概念格构造算法,属性约简后运用粗糙度进行挖掘,获取可靠性知识。在构造过程中,对节点属性进行判断,有效地降低算法的时间复杂度。实际案例分析结果表明,通过属性约简与粗糙度的结合,该算法可以有效地挖掘获取可靠性知识,为数据分析挖掘知识提供了一种可行的思路和方法。For formal context,using the special relationship between the extension and intension of the concept,combined with down approximation concept in rough set,an algorithm for constructing rough concept lattice was proposed,in which roughness mining reliable knowledge was used after attribute reduction.In the construction process,the node properties were judged,which effectively reduced the time complexity of the algorithm.Practical case analysis demonstrates that by combining attribute reduction and roughness,the algorithm can effectively obtain reliable knowledge,which provides a workable thought and approach for data analysis mining knowledge.

关 键 词：形式背景 粗糙概念格 粗糙度 属性约简 可靠性知识 

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