Optimal Method for Constructing AEC of Maximum Height in the Context of Pattern Recognition

摘要

As has been proven by Zhuravlev, there exists a correct algorithm, which is a polynomial over the family of Algorithms of Estimate Calculating (AEC) for any regular recognition task. Construction of the optimal polynomial is reduced to the task of finding its optimal members in this family, i.e., the AEC with the best features. The optimal method of constructing AEC of maximum height is described.