摘要
对分辨矩阵求核过程进行改进与扩展,给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。与其它最小约简算法相比,该算法在很大程度上降低了算法的复杂度,提高了算法的效率。
Through improving and extending the process of computing core,the minimal reduction algorithm based on attribute frequency heuristic information are put forward.Comparing with other minimal reduction algorithms,further improving the efficiency of algorithm.Finally,An example is be given to explain the validity of the new algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第8期92-94,共3页
Computer Engineering and Applications
基金
湖南省自然科学基金( the Natural Science Foundation of Hunan Province of China under Grant No.06JJ20075)
关键词
粗糙集
分辨矩阵
分辨信息集
最小约简
rough set
discernihility matrix
discernihility information set
minimal reduction
