UPPER BOUND OF ERROR PROBABILITIES FOR MULTIHYPOTHESES TESTING AND ITS APPLICATION IN ADPATIVE PATTERN RECOGNITION.

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

The mean square upper bound of the difference between the error probability of Bayesian decision and the decision error probability connected with some estimates of Bayesian decision function is known for two hypotheses testing problems. The convergence of the mean square minimization algorithm is also proved for weakly dependent labeled samples. This paper presents an improved upper bound given by the mean distances of Bayesian decision functions and their estimates for multihypotheses testing. A slight modification of this upper bound might actually be minimized over the space of given finite dimensional decision functions. It is an adaptive recursive algorithm, a version of stochastic approximation particularly suited to certain tasks in statistical pattern recognition and related control problems.

Original languageEnglish
Title of host publicationProbl Control Inf Theory
Pages449-457
Number of pages9
Volume5
Edition5-6
Publication statusPublished - 1976

Fingerprint

Pattern recognition
Testing
Error probability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

UPPER BOUND OF ERROR PROBABILITIES FOR MULTIHYPOTHESES TESTING AND ITS APPLICATION IN ADPATIVE PATTERN RECOGNITION. / Györfi, L.

Probl Control Inf Theory. Vol. 5 5-6. ed. 1976. p. 449-457.

Research output: Chapter in Book/Report/Conference proceedingChapter

@inbook{2c38df9d7199455e95b000631bd433bc,
title = "UPPER BOUND OF ERROR PROBABILITIES FOR MULTIHYPOTHESES TESTING AND ITS APPLICATION IN ADPATIVE PATTERN RECOGNITION.",
abstract = "The mean square upper bound of the difference between the error probability of Bayesian decision and the decision error probability connected with some estimates of Bayesian decision function is known for two hypotheses testing problems. The convergence of the mean square minimization algorithm is also proved for weakly dependent labeled samples. This paper presents an improved upper bound given by the mean distances of Bayesian decision functions and their estimates for multihypotheses testing. A slight modification of this upper bound might actually be minimized over the space of given finite dimensional decision functions. It is an adaptive recursive algorithm, a version of stochastic approximation particularly suited to certain tasks in statistical pattern recognition and related control problems.",
author = "L. Gy{\"o}rfi",
year = "1976",
language = "English",
volume = "5",
pages = "449--457",
booktitle = "Probl Control Inf Theory",
edition = "5-6",

}

TY - CHAP

T1 - UPPER BOUND OF ERROR PROBABILITIES FOR MULTIHYPOTHESES TESTING AND ITS APPLICATION IN ADPATIVE PATTERN RECOGNITION.

AU - Györfi, L.

PY - 1976

Y1 - 1976

N2 - The mean square upper bound of the difference between the error probability of Bayesian decision and the decision error probability connected with some estimates of Bayesian decision function is known for two hypotheses testing problems. The convergence of the mean square minimization algorithm is also proved for weakly dependent labeled samples. This paper presents an improved upper bound given by the mean distances of Bayesian decision functions and their estimates for multihypotheses testing. A slight modification of this upper bound might actually be minimized over the space of given finite dimensional decision functions. It is an adaptive recursive algorithm, a version of stochastic approximation particularly suited to certain tasks in statistical pattern recognition and related control problems.

AB - The mean square upper bound of the difference between the error probability of Bayesian decision and the decision error probability connected with some estimates of Bayesian decision function is known for two hypotheses testing problems. The convergence of the mean square minimization algorithm is also proved for weakly dependent labeled samples. This paper presents an improved upper bound given by the mean distances of Bayesian decision functions and their estimates for multihypotheses testing. A slight modification of this upper bound might actually be minimized over the space of given finite dimensional decision functions. It is an adaptive recursive algorithm, a version of stochastic approximation particularly suited to certain tasks in statistical pattern recognition and related control problems.

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

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

M3 - Chapter

AN - SCOPUS:0017246825

VL - 5

SP - 449

EP - 457

BT - Probl Control Inf Theory

ER -