BOUNDS ON THE EFFICIENCY OF A CLASSIFICATION PROCEDURE.
Abstract
In a study of character recognition Dolby found it convenient to replace linear discriminant functions by simpler functions consisting of sums of some of the observations. In the cases studied the efficiency of these more convenient sums were remarkably high. This paper discusses circumstances where bounds may be derived on the efficiency of the use of sums.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 16, 1967
- Accession Number
- AD0653724
Entities
People
- Herman Chernoff
Organizations
- Stanford University