首页 | 官方网站   微博 | 高级检索  
     

基于粗集与概念格的属性简约讨论
引用本文:周建,莫智文.基于粗集与概念格的属性简约讨论[J].数学的实践与认识,2012,42(19).
作者姓名:周建  莫智文
作者单位:1. 攀枝花学院计算机学院,四川攀枝花,617000
2. 四川师范大学数学与软件科学学院,四川成都,610068
摘    要:概念格的属性简约是在形式背景下解决复杂问题的重要途径,通过对概念格、粗糙集的讨论,将两者有效结合,并借助粗糙集上(下)近似的方法,得出了一个对概念格属性简约的方法,方法将二维的概念格属性简约转化为一维的一种对象格的简约,避免了形式背景下的概念的计算和进一步的可辨识矩阵的计算,方法简便,算法简单易实现,是概念格属性简约有效的算法.

关 键 词:概念格  粗糙集  属性简约

Study of Attribute Reduction based on Rough Set and Concept Lattice
ZHOU Jian , MO Zhi-wen.Study of Attribute Reduction based on Rough Set and Concept Lattice[J].Mathematics in Practice and Theory,2012,42(19).
Authors:ZHOU Jian  MO Zhi-wen
Abstract:Attribute reduction of Concept lattice is an important way to solve complex problems under formal context.Based on the discussion of concept lattice and rough sets,and effectively combining both of them,with the help of rough set upper(lower) approximation method,this paper achieves a method to deal with attribute reduction of concept lattice,which turns two-dimensional attribute reduction of concept lattice into a simple one-dimensional reduction of object lattice,thus,avoiding the concept calculation and further cognizable matrix calculation method under formal context.It is a simple and effective algorithm of attribute reduction of concept lattice and easy to achieve.
Keywords:concept lattice  rough sets  attribute reduction
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号