Neighbourhoods of examples for detecting logical redundancy

S Rawles, PA Flach

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)


In previous work we proposed an algorithm, REFER, for removing logically redundant features in a dataset consisting of Boolean examples, each labelled with one of any number of possible class labels. We define redundant features as those which can be removed without compromising the learning of a classification rule. Such redundant features are said to be covered by another present feature. Disjoint subsets of examples of the same class, called neighbourhoods, are used to both permit feature reduction in multi-class problems and to enable more features to be removed. A further benefit of using neighbourhoods is that redundant features can be detected as a result of being covered by a combination of features. In this paper we review the REFER method, demonstrate how this effect comes about, and discuss adaptations which take advantage of this effect.
Translated title of the contributionNeighbourhoods of examples for detecting logical redundancy
Original languageEnglish
Title of host publicationUnknown
EditorsStefan Kramer, Bernhard Pfaringher
PublisherInstitut fuer Informatik, Technische Universitaet Muenchen, Technical Report TUM-I0510
Pages47 - 52
Number of pages5
Publication statusPublished - Jul 2005

Bibliographical note

Conference Proceedings/Title of Journal: Late-breaking Papers from the 15th International Conference on Inductive Logic Programming (ILP'2005)


Dive into the research topics of 'Neighbourhoods of examples for detecting logical redundancy'. Together they form a unique fingerprint.

Cite this