Recurrent Algorithms of Structural Classification Analysis for Complex Organized Information
For the structural classification analysis of complex organized information, we propose to use recurrent algorithms of stochastic approximation type. We introduce classification quality functionals that depend on non-normalized and zero moments of probability distribution functions for the probabili...
Uložené v:
| Vydané v: | Automation and remote control Ročník 79; číslo 10; s. 1854 - 1862 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Moscow
Pleiades Publishing
01.10.2018
Springer Nature B.V |
| Predmet: | |
| ISSN: | 0005-1179, 1608-3032 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | For the structural classification analysis of complex organized information, we propose to use recurrent algorithms of stochastic approximation type. We introduce classification quality functionals that depend on non-normalized and zero moments of probability distribution functions for the probability of sample objects appearing in the classes, as well as the type of optimal classification. We propose a new classification algorithm for this type of classification quality criteria and prove a theorem about its convergence that ensures the stationary value of the corresponding functional. We show that the proposed algorithm can be used to solve a wide class of problems in structural classification analysis. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0005-1179 1608-3032 |
| DOI: | 10.1134/S0005117918100090 |