摘要
深入分析基于差别矩阵的属性核快速更新算法——FUAC后,指出引起该算法空间复杂度高的原因,在此基础上提出了一种不存储差别矩阵的改进核增量式更新算法,主要考虑对象动态删除情况下核的更新问题。理论分析表明改进的核增量式更新算法有线性空间复杂度。
After analyzing the existence fast updating algorithm for computing an attributes core based on discernibility matrix——FUAC,this paper points out the reason that the FUAC has so high space complexity.Then an improved fast updating algorithm is proposed,which does not store discernibility matrix.Theoretical analysis shows that the improved incremental updating algorithm of the computation of a core has linear space complexity.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第20期96-98,180,共4页
Computer Engineering and Applications
基金
国家自然科学基金No.50604012~~
关键词
粗糙集
核
增量式更新
rough set
core
incremental updating