Add to ORKGIn 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
Some new properties and computational tools for finding KL-optimum designs are provided in this pape...
This paper considers the problem of learning optimal discriminant functions for pattern classificati...
Extremal permutation problems are combinatorial problems where an objective function has to be optim...
In the article the problem of finding optimal classifications on a finite set is investigated. It is...
The theoretical-multiple approach tp the classification of the statistical classes has been develope...
The methods suggested make it possible to find clasters with the given properties and to optimize se...
The essence of metaheuristic methods and conditions of their application are considered, in particul...
The new class of the recognition algorithms based on the local optimally criteria, methods for optim...
The design of nearest neighbour classifiers can be seen as the partitioning of the whole domain in d...
The main goal of the research direction is to extract building blocks of knowledge from a problem do...
One of the popular multi-class classification methods is to combine binary classifiers. As well as t...
A survey is given that comprises the known classification results on non-mixed and mixed optimal cov...
In Optimality Theory, a linguistic input is assigned a grammatical structural description by selecti...
This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and ac...
Abstract In classification, with an increasing number of variables, the required number of observati...
Some new properties and computational tools for finding KL-optimum designs are provided in this pape...
This paper considers the problem of learning optimal discriminant functions for pattern classificati...
Extremal permutation problems are combinatorial problems where an objective function has to be optim...
In the article the problem of finding optimal classifications on a finite set is investigated. It is...
The theoretical-multiple approach tp the classification of the statistical classes has been develope...
The methods suggested make it possible to find clasters with the given properties and to optimize se...
The essence of metaheuristic methods and conditions of their application are considered, in particul...
The new class of the recognition algorithms based on the local optimally criteria, methods for optim...
The design of nearest neighbour classifiers can be seen as the partitioning of the whole domain in d...
The main goal of the research direction is to extract building blocks of knowledge from a problem do...
One of the popular multi-class classification methods is to combine binary classifiers. As well as t...
A survey is given that comprises the known classification results on non-mixed and mixed optimal cov...
In Optimality Theory, a linguistic input is assigned a grammatical structural description by selecti...
This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and ac...
Abstract In classification, with an increasing number of variables, the required number of observati...
Some new properties and computational tools for finding KL-optimum designs are provided in this pape...
This paper considers the problem of learning optimal discriminant functions for pattern classificati...
Extremal permutation problems are combinatorial problems where an objective function has to be optim...