Finding Rough Set Reducts with SAT.

Qiang Shen, Andrew Tuson, Richard Jensen

Research output: Contribution to conferencePaper

16 Citations (Scopus)
174 Downloads (Pure)

Abstract

Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition and signal processing. In particular, solution to this has found successful application in tasks that involve datasets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and web content classification. Rough set theory has been used as such a dataset pre-processor with much success, but current methods are inadequate at finding minimal reductions, the smallest sets of features possible. This paper proposes a technique that considers this problem from a propositional satisfiability perspective. In this framework, minimal subsets can be located and verified. An initial experimental investigation is conducted, comparing the new method with a standard rough set-based feature selector.
Original languageEnglish
Pages194-203
Number of pages10
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Finding Rough Set Reducts with SAT.'. Together they form a unique fingerprint.

Cite this