Please use this identifier to cite or link to this item:
https://dspace.uzhnu.edu.ua/jspui/handle/lib/36932
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Повхан, Ігор Федорович | - |
dc.contributor.author | Міца, Олександр Володимирович | - |
dc.contributor.author | Мулеса, Оксана Юріївна | - |
dc.contributor.author | Мельник, Олена Олексіївна | - |
dc.date.accessioned | 2021-10-25T12:57:39Z | - |
dc.date.available | 2021-10-25T12:57:39Z | - |
dc.date.issued | 2021 | - |
dc.identifier.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. | uk |
dc.identifier.issn | 1607-3274 | - |
dc.identifier.uri | https://dspace.uzhnu.edu.ua/jspui/handle/lib/36932 | - |
dc.description.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. | uk |
dc.language.iso | en | uk |
dc.subject | algorithmic classification tree | uk |
dc.subject | classification | uk |
dc.subject | image recognition | uk |
dc.subject | classification algorithm | uk |
dc.title | Problem of a discrete data array approximation by a set of elementary geometric algorithms | uk |
dc.type | Text | uk |
dc.pubType | Стаття | uk |
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.