Generalized error bounds in pattern recognition

Authors:
Inder Jeet Taneja
Affiliations:
Istituto di Scienze dell'Informazione, Facoltá di Scienze, Università di Salerno, 84100 Salerno, Italy
Venue:
Pattern Recognition Letters
Year:
1985

Citing 5
Cited 0

On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Recognition

IEEE Transactions on Computers
On information and distance measures, error bounds, and feature selection

Information Sciences: an International Journal
Probability of error, equivocation, and the Chernoff bound

IEEE Transactions on Information Theory
Patterns in pattern recognition: 1968-1974

IEEE Transactions on Information Theory
Renyi's entropy and the probability of error

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.10

Visualization

Abstract

Upper as well as lower bounds on the probability of error for the general pattern classification problem are obtained in terms of generalized entropy. It is proved that the bounds studied here are sharper than several previously known ones. Some properties of generalized entropy are also given.