Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kozin et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: