Published in

Proceedings of the ninth annual conference on Computational learning theory - COLT '96

DOI: 10.1145/238061.238067

Links

Tools

Export citation

Search in Google Scholar

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

Proceedings article published in 1996 by Sean B. Holden
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO