Sifting the Margin – An Iterative Empirical Classification Scheme

  • Dan Vance
  • Anca Ralescu
Conference paper

DOI: 10.1007/978-3-540-28633-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3157)
Cite this paper as:
Vance D., Ralescu A. (2004) Sifting the Margin – An Iterative Empirical Classification Scheme. In: Zhang C., W. Guesgen H., Yeap WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science, vol 3157. Springer, Berlin, Heidelberg

Abstract

Attribute or feature selection is an important step in designing a classifier. It often reduces to choosing between computationally simple schemes (based on a small subset of attributes) that do not search the space and more complex schemes (large subset or entire set of available attributes) that are computationally intractable. Usually a compromise is reached: A computationally tractable scheme that relies on a subset of attributes that optimize a certain criterion is chosen. The result is usually a’good’ sub-optimal solution that may still require a fair amount of computation. This paper presents an approach that does not commit itself to any particular subset of the available attributes. Instead, the classifier uses each attribute successively as needed to classify a given data point. If the data set is separable in the given attribute space the algorithm will classify a given point with no errors. The resulting classifier is transparent, and the approach compares favorably with previous approaches both in accuracy and efficiency.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Dan Vance
    • 1
  • Anca Ralescu
    • 1
  1. 1.ECECS DepartmentUniversity of CincinnatiCincinnatiUSA

Personalised recommendations