Solution of instance-based recognition problems with a large number of classes

详细

A learning-based classification problem with a large number of classes is considered. The error-correcting-output-codes (ЕСОС) scheme is optimized. An initial binary matrix is formed at random so that the number of its rows is equal to the number of classes and each column corresponds to the union of several classes in two macroclasses. In the ЕСОС approach, a binary classification problem is solved for every object to be recognized and for every union. The object is assigned to the class with the nearest code row. A generalization of the ЕСОС approach is presented in which a discrete optimization problem is solved to find optimal unions, probabilities of correct classification are used in dichotomy problems, and the degree of dichotomy informativeness is taken into account. If the solution algorithms for the dichotomy problems are correct, the recognition algorithm for the original problem is correct as well.