• DocumentCode
    2040114
  • Title

    AdaBoost Parallelization on PC Clusters with Virtual Shared Memory for Fast Feature Selection

  • Author

    Galtier, Virginie ; Pietquin, Olivier ; Vialle, Stéphane

  • Author_Institution
    IMS Res. Group, SUPELEC, Metz, France
  • fYear
    2007
  • fDate
    24-27 Nov. 2007
  • Firstpage
    165
  • Lastpage
    168
  • Abstract
    Feature selection is a key issue in many machine learning applications and the need to test lots of candidate features is real while computational time required to do so is often huge. In this paper, we introduce a parallel version of the well-known AdaBoost algorithm to speed up and size up feature selection for binary classification tasks using large training datasets and a wide range of elementary features. This parallelization is done without any modification to the AdaBoost algorithm and designed for PC clusters using Java and the JavaSpace distributed framework. JavaSpace is a memory sharing paradigm implemented on top of a virtual shared memory, that appears both efficient and easy-to-use. Results and performances on a face detection system trained with the proposed parallel AdaBoost are presented.
  • Keywords
    feature extraction; image classification; learning (artificial intelligence); parallel languages; shared memory systems; AdaBoost algorithm; AdaBoost parallelization; JavaSpace distributed framework; PC clusters; binary classification tasks; face detection system; fast feature selection; large training datasets; machine learning applications; memory sharing paradigm; virtual shared memory; Algorithm design and analysis; Clustering algorithms; Distributed computing; Distributed databases; Iterative algorithms; Java; Machine learning; Machine learning algorithms; Parallel programming; Signal processing algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing and Communications, 2007. ICSPC 2007. IEEE International Conference on
  • Conference_Location
    Dubai
  • Print_ISBN
    978-1-4244-1235-8
  • Electronic_ISBN
    978-1-4244-1236-5
  • Type

    conf

  • DOI
    10.1109/ICSPC.2007.4728281
  • Filename
    4728281