Re-heat simulated annealing algorithm for rough set attribute reduction

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Attribute reduction deals in finding all possible reducts by egesting redundant attributes while maintaining the information of the problem in hand. This paper aims to investigate an alternative approach to find the minimal attribute from a large set of attributes. Towards this goal, a reheat simulated annealing (Reheat-SA) is proposed to solve an attribute reduction problem in rough set theory. It is a meta heuristic approach that has a mechanism to escape from local optima. The concept of re-heat is introduced to help the algorithm to better explore the search space to finding a better solution. The proposed approach is tested on a well known UCI datasets. Results show that our approach is able to find competitive results when compared to state-of-the-art approaches.

Original languageEnglish
Pages (from-to)2083-2089
Number of pages7
JournalInternational Journal of Physical Sciences
Volume6
Issue number8
Publication statusPublished - Apr 2011

Fingerprint

simulated annealing
Simulated annealing
heat
Rough set theory
set theory
escape
Hot Temperature

Keywords

  • Attribute reduction
  • Re-heat simulated annealing
  • Rough set theory

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Electronic, Optical and Magnetic Materials

Cite this

Re-heat simulated annealing algorithm for rough set attribute reduction. / Abdullah, Salwani; Golafshan, Laleh; Ahmad Nazri, Mohd Zakree.

In: International Journal of Physical Sciences, Vol. 6, No. 8, 04.2011, p. 2083-2089.

Research output: Contribution to journalArticle

@article{9885358d3ec44cad82388b0e17a9a6a3,
title = "Re-heat simulated annealing algorithm for rough set attribute reduction",
abstract = "Attribute reduction deals in finding all possible reducts by egesting redundant attributes while maintaining the information of the problem in hand. This paper aims to investigate an alternative approach to find the minimal attribute from a large set of attributes. Towards this goal, a reheat simulated annealing (Reheat-SA) is proposed to solve an attribute reduction problem in rough set theory. It is a meta heuristic approach that has a mechanism to escape from local optima. The concept of re-heat is introduced to help the algorithm to better explore the search space to finding a better solution. The proposed approach is tested on a well known UCI datasets. Results show that our approach is able to find competitive results when compared to state-of-the-art approaches.",
keywords = "Attribute reduction, Re-heat simulated annealing, Rough set theory",
author = "Salwani Abdullah and Laleh Golafshan and {Ahmad Nazri}, {Mohd Zakree}",
year = "2011",
month = "4",
language = "English",
volume = "6",
pages = "2083--2089",
journal = "International Journal of Physical Sciences",
issn = "1992-1950",
publisher = "Academic Journals",
number = "8",

}

TY - JOUR

T1 - Re-heat simulated annealing algorithm for rough set attribute reduction

AU - Abdullah, Salwani

AU - Golafshan, Laleh

AU - Ahmad Nazri, Mohd Zakree

PY - 2011/4

Y1 - 2011/4

N2 - Attribute reduction deals in finding all possible reducts by egesting redundant attributes while maintaining the information of the problem in hand. This paper aims to investigate an alternative approach to find the minimal attribute from a large set of attributes. Towards this goal, a reheat simulated annealing (Reheat-SA) is proposed to solve an attribute reduction problem in rough set theory. It is a meta heuristic approach that has a mechanism to escape from local optima. The concept of re-heat is introduced to help the algorithm to better explore the search space to finding a better solution. The proposed approach is tested on a well known UCI datasets. Results show that our approach is able to find competitive results when compared to state-of-the-art approaches.

AB - Attribute reduction deals in finding all possible reducts by egesting redundant attributes while maintaining the information of the problem in hand. This paper aims to investigate an alternative approach to find the minimal attribute from a large set of attributes. Towards this goal, a reheat simulated annealing (Reheat-SA) is proposed to solve an attribute reduction problem in rough set theory. It is a meta heuristic approach that has a mechanism to escape from local optima. The concept of re-heat is introduced to help the algorithm to better explore the search space to finding a better solution. The proposed approach is tested on a well known UCI datasets. Results show that our approach is able to find competitive results when compared to state-of-the-art approaches.

KW - Attribute reduction

KW - Re-heat simulated annealing

KW - Rough set theory

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

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

M3 - Article

AN - SCOPUS:79958727607

VL - 6

SP - 2083

EP - 2089

JO - International Journal of Physical Sciences

JF - International Journal of Physical Sciences

SN - 1992-1950

IS - 8

ER -