Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple
economic model is proposed with which a trade-off between classifier error and calculated evaluation complexity can be formulated. This trade-off can then be used to judge the necessity of increasing sample size or number of features to decrease classification error or, conversely, feature extraction or prototype selection to decrease evaluation complexity. The model is applied to the benchmark problem of handwritten digit recognition and is shown to lead to interesting conclusions, given certain assumptions.
|Publisher||IEEE Computer Society Press|
|Name||International Conference on Pattern Recognition|
|Conference||16th International Conference on Pattern Recognition (Quebec City, Canada), vol. II|
|Period||11/08/02 → 15/08/02|
- conference contrib. refereed
- Conf.proc. > 3 pag