Association reducts: boolean representation

  • Authors:
  • Dominik Ślęzak

  • Affiliations:
  • Department of Computer Science, University of Regina, Regina, SK, Canada

  • Venue:
  • RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate association reducts, which extend previously studied information and decision reducts in capability of expressing compound, multi-attribute dependencies in data. We provide Boolean, discernibility-based representation for most informative association reducts