NON-PARAMETRIC PATTERN RECOGNITION. PART I. THE LOCALLY DISJOINT CASE.

Abstract

The validity of the decision theoretic approach to pattern recognition depends primarily on the assumptions of the unknown underlying probability distribution. Here a mathematically rigorous procedure is developed which transforms the underlying unknown probability structure and then partitions the space by nonparametric techniques. In particular, the procedure transforms the learned samples to the real line using a functional which is dependent on estimates obtained from the learned samples. Treating these transformed one-dimensional random variables in terms of cumulative distribution, the underlying probability space is then partitioned by the fact that the location of the extrema of the difference or cumulative functions will converge to the boundaries of the likelihood decision rule. The decision rule which essentially defines this procedure is dependent on the location of the extrema. Moreover, this decision will provide perfect discrimination between category j and k for some finite learning phase if j and k are locally separate or disjoint. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1965
Accession Number
AD0628706

Entities

People

  • Joel Owen

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Boundaries
  • Discrimination
  • Learning
  • Mathematics
  • Pattern Recognition
  • Probability
  • Probability Distributions
  • Random Variables
  • Recognition

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Regression Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - Machine Learning Algorithms
  • Space