Test recognition theory.

*(English. Russian original)*Zbl 1121.68100
Discrete Math. Appl. 16, No. 4, 319-350 (2006); translation from Diskretn. Mat. 18, No. 3, 3-34 (2006).

Summary: We describe the logic approach to pattern recognition; its key notion is a test. Analysing the tests allows us to construct functionals characterising the pattern, as well as procedures to compute them. We present qualitative and quantitative properties of tests, functionals, and recognition procedures. Solutions of a series of known problems are also given.

##### MSC:

68T10 | Pattern recognition, speech recognition |

PDF
BibTeX
XML
Cite

\textit{V. B. Kudryavtsev}, Discrete Math. Appl. 16, No. 4, 319--350 (2006; Zbl 1121.68100); translation from Diskretn. Mat. 18, No. 3, 3--34 (2006)

Full Text:
DOI

##### References:

[1] | Chegis S. V, Proc. Steklov Inst. Math. 51 pp 270– (1958) |

[2] | Krendelev A. N., Dokl. Acad. Sci. USSR 173 (5) pp 1149– (1967) |

[3] | A. Shayeb, Study of properties of linear metric algorithms of recognition. Candidate Thesis, Moscow State Univ., 1958 (in Russian). |

[4] | Konstantinov Z. E., Probl. Cybern. 31 pp 25– (1976) |

[5] | F. N. Nefidov, A model of treatment of children with some acute abdominal diseases. Candidate Thesis, Comput. Centre Acad. Sci. USSR, 1977 (in Russian). |

[6] | Yu I, Probl. Cybern. 33 pp 5– (1978) |

[7] | Discrete Analysis 14 pp 28– (1969) |

[8] | Math. Notes 18 pp 664– (1975) |

[9] | E. V. Dyukova, Asymptotically optimal test algorithms in recognition problems. Candidate Thesis, Comput. Centre Acad. Sci. USSR, 1979 (in Russian). · Zbl 0529.68052 |

[10] | A. E. Andreev, On qualitative and metric properties of test algorithms. Candidate Thesis, Moscow State Univ., 1981 (in Russian). |

[11] | A. A. Kibkalo, On T -algorithms of recognition using short tests. Candidate Thesis, Moscow State Univ., 1988 (in Russian). · Zbl 0646.68101 |

[12] | Discrete Analysis 23 pp 8– (1973) |

[13] | M. V. Nosov, Functional characteristics of test algorithms of pattern recognition. Candidate Thesis, Moscow State Univ., 1989 (in Russian). |

[14] | G. R. Pogosyan, On complexity of verifying tests for logic devices. Candidate Thesis, Comput. Centre Acad. Sci. USSR, 1982 (in Russian). · Zbl 0517.94022 |

[15] | O. A. Dolotova, On complexity of control of logic circuits of Post type. Candidate Thesis, Comput. Centre Acad. Sci. USSR, 1991 (in Russian). |

[16] | N. A. Solovyev, Tests: Theory, Structure, Application. Nauka, Novosibirsk, 1978 (in Russian). |

[17] | S. W. Jablonski, G. P. Gawrilow, W. B. Kudrjawzew, Boolesche Funktionen und Postsche Klassen. Akademie, Berlin, 1970. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.