The DOI matches its Crossref record.
On optimum recognition error and reject tradeoff
Open accessAbstract
The performance of a pattern recognition system is characterized by its error and reject tradeoff. This paper describes an optimum rejection rule and presents a general relation between the error and reject probabilities and some simple properties of the tradeoff in the optimum recognition system. The error rate can be directly evaluated from the reject function. Some practical implications of the results are discussed. Examples in normal distributions and uniform distributions are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods
Hüllermeier, E., & Waegeman, W. (2021) · Machine Learning · doi:10.1007/s10994-021-05946-3 · Cited by 1,834
“Instead, the ultimate decision can often be refused or delayed, like in classification with a reject option (Chow, 1970; Hellman, 1970), or actions can be taken that are specifically directed at reducing uncertainty, like in active learning (Aggarwal et al., 2014).”
BackgroundPimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
A k-nearest neighbor classification rule based on Dempster-Shafer theory
Denoeux, T. (1995) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.376493 · Cited by 1,013
A Unifying Review of Deep and Shallow Anomaly Detection
Ruff, L., Kauffmann, J. R., Vandermeulen, R. A., Montavon, G., Samek, W., Kloft, M., Dietterich, T. G., & Muller, K.-R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3052449 · Cited by 914
A k-Nearest Neighbor Classification Rule Based on Dempster-Shafer Theory
Denœux, T. (2008) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-44792-4_29 · Cited by 830
Metadata
- Authors
- Chow, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1970-01
- Volume
- 16
- Issue
- 1
- Pages
- 41-46
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2118377301
- Cited by
- 929
- References
- 0
- FWCI
- 6.25
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On optimum recognition error and reject tradeoff. https://app.cochat.ai/papers/10.1109/tit.1970.1054406
- The paper
- Chow, C. (1970). On optimum recognition error and reject tradeoff. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1970.1054406
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
