### 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 | |

State | Published - Aug 1971 |

### Fingerprint

### ASJC Scopus subject areas

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