Rough feature selection for intelligent classifiers

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)
163 Downloads (Pure)

Abstract

The last two decades have seen many powerful classification systems being built for large-scale real-world applications. However, for all their accuracy, one of the persistent obstacles facing these systems is that of data dimensionality. To enable such systems to be effective, a redundancy-removing step is usually required to pre-process the given data. Rough set theory offers a useful, and formal, methodology that can be employed to reduce the dimensionality of datasets. It helps select the most information rich features in a dataset, without transforming the data, all the while attempting to minimise information loss during the selection process. Based on this observation, this paper discusses an approach for semantics-preserving dimensionality reduction, or feature selection, that simplifies domains to aid in developing fuzzy or neural classifiers. Computationally, the approach is highly efficient, relying on simple set operations only. The success of this work is illustrated by applying it to addressing two real-world problems: industrial plant monitoring and medical image analysis.
Original languageEnglish
Title of host publicationTransactions on Rough Sets VII
Subtitle of host publicationCommemorating the Life and Work of Zdzisław Pawlak, Part I
EditorsJames F. Peters , Andrzej Skowron, Victor W. Marek, Ewa Orłowska, Roman Słowiński, Wojciech Ziarko
PublisherSpringer Nature
Pages244-255
Number of pages12
Volume4400
ISBN (Electronic)978-3-540-71663-1
ISBN (Print)978-3-540-71662-4
Publication statusPublished - 2007

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume4400
ISSN (Print)1861-2059

Fingerprint

Dive into the research topics of 'Rough feature selection for intelligent classifiers'. Together they form a unique fingerprint.

Cite this