摘要
为解决传统算法计算广义动态约简耗时的问题,提出在约简有效性约束条件下的快速算法。通过稳定度阈值的限制,减少F族中需要计算出所有约简的子表的数量,并利用最优稳定度系数过滤掉不可能成为广义动态约简的子表约筒。理论分析和实验表明,快速算法在效率上较传统算法具有显著提高。
To solve the time-consuming problem of calculating generalized dynamic reduction, a fast method based on the validity of reduction is proposed. The algorithm decreases the number of sub-tables, which are calculated by using the stability degree threshold, and filters the reduction of sub-tables that are not to be the generalized dynamic reduction by utilizing the classic stability coefficient. Theoretical analysis and experiment show that the fast method is more effective than the traditional algorithm.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第21期56-58,共3页
Computer Engineering
基金
湖南省自然科学基金项目资助(06JJ20075)
湖南省科技计划基金资助项目(2008FJ3184)
关键词
粗糙集
广义动态约简
约筒有效性
稳定度阈值
rough set
generalized dynamic reduction
validity of reduction
stability degree threshold
