An Efficient Algorithm for Computing Core Attributes in Database Systems

A new approach to computing core attributes in rough set theory is proposed based on relational database systems. Especially, the fundamental operators of relational algebra are used to define the necessary and sufficient conditions that an attribute is a core attribute under the condition of the data table being consistent. Furthermore, inconsistent data table can be easily checked out and noise data can be efficiently eliminated. With this approach, we present an efficient and scalable algorithm for computing core attributes.

[1]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[2]  L. Zadeh,et al.  Data mining, rough sets and granular computing , 2002 .

[3]  Tsau Young Lin,et al.  A New Rough Sets Model Based on Database Systems , 2003, Fundam. Informaticae.

[4]  Jennifer Widom,et al.  Database System Implementation , 2000 .

[5]  Akhil Kumar,et al.  New Techniques for Data Reduction in a Database System for Knowledge Discovery Applications , 2004, Journal of Intelligent Information Systems.

[6]  T. Y. Lin,et al.  Rough Sets and Data Mining , 1997, Springer US.