Construction of a correct taxonomy algorithm in extensions of a class of pattern recognition algorithms

The completeness of a family of taxonomy algorithms, represented in the form of two interconnected subfamilies, is considered. While constructing the algorithms, defining the completeness of each subfamily, it is snown that a correct algorithm exists in the class of recognition algorithms of the estimate-calculation type.