Implicit Feature Selection with the Value Difference Metric

DMCA

Implicit Feature Selection with the Value Difference Metric

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Terry R. Payne , Peter Edwards

Citations:

14 - 2 self

BibTeX

@MISC{Payne_implicitfeature,
    author = {Terry R. Payne and Peter Edwards},
    title = {Implicit Feature Selection with the Value Difference Metric},
    year = {}
}

OpenURL

Abstract

The nearest neighbour paradigm provides an effective approach to supervised learning. However, it is especially susceptible to the presence of irrelevant attributes. Whilst many approaches have been proposed that select only the most relevant attributes within a data set, these approaches involve pre-processing the data in some way, and can often be computationally complex. The Value Difference Metric (VDM) is a symbolic distance metric used by a number of different nearest neighbour learning algorithms. This paper demonstrates how the VDM can be used to reduce the impact of irrelevant attributes on classification accuracy without the need for pre-processing the data. We illustrate how this metric uses simple probabilistic techniques to weight features in the instance space, and then apply this weighting technique to an alternative symbolic distance metric. The resulting distance metrics are compared in terms of classification accuracy, on a number of real-world and artificial data sets.

Keyphrases

value difference metric implicit feature selection classification accuracy irrelevant attribute relevant attribute instance space neighbour paradigm artificial data set alternative symbolic distance data set distance metric symbolic distance whilst many approach weighting technique simple probabilistic technique effective approach

DMCA