Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

DOI10.1109/T-C.1971.223380MaRDI QIDQ5629250zbMATH OpenFDO

Authors Godfried Toussaint

Publication date 1971

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1971.223380

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Pattern recognition, speech recognition (68T10) Error probability in coding theory (94B70)

Cited in

(5)

• Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
• Some properties of Matusita's measure of affinity of several distributions
• Abstract sphere-of-influence graphs
• Onion polygonizations
• A linear time algorithm for computing the convex hull of an ordered crossing polygon

This page was built for publication: Some Upper Bounds on Error Probability for Multiclass Pattern Recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629250)