PATTERN SEPARATION BY CONVEX PROGRAMMING,

Abstract

It is shown that the pattern separation problem can be formulated and solved as a convex pro gramming problem, i.e., the minimization of a convex function subject to linear constraints. A number of previous investigators have proposed iterative methods for the construction of one or more hyperplanes in order s solve pattern recognition problems. It was apparently not recognized that these iterative methods were, in fact, ining a feasible solution to a mathematical programming problem. Very effi cient computer methods have been developed for such programming problems and can be used to advantage for the pattern recognition problem. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 28, 1963
Accession Number
AD0416795

Entities

People

  • J.b. Rosen

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computers
  • Construction
  • Convex Programming
  • Identification
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Pattern Recognition
  • Recognition

Readers

  • Linear Algebra
  • Operations Research
  • Snow Cover Descriptors for Reptiles and Their Illustrations.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms