Abstract
In the article the problem of finding optimal classifications on a finite set is investigated. It is shown that the problem of finding an optimal classification is generated by a tolerance relation on a finite set. It is also reduced to an optimization problem on a set of permutations. It is proposed a modification of the mixed jumping frogs to find suboptimal solutions of the problem of classification.
Highlights
16 March 2021V., Doctor of Physical and Mathematical Sciences, Professor, Zaporizhzhia National University, Ukraine Selyutin E
The classification problem arises in almost all areas of knowledge when analyzing research results, when designing and forecasting, when assessing and making decisions
Often the priorities of the decision maker (DM) influence the solution of this problem. This leads to the construction of fundamentally different classifications based on the same primary information. Often this situation arises in those areas of knowledge in which it is impossible to use numerical estimates in the classification of objects and phenomena, due to which there is a need for fuzzy assessments, the use of the concepts “similar”
Summary
V., Doctor of Physical and Mathematical Sciences, Professor, Zaporizhzhia National University, Ukraine Selyutin E. K., postgraduate student, Zaporizhzhia National University, Ukraine Polyuga S. I., Ph.D., Zaporizhzhia Regional Institute of Postgraduate Pedagogical Education, Ukraine. KEYWORDS optimal classification problem, classification, evolutionary algorithm, ant colony algorithm, mixed jumping frog algorithm
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
