一种改进的分辨矩阵构造及求核算法  

An improved algorithm for discernibility matrix construction and core calculation

作　　者：史君华[1] 刘乐群[1] 

机构地区：[1]合肥师范学院计算机科学与技术系,安徽合肥230601

出　　处：《合肥工业大学学报（自然科学版）》2011年第7期1108-1111,共4页Journal of Hefei University of Technology：Natural Science

基　　金：高等学校省级优秀青年人才基金重点资助项目(2010SQRL149ZD);安徽高校省级自然科学研究重点资助项目(KJ2009A150)

摘　　要：属性约简是粗糙集理论中的重要内容,而获取核属性又通常是计算属性约简的一个关键步骤。为使算法能同时应用于一致和不一致决策表,并精简分辨矩阵中的元素,优化时间性能,文章提出一种改进的分辨矩阵构造方法,构造的过程中充实核属性集,新产生的核集又能进一步优化分辨矩阵的构造。通过实例分析算法,并通过实验验证了该算法是可行有效的。Attribute reduction is one of the main content of rough sets theory,the calculation of which depends on the extraction of the core attributes.To reduce the items in the discernibility matrix and increase the time efficiency,an improved discernibility matrix construction algorithm for both consistent and inconsistent data in decision tables is presented in this paper.During the matrix construction,the core attributes are calculated and the new core set is employed as an optimization condition to construct the latter items of the discernibility matrix.An example is given to illustrate the algorithm and the experimental result shows its advantages in time performance over the classical ones.

关 键 词：决策表 分辨矩阵 核 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]