On a Class of Computationally Efficient Feature Selection Criteria.

摘要

This paper considers the computation problems in feature selection. A recursive computation procedure is presented for feature selection and ordering by using the indirect measures such as the Bhattacharyya distance and mutual information. Both binary and quantized measurements are considered. Supporting computer results are provided. (Author)