Advertisement

Algorithmica

, Volume 45, Issue 3, pp 433–456 | Cite as

Parallelizing Feature Selection

  • Jerffeson Teixeira de SouzaEmail author
  • Stan MatwinEmail author
  • Nathalie JapkowiczEmail author
Article

Abstract

Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on data representing past experience in classifying instances. However, the presence of a large number of features in training data can hurt the classification capacity of a machine learning algorithm. The Feature Selection problem involves discovering a subset of features such that a classifier built only with this subset would attain predictive accuracy no worse than a classifier built from the entire set of features. Several algorithms have been proposed to solve this problem. In this paper we discuss how parallelism can be used to improve the performance of feature selection algorithms. In particular, we present, discuss and evaluate a coarse-grained parallel version of the feature selection algorithm FortalFS. This algorithm performs well compared with other solutions and it has certain characteristics that makes it a good candidate for parallelization. Our parallel design is based on the master--slave design pattern. Promising results show that this approach is able to achieve near optimum speedups in the context of Amdahl's Law.

Keywords

Feature Selection Feature Selection Algorithm Good Subset Parallelization Strategy Master Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Computer Science Department, State University of Ceara, Fortaleza, 60740-000Brazil
  2. 2.School of Information Technology and Engineering, University of Ottawa, Ottawa, K1N 6N5Canada

Personalised recommendations