A quick incremental updating algorithm for computing core attributes

Authors:
Hao Ge;Chuanjian Yang;Wanlian Yuan
Affiliations:
Department of Electronic and Information Engineering, Chuzhou University, Chuzhou, P.R. China;Department of Computer Science, Chuzhou University, Chuzhou, P.R. China;Department of Mathematics, Chuzhou University, Chuzhou, P.R. China
Venue:
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Year:
2010

Citing 2
Cited 0

A Comparative Study of Algebra Viewpoint and Information Viewpoint in Attribute Reduction

Fundamenta Informaticae
Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix

CINC '09 Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing core attributes is one of key problems of rough set theory. Many researchers proposed lots of algorithms for computing core. Unfortunately, most of them are designed for static databases. However, many real datasets are dynamic. In this paper, a quick incremental updating core algorithm is proposed, which only allies on the updating parts of discernibility matrix and does not need to store, re-compute and re-analyze discernibility matrix, when new objects are added to decision table. Both of theoretical analysis and experimental results show that the algorithm is effective and efficient.