Sample complexity for computational classification problems

DOI10.1007/s00453-007-0037-zzbMath1131.68091MaRDI QIDQ2461637

Daniil Ryabko

Publication date: 28 November 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/310183/files/453_2007_Article_37.pdf

zbMATH Keywords

labelling function

Mathematics Subject Classification ID

68Q32: Computational learning theory

68T10: Pattern recognition, speech recognition

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor