Please use this identifier to cite or link to this item:
https://dspace.uzhnu.edu.ua/jspui/handle/lib/50913
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Povkhan, Igor | - |
dc.contributor.author | Mulesa, Oksana | - |
dc.contributor.author | Melnyk, Olena | - |
dc.contributor.author | Bilak, Yuriy | - |
dc.contributor.author | Polishchuk, Volodymyr | - |
dc.contributor.author | Білак, Юрій Юрійович | - |
dc.contributor.author | Мулеса, Оксана Юріївна | - |
dc.contributor.author | Повхан, Ігор Федорович | - |
dc.contributor.author | Мельник, Олена Олексіївна | - |
dc.date.accessioned | 2023-04-25T11:40:12Z | - |
dc.date.available | 2023-04-25T11:40:12Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | The problem of convergence of classifiers construction procedure in the schemes of logical and algorithmic classification trees Povkhan, I. , Mulesa, O. , Melnyk, O., Bilak, Y. , Polishchuk, V. CEUR Workshop Proceedings, 2022, pp. 1–13. | uk |
dc.identifier.uri | https://dspace.uzhnu.edu.ua/jspui/handle/lib/50913 | - |
dc.description.abstract | The paper considers the problem of convergence in the procedure of classifier schemes synthesis by methods of logical and algorithmic classification trees. It suggests the upper evaluation of complexity for the scheme of algorithms tree in the problem of approximation of real data array by a set of generalized features with a fixed criterion of termination of the branching procedure at the stage of the classification tree construction. This approach provides the required accuracy of the model, evaluates its complexity, reduces the number of branches, and achieves the required performance features. The paper represents the evaluation of convergence for the procedure of recognition schemes construction is logical and algorithmic classification trees on conditions of weak and robust separation of primary initial sampling classes. | uk |
dc.language.iso | en | uk |
dc.relation.ispartofseries | CEUR Workshop Proceedings; | - |
dc.subject | logical tree | uk |
dc.subject | algorithmic tree | uk |
dc.subject | classifier | uk |
dc.subject | pattern recognition | uk |
dc.subject | feature | uk |
dc.subject | initial sample | uk |
dc.title | The problem of convergence of classifiers construction procedure in the schemes of logical and algorithmic classification trees | uk |
dc.type | Text | uk |
dc.pubType | Стаття | uk |
Appears in Collections: | Наукові публікації кафедри програмного забезпечення систем |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
paper1.pdf | 575.21 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.