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ženo v:

Podrobná bibliografie
Vydáno 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:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.10.2018 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

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