RST-DCA: a dendritic cell algorithm based on rough set theory

  • Authors:
  • Zeineb Chelly;Zied Elouedi

  • Affiliations:
  • LARODEC, University of Tunis, Le Bardo, Tunisia;LARODEC, University of Tunis, Le Bardo, Tunisia

  • Venue:
  • ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Dendritic Cell Algorithm (DCA) is an immune-inspired classification algorithm based on the behavior of dendritic cells. The DCA performance depends on its data pre-processing phase including feature selection and their categorization to specific signal types. For feature selection, DCA applies the principal component analysis (PCA). Nevertheless, PCA does not guarantee that the selected first principal components will be the most adequate for classification. Furthermore, the categorization of features to their specific signal types is based on the PCA attributes' ranking in terms on variability which does not make "sense". Thus, the aim of this paper is to develop a new DCA data pre-processing method based on Rough Set Theory (RST). In this newly-proposed hybrid DCA model, the selection and the categorization of attributes are based on the RST CORE and REDUCT concepts. Results show that using RST instead of PCA for the DCA data pre-processing phase yields much better performance in terms of classification accuracy.