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.

Uložené v:

Podrobná bibliografia
Vydané v:	Pattern recognition and image analysis Ročník 28; číslo 4; s. 684 - 687
Hlavný autor:	Bondarenko, N. N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.10.2018 Springer Nature B.V
Predmet:	Algorithms Computer Science Image Processing and Computer Vision Iterative methods Mathematical Method in Pattern Recognition Pattern Recognition algebraic theory of algorithms algorithm for calculation of estimates selection of learning objects totality of essential precedents
ISSN:	1054-6618, 1555-6212
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
Bibliografia:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	1054-6618 1555-6212
DOI:	10.1134/S1054661818040053