Please use this identifier to cite or link to this item:
https://dspace.uzhnu.edu.ua/jspui/handle/lib/36932
Title: | Problem of a discrete data array approximation by a set of elementary geometric algorithms |
Authors: | Повхан, Ігор Федорович Міца, Олександр Володимирович Мулеса, Оксана Юріївна Мельник, Олена Олексіївна |
Keywords: | algorithmic classification tree, classification, image recognition, classification algorithm |
Issue Date: | 2021 |
Citation: | Povkhan I.F., Mitsa O.V., Mulesa O.Y., Melnyk O.O. Problem of a discrete data array approximation by a set of elementary geometric algorithms. Radio Electronics, Computer Science, Control. 2021, 3: 109-123. |
Abstract: | In this paper, a problem of a discrete data array approximation by a set of elementary geometric algorithms and a recognition model representation in a form of algorithmic classification tree has been solved. The object of the present study is a concept of a classification tree in a form of an algorithm trees. The subject of this study are the relevant models, methods, algorithms and schemes of different classification tree construction. |
Type: | Text |
Publication type: | Стаття |
URI: | https://dspace.uzhnu.edu.ua/jspui/handle/lib/36932 |
ISSN: | 1607-3274 |
Appears in Collections: | Наукові публікації кафедри інформаційних управляючих систем та технологій |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Povhan.pdf | 665.03 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.