基于覆盖树的粗糙集约简求解法  

Solution Method of Rough Set Reduction Based on Cover Tree

作　　者：黄敏[1] 

机构地区：[1]六盘水师范学院数学系,贵州六盘水553001

出　　处：《六盘水师范高等专科学校学报》2011年第6期22-24,共3页Journal of Liupanshui Teachers College

摘　　要：在差别矩阵求出粗糙集核的基础上增加属性项,提出了采用覆盖树求解粗糙集约简的方法。采用该算法可以方便地求出信息系统的属性约简,且计算量少于采用定义求解的计算量。This paper aims to discuss the increase properties based on difference matrix calculated the basis of rough set and introduces the tree cover simple way to solve the rough set reduction. Using this algorithm can easily find the information systems of attribute reduction, and the calculation is less than the amount calculated using the definition of solution.the last example.

关 键 词：粗糙集 约简 差别矩阵 覆盖树 

分 类 号：O24[理学—计算数学]