Extracting Relevant Information about Reduct Sets from Data Tables

  • Authors:

  • Mikhail Ju. Moshkov;Andrzej Skowron;Zbigniew Suraj

  • Affiliations:

  • Institute of Computer Science, University of Silesia, Sosnowiec, Poland 41-200;Institute of Mathematics, Warsaw University, Warsaw, Poland 02-097;Chair of Computer Science, University of Rzeszów, Rzeszów, Poland 35-310

  • Venue:
  • Transactions on Rough Sets IX
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The direct searching for relevant reducts in the set of all reducts of a given data table can be often computationally infeasible, especially for large data tables. Hence, there is a need for developing efficient methods for extracting relevant information about reducts from data tables which could help us to perform efficiently the inducing process of the high quality data models such as rule based classifiers. Such relevant information could help, e.g., to reduce the dimensionality of the attribute set. We discuss methods for generating relevant information about reduct sets from information systems or decision tables. In particular, we consider a binary relation on attributes satisfied for two given attributes if and only if there is no reduct consisting them both. Moreover, we prove that for any fixed natural k , there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exists a decision reduct of T covering these k attributes. We also present a list of problems related to the discussed issues. The reported results create a step toward construction of a software library reducing the searching costs for relevant reducts.