On New Concept in Computation of Reduct in Rough Sets Theory

  • Authors:

  • Faizah Shaari;Azuraliza Abu Bakar;Abd Razak Hamdan

  • Affiliations:

  • Polytechnic Sultan Salahuddin Abdul Aziz Shah, Persiaran Usahawan, Seksyen U1, Shah Alam, Malaysia 40150;Center of Artificial Intelligence Technology, Faculty of Technology and Information Science, University of National Malaysia (UKM), Bangi, Malaysia 43600;Center of Artificial Intelligence Technology, Faculty of Technology and Information Science, University of National Malaysia (UKM), Bangi, Malaysia 43600

  • Venue:
  • RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new concept of Reduct computation is proposed. This set is referred as NewReduct . It is discovered by defining the Indiscernibility matrix modulo (iDMM D ) and Indiscernibility function modulo(iDFM D ). Reduct is known as interesting and important set of attributes that able to represent the IS, in adverse the NewReduct is set of superfluous, redundant and non-interesting attributes. The computation of attributes defines sets of dispensable attributes and the partitioning of the objects based on indiscernibility relations shaped the information of a new knowledge. It is assumed that the sets of NewReduct attributes are able to uncover hidden knowledge that lies under a hidden pattern. One important knowledge that may be discovered from the IS or DS is the outliers knowledge.