A monotonic measure for optimal feature selection

Huan Liu, Hiroshi Motoda, Manoranjan Dash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

50 Scopus citations


Feature selection is a problem of choosing a subset of relevant features. In general,only exhaustive search can bring about the optimal subset. With a monotonic measure, exhaustive search can be avoided without sacrificing optimality. Unfortunately, most error- or distance-based measures are not monotonic. A new measure is employed in this work that is monotonic and fast to compute. The search for relevant features according to this measure is guaranteed tobe complete but not exhaustive. Experiments are conducted for verification.

Original languageEnglish (US)
Title of host publicationMachine Learning
Subtitle of host publicationECML-1998 - 10th European Conference on Machine Learning, Proceedings
EditorsClaire Nédellec, Céline Rouveirol
PublisherSpringer Verlag
Number of pages6
ISBN (Print)3540644172, 9783540644170
StatePublished - 1998
Externally publishedYes
Event10th European Conference on Machine Learning, ECML 1998 - Chemnitz, Germany
Duration: Apr 21 1998Apr 23 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th European Conference on Machine Learning, ECML 1998

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'A monotonic measure for optimal feature selection'. Together they form a unique fingerprint.

Cite this