Author:
Batenkov Aleksandr,Batenkov Kirill,Bogachev Andrey,Mishin Vladislav
Abstract
The paper claims that the primary importance in solving the classification problem is to find the conditions for dividing the General complexity into classes, determine the quality of such a bundle, and verify the classifier model. We consider a mathematical model of a non-randomized classifier of features obtained without a teacher, when the number of classes is not set a priori, but only its upper bound is set. The mathematical model is presented in the form of a statement of a minimax conditional extreme task, and it is a problem of searching for the matrix of belonging of objects to a class, and representative (reference) elements within each class. The development of the feature classifier is based on the synthesis of two-dimensional probability density in the coordinate space: classes-objects. Using generalized functions, the probabilistic problem of finding the minimum Bayesian risk is reduced to a deterministic problem on a set of non-randomized classifiers. At the same time, the use of specially introduced constraints fixes non-randomized decision rules and plunges the integer problem of nonlinear programming into a General continuous nonlinear problem. For correct synthesis of the classifier, the dispersion curve of the isotropic sample is necessary. It is necessary to use the total intra-class and inter-class variance to characterize the quality of classification. The classification problem can be interpreted as a particular problem of the theory of catastrophes. Under the conditions of limited initial data, a minimax functional was found that reflects the quality of classification for a quadratic loss function. The developed mathematical model is classified as an integer nonlinear programming problem. The model is given using polynomial constraints to the form of a General problem of nonlinear continuous programming. The necessary conditions for the bundle into classes are found. These conditions can be used as sufficient when testing the hypothesis about the existence of classes.
Subject
Artificial Intelligence,Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Computer Networks and Communications,Information Systems
Reference41 articles.
1. Блауберг И.В. Проблемы методологии системного исследования // М.: Мысль. 1970. 454 с.
2. He H. A Deep Research in Classic Classification Network // IOP Conf. Series: Materials Science and Engineering. 2020. 740 p.
3. Wehrmann J., Cerri R., Barros R.C. Hierarchical Multi-Label Classification Networks // Proceedings of the 35th International Conference on Machine Learning, Stockholm (PMLR 80). 2018. pp. 5075–5084.
4. Li P., Wang D., Wang L., Lu H. Visual Tracking by Dynamic Matching-Classification Network Switching // Pattern Recognition. 2020. pp. 107419.
5. Айвазян С.А. Прикладная статистика. Классификация и снижение размерности // М.: Финансы и статистика. 1989. 606 с.