On an Efficient Approximation Algorithm for Minimal Committee Machine Learning 1
M. Yu. Khachai · 2003
The combinatorial problem of the minimal committee of an inconsistent system of constraints aris- ing at the stage of construction of the committee decision rule with a small number of variables is discussed. It is demonstrated that, in the general case, the problem is intractable. An approximation algorithm for a particular case of the problem (for a system of linear inequalities) is proposed; its computational complexity and estimate of accuracy are considered.