Optimal policy for labeling training samples

Lester Lipsky; Daniel Lopresti; George Nagy

doi:10.1117/12.2005942

4 February 2013 Optimal policy for labeling training samples

Lester Lipsky, Daniel Lopresti, George Nagy

Author Affiliations +

Proceedings Volume 8658, Document Recognition and Retrieval XX; 865809 (2013) https://doi.org/10.1117/12.2005942
Event: IS&T/SPIE Electronic Imaging, 2013, Burlingame, California, United States

Abstract

Confirming the labels of automatically classified patterns is generally faster than entering new labels or correcting incorrect labels. Most labels assigned by a classifier, even if trained only on relatively few pre-labeled patterns, are correct. Therefore the overall cost of human labeling can be decreased by interspersing labeling and classification. Given a parameterized model of the error rate as an inverse power law function of the size of the training set, the optimal splits can be computed rapidly. Projected savings in operator time are over 60% for a range of empirical error functions for hand-printed digit classification with ten different classifiers.

Citation Download Citation

Lester Lipsky, Daniel Lopresti, and George Nagy "Optimal policy for labeling training samples", Proc. SPIE 8658, Document Recognition and Retrieval XX, 865809 (4 February 2013); https://doi.org/10.1117/12.2005942

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE