MapReduce implementation for minimum reduct using parallel genetic algorithm

Mashaan A. Alshammari, El Sayed M. El-Alfy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Rough set theory (RST) proved to be an effective approach in data mining which can be used successfully for feature/attribute selection and rule induction. Unfortunately, the search space created by RST can be huge and it is important to reduce the search time for the shortest reduct. Genetic algorithm (GA) is one of the metaheuristic algorithms that have been used to tackle this NP-hard optimization problem. However, the effectiveness of the genetic algorithm depends on its implementation. In this work, we introduce a MapReduce approach of a parallel generic algorithm to find the minimum reduct. We evaluated the proposed approach on a number of cybersecurity datasets with varying characteristics. The results showed that the MapReduce approach was more efficient than the sequential approach especially when we go for high dimensions.

Original languageEnglish
Title of host publication2015 6th International Conference on Information and Communication Systems, ICICS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages13-18
Number of pages6
ISBN (Electronic)9781479973491
DOIs
StatePublished - 6 May 2015

Publication series

Name2015 6th International Conference on Information and Communication Systems, ICICS 2015

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'MapReduce implementation for minimum reduct using parallel genetic algorithm'. Together they form a unique fingerprint.

Cite this