粗糙集理论中决策系统的求核算法研究  

Research into Finding Core Algorithm about Decision System in Rough Set Theory

作　　者：聂红梅[1] 唐玉萍[2] 

机构地区：[1]浙江师范大学信息科学与工程学院,浙江金华321004 [2]四川文理学院数学系,四川达州635000

出　　处：《达县师范高等专科学校学报》2006年第5期10-12,共3页Journal of Daxian Teachers College

摘　　要：针对Hu利用差别矩阵求解粗糙集中的核方法的错误,叶东毅提出了新的差别矩阵及其求核方法,但计算代价高。为此,给出了改进的求核算法,并证明了算法的正确性,该算法纠正Hu方法的错误,且可有效地降低计算代价。In order to correct the error of Hu＇s method based on discernibility matrix for computing the core of a decision table, Ye Dong - yi proposes new discernibility matrix and the computing of core, but the complexity is too high. Therefore, we present an im- proved algorithm of computing the core of a decision table, and prove the correctness of algorithm which corrects the error of Hu＇ s method and reduces the complexity.

关 键 词：粗糙集 协调系统 核 

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