A fast updating algorithm of core computation based on array
Core attribute set is crucial for attribute reduction in rough set theory.In view of the count of attribute combination in discernibility matrix,a fast updating algorithm of core computation based on array is proposed in this paper.The advantage of this new algorithm is that,by representing core attributes with array elements,when objects in decision table are deleted,the old core attribute set can be updated effectively.Practical results show that with this algorithm the new core attribute set can be obtained quickly.
rough set attribute reduction discernibility matrix core array updating
Xiaoyan Wang Sichun Yang
School of Computer Science,Anhui University of Technology,Maanshan Anhui,China
国际会议
太原
英文
186-189
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）