The Relationship between the Knowledge Model and the Pattern Recognition Problem

The paper is devoted to the problem of pattern decomposition in solving the problem of pattern recognition. The problem of pattern decomposition is considered regardless of the recognition algorithms used. The only requirement consists in the fact that the pattern recognition problem should have a classical formulation. It is shown that, with no reference to the knowledge model, pattern decomposition cannot be performed in terms of the scope of the recognition problem itself, as this leads to a revision of this recognition problem. In the same cases, when the pattern recognition problem is retained in the course of decomposition, it can change in such a way that its solution in the decomposed form is not identical to the solution to the initial pattern recognition problem.