计算机工程与应用2011，Vol.47Issue(16)：26-28,3.DOI:10.3778/j.issn.1002-8331.2011.16.008
基于条件信息熵和相关系数的属性约简算法
Attribute reduction algorithm based on relation coefficient and conditional information entropy.
摘要
Abstract
Attribute reduction in rough set theory is a NP-hard problem,which is studied mainly to design a more efficient algorithm. Aiming at the problem of inefficiency and low velocity with the traditional attribute reduction algorithm, an attribute reduction algorithm based on correlation coefficient and conditional information entropy is proposed,which changes attribute reduction process of non core attributes in the decision table into calculation of correlation coefficient,reduces the number of scanning decision table, algorithmic time complexity and redundancy of the algorithm, and improves the efficiency of attribute reduction. Then the k-fold rotation comparison method is used to calculate correlation coefficient,which largely reduces calculation amount,and attains sub optimal attribute reduction result. The algorithm details are given,and an experiment is carried out,theresult of which verifies the efficiency of the algorithm.关键词
粗糙集/属性约简/相关系数Key words
rough set/attribute reduction/correlation coefficient分类
信息技术与安全科学引用本文复制引用
甄宇峰,施化吉..基于条件信息熵和相关系数的属性约简算法[J].计算机工程与应用,2011,47(16):26-28,3.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60841003) （the National Natural Science Foundation of China under Grant No.60841003）
国家火炬计划项目(NO.2004EB33006). （NO.2004EB33006）
