On an optimal linear pattern classification procedure

摘要

The problem of Optimal Linear Discrimination for 3-class pattern recognition is attacked. The Linear Discrimination Rule, under those circumstances, is devised according to the following optimality criterion: maximize the probability of correct classification into any one of the three classes, while keeping the other two such probabilities fixed.An explicit solution of the problem is given, and a search technique is implemented greatly reducing the problem complexity.