Pattern Recognition and Image Analysis

, Volume 28, Issue 4, pp 684–687 | Cite as

An Algorithm for Reselecting a Reference Objects

  • N. N. BondarenkoEmail author
Mathematical Method in Pattern Recognition


The problem of optimally choosing a learning object is studied. The definition of essential totality of precedents is given. It is shown that an iterative procedure for generating the essential totality of precedents exists. The algorithm operation is checked on model data.


algorithm for calculation of estimates algebraic theory of algorithms selection of learning objects totality of essential precedents 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yu. I. Zhuravlev and V. V. Nikiforov, “Recognition algorithms based on computation of estimates,” Cybern. 7 (3), 387–400 (1971).CrossRefGoogle Scholar
  2. 2.
    Yu. I. Zhuravlev, “On an algebraic approach to the solution of pattern recognition and classification problems,” Problemy Kibernet. No. 33, 5–68 (1978) [in Russian].Google Scholar
  3. 3.
    K. V. Rudakov, “On algebraic theory of universal and local limitations for classification problems,” in Recognition, Classification, and Prediction (Nauka, Moscow, 1989), pp. 176–201 [in Russian].Google Scholar
  4. 4.
    V. L. Matrosov, “Correct algebras of bounded capacity over sets of incorrect algorithms,” Soviet Math. Dokl. 22 (1), 19–24 (1980).MathSciNetzbMATHGoogle Scholar
  5. 5.
    A. G. D’yakonov, Algebraic closures of a generalized model of recognition algorithms based on the computation of estimates, Doctoral Dissertation in Mathematics and Physics (Lomonosov Moscow State University, Moscow, 2009).Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Moscow State UniversityMoscowRussia

Personalised recommendations