COMPOUND DECISION PROCEDURES FOR PATTERN CLASSIFICATION.

Abstract

Compound decision theory is shown to be powerful as a general theoretical framework for pattern recognition, leading to nonparametric methods, methods of threshold adjustment, and methods for taking context into account. The finite-sample-size performance of the Fix-Hodges nearest-neighbor nonparametric classification procedure is derived for independent binary patterns. The optimum (Bayes) sequential compound decision procedure, for known distributions and dependent states of nature is derived. When the states of nature form a Markov chain, the procedure is recursive, easily implemented, and immediately applicable to the use of context. A similar procedure, in which a decision depends on previous observations only through the decision about the preceding state of nature, can (when the populations are not well separated) yield results significantly worse than a procedure that does not depend on previous observations at all. When the populations are well separated, however, an improvement almost equal to that of the optimum sequential rule is achieved. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1967
Accession Number
AD0667570

Entities

People

  • Kenneth Abend

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Classification
  • Decision Theory
  • Identification
  • Markov Chains
  • Observation
  • Pattern Recognition
  • Recognition

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Regression Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference