The aggregation algorithm in search for informative features

Search for informative features boils down in numerous cases to finding the upper zeros of the monotone Boolean function on a grid. In the case discussed in the article the solution is found for some subsets and has to be found in other parts of the grid. An algorithm is provided which reduces the search by using this incomplete information; a strategy of iterative application of the algorithm is proposed. A system of subsets is developed for most efficient application of the strategy.