PAC-like upper bounds for the sample complexity of leave-one-out cross-validation

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn , Issue , 1996, Pages 41-50

  Holden, Sean B ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; GRAPH THEORY; LEARNING ALGORITHMS; PATTERN RECOGNITION; PROBABILITY;

CROSS VALIDATION ESTIMATE; PROBABLY APPROXIMATELY CORRECT (PAC) APPROACH; SUPERVISED LEARNING TECHNIQUE;

LEARNING SYSTEMS;

EID: 0030402085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/238061.238067     Document Type: Article

References (15)