Rough Set Data Analysis Algorithms for Incomplete Information Systems

The rough set theory is a relatively new soft computing tool for dealing with vagueness and uncertainty in databases. To apply this theory, it is important to associate it with effective computational methods. In this paper, we focus on the development of algorithms for incomplete information systems and their time and space complexity. In particular, by using measure of significance of attribute which is defined by us, we present a heuristic algorithm for computing the minimal reduct, the time complexity of this algorithm is O(|A|3|U|2), and its space complexity is O(|A||U|). The minimal reduct algorithm is very useful for knowledge discovery in databases.