Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules.

In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained. Keywords: Partial reducts, partial decision rules, weights, greedy algorithms. [ABSTRACT FROM AUTHOR]