Multiresolution Estimates of Classification Complexity

  • Authors:
  • Sameer Singh

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.15

Visualization

Abstract

Abstract--In this paper, we study two measures of classification complexity based on feature space partitioning: "purity" and "neighborhood separability." The new measures of complexity are compared with probabilistic distance measures and a number of other nonparametric estimates of classification complexity on a total of 10 databases from the University of Calfornia, Irvine, (UCI) repository.