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...

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control Vol. 79; no. 10; pp. 1854 - 1862
Main Authors: Dorofeyuk, A. A., Bauman, E. V., Dorofeyuk, Yu. A., Chernyavskii, A. L.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.10.2018
Springer Nature B.V
Subjects:
ISSN:0005-1179, 1608-3032
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117918100090