Accession Number : AD0682408

Title :   CONSTRUCTION AND OPTIMIZATION OF ALGORITHMS OF RECOGNITION OF RELATION,

Corporate Author : FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO

Personal Author(s) : Fridman,L. M.

Report Date : 26 JUL 1968

Pagination or Media Count : 24

Abstract : The problem of recognition whether or not the test object is in a given relation with a definite pattern is theoretically examined; examples: Is this parallelogram a square. Is this letter k. A method of writing this problem in mathematical symbols is suggested. In a determinate problem, the solution algorithm is based on a set of indicants A sub k which serves as a logical definition. This definition meets these two conditions: (1) The generic concept used in the definition indicates the relation (set A); (2) The specific indicants (A sub k) are actually verifiable. This definition is written down by means of logic symbols and a corresponding graph, which is treated as the sought-for algorithm, is constructed. The programed learning includes a preliminary study of all kindred recognition problems and finding the optimal algorithm for which a quantitative evaluation is needed.

Descriptors :   (*PROGRAMMED INSTRUCTION, *PATTERN RECOGNITION), TEACHING MACHINES, LEARNING MACHINES, PROBABILITY, GRAPHICS, ALGORITHMS, USSR

Subject Categories : Humanities and History
      Bionics

Distribution Statement : APPROVED FOR PUBLIC RELEASE