Classifier performance as a function of distributional complexity

DOI10.1016/J.PATCOG.2003.10.013zbMATH Open1070.68578OpenAlexW2135999858MaRDI QIDQ1764077FDOQ1764077

Authors: Sanju N. Attoor, Edward R. Dougherty 

Publication date: 23 February 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2003.10.013

Recommendations

• scientific article; zbMATH DE number 971347
• scientific article; zbMATH DE number 1203270
• scientific article; zbMATH DE number 3962998
• Intrinsic dimensionality and small sample properties of classifiers
• scientific article; zbMATH DE number 484199

zbMATH Keywords

Small samplesClassifier designClassifier dimensionDistributional complexity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Consistent nonparametric regression. Discussion
• Title not available (Why is that?)
• Title not available (Why is that?)
• An equivalence theorem for \(L_ 1\) convergence of the kernel regression estimate
• Asymptotically efficient solutions to the classification problem
• Strong universal consistency of neural network classifiers
• On the capabilities of multilayer perceptrons

Cited In (5)

• Improving classifier performance by using fictitious training data? A case study
• Intrinsic dimensionality and small sample properties of classifiers
• Simple tiered classifiers
• Classifier technology and the illusion of progress
• Title not available (Why is that?)

This page was built for publication: Classifier performance as a function of distributional complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764077)