Comparing High-Order Boolean Features

Adam Drake, Dan A. Ventura · ScholarsArchive (Brigham Young University) · 2005

Many learning algorithms attempt, either explicitly or implicitly, to discover useful high-order features. When considering all possible functions that could be encountered, no particular type of high-order feature should be more useful than any other. However, this paper presents arguments and empirical results that suggest that for the learning problems typically encountered in practice, some high-order features may be more useful than others.

Read the paper · More papers on PaperTik