改进的差别矩阵的快速属性约简算法  

Quick Attribute Reduction Algorithm Based on the Improved Discernibility Matrix

作　　者：周建华[1] 徐章艳[1] 章晨光[1] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《小型微型计算机系统》2014年第4期831-834,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60963008)资助;广西自然科学基金项目(2011GXNSFA018163)资助

摘　　要：基于差别矩阵的属性约简算法是重要的属性约简算法之一,它具有直观、易于理解的性质.由于在构造差别矩阵的时候往往会产生大量的重复元素以及无用的元素,这不仅浪费了大量的空间,还大大降低了算法的高效性.在现实生活中这种数据往往是不可避免的.本文以去掉重复元素以及降低无用元素的个数为目的构造了一个二叉树来存储差别属性集,该二叉树在保留直观、易于理解的特征的前提下降低了存储空间.然后设计了一个相应的算法,该算法依据差别矩阵属性约简的思想,对二叉树进行减枝处理,实现最终的属性约简,最后用实例说明算法的高效性.The attribute reduction algorithm based on discernibility matrix is one of the important attribute reduction algorithms, and it has the nature of intuitive and easy to understand. Due to it often produces a large number of repetitive elements and useless elements in discernibility matrix; it will waste a lot of memory and reduce the efficiency of the algorithm. In real life, this kind of data is often inevitable. In this paper, in order to delete the number of repetitive elements and reduce the number of useless elements, we construct a binary tree to store differential attribute set, and design a new algorithm which based on discernibility matrix attribute reduction ide- as, and get the attribute reduction. Finally, an example is used to illustrate the efficiency of the new algorithm.

关 键 词：粗糙集 差别矩阵 二叉树 属性约简 

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