The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2003 vol.25)
pp: 1534-1539
ABSTRACT
<p><b>Abstract</b>—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.</p>
INDEX TERMS
Pattern recognition, classification complexity, feature space partitioning.
CITATION
Sameer Singh, "Multiresolution Estimates of Classification Complexity", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.25, no. 12, pp. 1534-1539, December 2003, doi:10.1109/TPAMI.2003.1251146
11 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool