Completeness criteria for a linear model of classification algorithms with respect to families of decision rules

In the framework of Zhuravlev’s algebraic approach to classification problems, a linear model of algorithms is investigated (estimates of class membership are generated by linear regressions). The possibility of weakening the completeness requirement (obtaining an arbitrary estimation matrix) in order to obtain any classification of a fixed set of objects by using special decision rules is investigated.