skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Accuracy estimation for supervised learning algorithms

Abstract

This paper illustrates the relative merits of three methods - k-fold Cross Validation, Error Bounds, and Incremental Halting Test - to estimate the accuracy of a supervised learning algorithm. For each of the three methods we point out the problem they address, some of the important assumptions that are based on, and illustrate them through an example. Finally, we discuss the relative advantages and disadvantages of each method.

Authors:
; ;
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE Office of Energy Research, Washington, DC (United States)
OSTI Identifier:
466831
Report Number(s):
CONF-970465-7
ON: DE97004709
DOE Contract Number:  
AC05-96OR22464
Resource Type:
Conference
Resource Relation:
Conference: SPIE international conference, Orlando, FL (United States), 21-25 Apr 1997; Other Information: PBD: [1997]
Country of Publication:
United States
Language:
English
Subject:
99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ARTIFICIAL INTELLIGENCE; ALGORITHMS; NEURAL NETWORKS; STATISTICAL MODELS; TESTING; LEARNING

Citation Formats

Glover, C W, Oblow, E M, and Rao, N S.V. Accuracy estimation for supervised learning algorithms. United States: N. p., 1997. Web.
Glover, C W, Oblow, E M, & Rao, N S.V. Accuracy estimation for supervised learning algorithms. United States.
Glover, C W, Oblow, E M, and Rao, N S.V. 1997. "Accuracy estimation for supervised learning algorithms". United States. https://www.osti.gov/servlets/purl/466831.
@article{osti_466831,
title = {Accuracy estimation for supervised learning algorithms},
author = {Glover, C W and Oblow, E M and Rao, N S.V.},
abstractNote = {This paper illustrates the relative merits of three methods - k-fold Cross Validation, Error Bounds, and Incremental Halting Test - to estimate the accuracy of a supervised learning algorithm. For each of the three methods we point out the problem they address, some of the important assumptions that are based on, and illustrate them through an example. Finally, we discuss the relative advantages and disadvantages of each method.},
doi = {},
url = {https://www.osti.gov/biblio/466831}, journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Apr 01 00:00:00 EST 1997},
month = {Tue Apr 01 00:00:00 EST 1997}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: