基于粗糙集的概念格约简构造算法  

Construction of Reduced Concept Lattice Based on Rough Set

作　　者：许寅华[1] 董洋[1] 

机构地区：[1]昆明理工大学理学院,云南昆明650093

出　　处：《昆明理工大学学报（理工版）》2008年第5期113-116,共4页Journal of Kunming University of Science and Technology(Natural Science Edition)

基　　金：云南省教育厅自然科学基金资助(项目编号:2006L00004)

摘　　要：主要通过对概念格和粗糙集进行了讨论,给出了他们之间的联系,将二者有机结合,并利用粗糙集的属性约简方法给出了一个约简并构造出约简后的概念格的方法.本文的方法不仅使用了粗糙集约简的方法,而且还同时构造出了约简后的概念格,对于数据较大的形式背景下的概念格,该算法可以使对自己有用的感兴趣的信息更加突出,输出的概念格也更简洁,空间和时间复杂度都有所降低.Concept lattice and rough set are discussed to clarify their relationship. A new method to construct the lattice after reduction is put forward by combing the two together, especially with the use of attribute reduction of rough set. Thus, reducing and constructing can be accomplished at the same time. If the concept lattice has big formal context, this method can make the information more outstanding and the concept lattice more condensed

关 键 词：属性约简 概念格 粗糙集 构造 

分 类 号：O159[理学—数学]