An Algorithm for Reselecting a Reference Objects
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.
Keywordsalgorithm for calculation of estimates algebraic theory of algorithms selection of learning objects totality of essential precedents
Unable to display preview. Download preview PDF.
- 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.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
- 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