Stability of a model of pattern recognition algorithms

A family of recognition algorithms with generalized standards is investigated, and the validity of its linear closure is proved. A concept of algorithm stability in recognition problems is introduced, and the sufficient conditions for stability are given. It is shown that a correct algorithm belonging to the family considered is stable.