Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)943-944
Number of pages2
JournalIEEE Transactions on Computers
VolumeC-20
Issue number8
DOIs
StatePublished - Jan 1 1971

Fingerprint

Multi-class
Error Probability
Pattern Recognition
Pattern recognition
Upper bound
Probability density function
Pairwise
Error probability
Evaluation

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Some Upper Bounds on Error Probability for Multiclass Pattern Recognition. / Toussaint, Godfried.

In: IEEE Transactions on Computers, Vol. C-20, No. 8, 01.01.1971, p. 943-944.

Research output: Contribution to journalArticle

@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 = "Godfried Toussaint",
year = "1971",
month = "1",
day = "1",
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

PY - 1971/1/1

Y1 - 1971/1/1

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

VL - C-20

SP - 943

EP - 944

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 8

ER -