Complexity in the case against accuracy estimation
type: Item
instance of: scholarly article
title: Complexity in the case against accuracy estimation
zbMATH Open document ID: 1022.68110
DOI: 10.1016/S0304-3975(02)00573-X
author: Richard Nock
published in: Theoretical Computer Science
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1957340
zbMATH Keywords: classifiers
MaRDI profile type: Publication
cites work: Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
cites work: Q4198056
cites work: Robust trainability of single neurons
cites work: Very simple classification rules perform well on most commonly used datasets
cites work: Learning DNF in time
cites work: Robust classification for imprecise environments
cites work: Improved boosting algorithms using confidence-rated predictions
cites work: A hybrid filter/wrapper approach of feature selection using information theory
cites work: A theory of the learnable
cites work: Q4261789
full work available at URL: s0304-3975(02)00573-x
OpenAlex ID: W2089292714
description: scientific article; zbMATH DE number 1957340