On Greediness of Feature Selection Algorithms - Robotics Institute Carnegie Mellon University

On Greediness of Feature Selection Algorithms

Kan Deng and Andrew Moore
Tech. Report, CMU-RI-TR-98-03, Robotics Institute, Carnegie Mellon University, February, 1998

Abstract

Based on our analysis and experiments using real-world datasets, we find that the greediness of forward feature selection algorithms doesn't severely corrupt the accuracy of the function approximation using the selected input features, but improves the efficiency significantly. Hence, we propose three greedier algorithms in order to further enhance the efficiency of the feature selection processing. We also propose to use these algorithms to develop an off-line Chinese and Japanese handwriting recognition system with automatically configured, local models.

BibTeX

@techreport{Deng-1998-14584,
author = {Kan Deng and Andrew Moore},
title = {On Greediness of Feature Selection Algorithms},
year = {1998},
month = {February},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-98-03},
}