Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Godfried T. Toussaint

doi:10.1109/T-C.1971.223380

Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Godfried T. Toussaint

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Evaluation of the bound requires knowledge of a priori probabilities and of the class-condi-tional probability density functions. A tighter bound is obtained for the case of equal a priori probabilities, and a further bound is obtained that is independent of the a priori probabilities. An upper bound on the probability of error for the general pattern recognition problem is obtained as a functional of the pairwise Kolmogorov variational distances.

Original language	English (US)
Pages (from-to)	943-944
Number of pages	2
Journal	IEEE Transactions on Computers
Volume	C-20
Issue number	8
DOIs	https://doi.org/10.1109/T-C.1971.223380
State	Published - Aug 1971

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/T-C.1971.223380

Cite this

@article{f08b616e521742cd95618d527db7ef1f,

title = "Some Upper Bounds on Error Probability for Multiclass Pattern Recognition",

abstract = "Evaluation of the bound requires knowledge of a priori probabilities and of the class-condi-tional probability density functions. A tighter bound is obtained for the case of equal a priori probabilities, and a further bound is obtained that is independent of the a priori probabilities. An upper bound on the probability of error for the general pattern recognition problem is obtained as a functional of the pairwise Kolmogorov variational distances.",

author = "Toussaint, {Godfried T.}",

year = "1971",

month = aug,

doi = "10.1109/T-C.1971.223380",

language = "English (US)",

volume = "C-20",

pages = "943--944",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "8",

}

TY - JOUR

T1 - Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

AU - Toussaint, Godfried T.

PY - 1971/8

Y1 - 1971/8

N2 - Evaluation of the bound requires knowledge of a priori probabilities and of the class-condi-tional probability density functions. A tighter bound is obtained for the case of equal a priori probabilities, and a further bound is obtained that is independent of the a priori probabilities. An upper bound on the probability of error for the general pattern recognition problem is obtained as a functional of the pairwise Kolmogorov variational distances.

AB - Evaluation of the bound requires knowledge of a priori probabilities and of the class-condi-tional probability density functions. A tighter bound is obtained for the case of equal a priori probabilities, and a further bound is obtained that is independent of the a priori probabilities. An upper bound on the probability of error for the general pattern recognition problem is obtained as a functional of the pairwise Kolmogorov variational distances.

UR - http://www.scopus.com/inward/record.url?scp=0015112303&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015112303&partnerID=8YFLogxK

U2 - 10.1109/T-C.1971.223380

DO - 10.1109/T-C.1971.223380

M3 - Article

AN - SCOPUS:0015112303

SN - 0018-9340

VL - C-20

SP - 943

EP - 944

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 8

ER -

Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this