Hybrid of genetic algorithm and great deluge algorithm for rough set attribute reduction

Najmeh Sadat Jaddi, Salwani Abdullah

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

The attribute reduction problem is the process of reducing unimportant attributes from a decision system to decrease the diffculty of data mining or knowledge discovery tasks. Many algorithms have been used to optimize this problem in rough set theory. The genetic algorithm (GA) is one of the algorithms that has already been applied to optimize this problem. This paper proposes 2 kinds of memetic algorithms, which are a hybridization of the GA, with 2 versions (linear and nonlinear) of the great deluge (GD) algorithm. The purpose of this hybridization is to investigate the ability of this local search algorithm to improve the performance of the GA. In both of the methods, the local search (the GD algorithm) is employed to each generation of the GA. The only difference of these methods is the rate of increase in the 'level' in the GD algorithm. The level is increased by a xed value in the linear GD algorithm, while the nonlinear GD algorithm uses the quality of the current solution to calculate the increase rate of the level in each iteration. The 13 datasets taken from the University of California - Irvine machine learning repository are used to test the methods and compare the results with the on-hand results in the literature, especially with the original GA. The classication accuracies of each dataset using the obtained reducts are examined and compared with other approaches using ROSETTA software. The promising results show the potential of the algorithm to solve the attribute reduction problem.

Original languageEnglish
Pages (from-to)1737-1750
Number of pages14
JournalTurkish Journal of Electrical Engineering and Computer Sciences
Volume21
Issue number6
DOIs
Publication statusPublished - 2013

Fingerprint

Genetic algorithms
Data mining
Rough set theory
Learning systems

Keywords

  • Attribute reduction
  • Classication
  • Genetic algorithm
  • Great deluge algorithm
  • Rough set theory

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science(all)

Cite this

Hybrid of genetic algorithm and great deluge algorithm for rough set attribute reduction. / Jaddi, Najmeh Sadat; Abdullah, Salwani.

In: Turkish Journal of Electrical Engineering and Computer Sciences, Vol. 21, No. 6, 2013, p. 1737-1750.

Research output: Contribution to journalArticle

@article{49d46644fc7d4630a62948a15fe2cd88,
title = "Hybrid of genetic algorithm and great deluge algorithm for rough set attribute reduction",
abstract = "The attribute reduction problem is the process of reducing unimportant attributes from a decision system to decrease the diffculty of data mining or knowledge discovery tasks. Many algorithms have been used to optimize this problem in rough set theory. The genetic algorithm (GA) is one of the algorithms that has already been applied to optimize this problem. This paper proposes 2 kinds of memetic algorithms, which are a hybridization of the GA, with 2 versions (linear and nonlinear) of the great deluge (GD) algorithm. The purpose of this hybridization is to investigate the ability of this local search algorithm to improve the performance of the GA. In both of the methods, the local search (the GD algorithm) is employed to each generation of the GA. The only difference of these methods is the rate of increase in the 'level' in the GD algorithm. The level is increased by a xed value in the linear GD algorithm, while the nonlinear GD algorithm uses the quality of the current solution to calculate the increase rate of the level in each iteration. The 13 datasets taken from the University of California - Irvine machine learning repository are used to test the methods and compare the results with the on-hand results in the literature, especially with the original GA. The classication accuracies of each dataset using the obtained reducts are examined and compared with other approaches using ROSETTA software. The promising results show the potential of the algorithm to solve the attribute reduction problem.",
keywords = "Attribute reduction, Classication, Genetic algorithm, Great deluge algorithm, Rough set theory",
author = "Jaddi, {Najmeh Sadat} and Salwani Abdullah",
year = "2013",
doi = "10.3906/elk-1202-113",
language = "English",
volume = "21",
pages = "1737--1750",
journal = "Turkish Journal of Electrical Engineering and Computer Sciences",
issn = "1300-0632",
publisher = "Turkiye Klinikleri",
number = "6",

}

TY - JOUR

T1 - Hybrid of genetic algorithm and great deluge algorithm for rough set attribute reduction

AU - Jaddi, Najmeh Sadat

AU - Abdullah, Salwani

PY - 2013

Y1 - 2013

N2 - The attribute reduction problem is the process of reducing unimportant attributes from a decision system to decrease the diffculty of data mining or knowledge discovery tasks. Many algorithms have been used to optimize this problem in rough set theory. The genetic algorithm (GA) is one of the algorithms that has already been applied to optimize this problem. This paper proposes 2 kinds of memetic algorithms, which are a hybridization of the GA, with 2 versions (linear and nonlinear) of the great deluge (GD) algorithm. The purpose of this hybridization is to investigate the ability of this local search algorithm to improve the performance of the GA. In both of the methods, the local search (the GD algorithm) is employed to each generation of the GA. The only difference of these methods is the rate of increase in the 'level' in the GD algorithm. The level is increased by a xed value in the linear GD algorithm, while the nonlinear GD algorithm uses the quality of the current solution to calculate the increase rate of the level in each iteration. The 13 datasets taken from the University of California - Irvine machine learning repository are used to test the methods and compare the results with the on-hand results in the literature, especially with the original GA. The classication accuracies of each dataset using the obtained reducts are examined and compared with other approaches using ROSETTA software. The promising results show the potential of the algorithm to solve the attribute reduction problem.

AB - The attribute reduction problem is the process of reducing unimportant attributes from a decision system to decrease the diffculty of data mining or knowledge discovery tasks. Many algorithms have been used to optimize this problem in rough set theory. The genetic algorithm (GA) is one of the algorithms that has already been applied to optimize this problem. This paper proposes 2 kinds of memetic algorithms, which are a hybridization of the GA, with 2 versions (linear and nonlinear) of the great deluge (GD) algorithm. The purpose of this hybridization is to investigate the ability of this local search algorithm to improve the performance of the GA. In both of the methods, the local search (the GD algorithm) is employed to each generation of the GA. The only difference of these methods is the rate of increase in the 'level' in the GD algorithm. The level is increased by a xed value in the linear GD algorithm, while the nonlinear GD algorithm uses the quality of the current solution to calculate the increase rate of the level in each iteration. The 13 datasets taken from the University of California - Irvine machine learning repository are used to test the methods and compare the results with the on-hand results in the literature, especially with the original GA. The classication accuracies of each dataset using the obtained reducts are examined and compared with other approaches using ROSETTA software. The promising results show the potential of the algorithm to solve the attribute reduction problem.

KW - Attribute reduction

KW - Classication

KW - Genetic algorithm

KW - Great deluge algorithm

KW - Rough set theory

UR - http://www.scopus.com/inward/record.url?scp=84885611823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885611823&partnerID=8YFLogxK

U2 - 10.3906/elk-1202-113

DO - 10.3906/elk-1202-113

M3 - Article

VL - 21

SP - 1737

EP - 1750

JO - Turkish Journal of Electrical Engineering and Computer Sciences

JF - Turkish Journal of Electrical Engineering and Computer Sciences

SN - 1300-0632

IS - 6

ER -