Construction of all non-reducible descriptors

摘要

We present a computational procedure based on a decision-tree model for the identification and construction of all non-reducible descriptors in a supervised pattern recognition problem in which pattern descriptions consist of Boolean features. We illustrate the use of the procedure through its application to the standard problem of recognizing Arabic numerals. We also present an analysis of the computational complexity of the procedure.