Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem

Majdi Mafarja, Salwani Abdullah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, two single-solution-based meta-heuristic methods for attribute reduction are presented. The first one is based on a record-to-record travel algorithm, while the second is based on a Great Deluge algorithm. These two methods are coded as RRT and m-GD, respectively. Both algorithms are deterministic optimisation algorithms, where their structures are inspired by and resemble the Simulated Annealing algorithm, while they differ in the acceptance of worse solutions. Moreover, they belong to the same family of meta-heuristic algorithms that try to avoid stacking in the local optima by accepting non-improving neighbours. The obtained reducts from both algorithms were passed to ROSETTA and the classification accuracy and the number of generated rules are reported. Computational experiments confirm that RRT m-GD is able to select the most informative attributes which leads to a higher classification accuracy.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
PublisherSpringer Verlag
Pages111-120
Number of pages10
Volume378 CCIS
ISBN (Print)9783642405662
DOIs
Publication statusPublished - 2013
Event2nd International Multi-Conference on Artificial Intelligence Technology, M-CAIT 2013 - Shah Alam
Duration: 28 Aug 201329 Aug 2013

Publication series

NameCommunications in Computer and Information Science
Volume378 CCIS
ISSN (Print)18650929

Other

Other2nd International Multi-Conference on Artificial Intelligence Technology, M-CAIT 2013
CityShah Alam
Period28/8/1329/8/13

Fingerprint

Heuristic methods
Heuristic algorithms
Simulated annealing
Experiments

Keywords

  • Classification
  • Great Deluge algorithm
  • Record to Record Travel algorithm
  • Rough Set Theory

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Mafarja, M., & Abdullah, S. (2013). Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. In Communications in Computer and Information Science (Vol. 378 CCIS, pp. 111-120). (Communications in Computer and Information Science; Vol. 378 CCIS). Springer Verlag. https://doi.org/10.1007/978-3-642-40567-9_10

Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. / Mafarja, Majdi; Abdullah, Salwani.

Communications in Computer and Information Science. Vol. 378 CCIS Springer Verlag, 2013. p. 111-120 (Communications in Computer and Information Science; Vol. 378 CCIS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mafarja, M & Abdullah, S 2013, Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. in Communications in Computer and Information Science. vol. 378 CCIS, Communications in Computer and Information Science, vol. 378 CCIS, Springer Verlag, pp. 111-120, 2nd International Multi-Conference on Artificial Intelligence Technology, M-CAIT 2013, Shah Alam, 28/8/13. https://doi.org/10.1007/978-3-642-40567-9_10
Mafarja M, Abdullah S. Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. In Communications in Computer and Information Science. Vol. 378 CCIS. Springer Verlag. 2013. p. 111-120. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-40567-9_10
Mafarja, Majdi ; Abdullah, Salwani. / Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. Communications in Computer and Information Science. Vol. 378 CCIS Springer Verlag, 2013. pp. 111-120 (Communications in Computer and Information Science).
@inproceedings{3c142baaee5d42e9bb223d61d9917f08,
title = "Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem",
abstract = "In this paper, two single-solution-based meta-heuristic methods for attribute reduction are presented. The first one is based on a record-to-record travel algorithm, while the second is based on a Great Deluge algorithm. These two methods are coded as RRT and m-GD, respectively. Both algorithms are deterministic optimisation algorithms, where their structures are inspired by and resemble the Simulated Annealing algorithm, while they differ in the acceptance of worse solutions. Moreover, they belong to the same family of meta-heuristic algorithms that try to avoid stacking in the local optima by accepting non-improving neighbours. The obtained reducts from both algorithms were passed to ROSETTA and the classification accuracy and the number of generated rules are reported. Computational experiments confirm that RRT m-GD is able to select the most informative attributes which leads to a higher classification accuracy.",
keywords = "Classification, Great Deluge algorithm, Record to Record Travel algorithm, Rough Set Theory",
author = "Majdi Mafarja and Salwani Abdullah",
year = "2013",
doi = "10.1007/978-3-642-40567-9_10",
language = "English",
isbn = "9783642405662",
volume = "378 CCIS",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "111--120",
booktitle = "Communications in Computer and Information Science",

}

TY - GEN

T1 - Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem

AU - Mafarja, Majdi

AU - Abdullah, Salwani

PY - 2013

Y1 - 2013

N2 - In this paper, two single-solution-based meta-heuristic methods for attribute reduction are presented. The first one is based on a record-to-record travel algorithm, while the second is based on a Great Deluge algorithm. These two methods are coded as RRT and m-GD, respectively. Both algorithms are deterministic optimisation algorithms, where their structures are inspired by and resemble the Simulated Annealing algorithm, while they differ in the acceptance of worse solutions. Moreover, they belong to the same family of meta-heuristic algorithms that try to avoid stacking in the local optima by accepting non-improving neighbours. The obtained reducts from both algorithms were passed to ROSETTA and the classification accuracy and the number of generated rules are reported. Computational experiments confirm that RRT m-GD is able to select the most informative attributes which leads to a higher classification accuracy.

AB - In this paper, two single-solution-based meta-heuristic methods for attribute reduction are presented. The first one is based on a record-to-record travel algorithm, while the second is based on a Great Deluge algorithm. These two methods are coded as RRT and m-GD, respectively. Both algorithms are deterministic optimisation algorithms, where their structures are inspired by and resemble the Simulated Annealing algorithm, while they differ in the acceptance of worse solutions. Moreover, they belong to the same family of meta-heuristic algorithms that try to avoid stacking in the local optima by accepting non-improving neighbours. The obtained reducts from both algorithms were passed to ROSETTA and the classification accuracy and the number of generated rules are reported. Computational experiments confirm that RRT m-GD is able to select the most informative attributes which leads to a higher classification accuracy.

KW - Classification

KW - Great Deluge algorithm

KW - Record to Record Travel algorithm

KW - Rough Set Theory

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

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

U2 - 10.1007/978-3-642-40567-9_10

DO - 10.1007/978-3-642-40567-9_10

M3 - Conference contribution

AN - SCOPUS:84904687293

SN - 9783642405662

VL - 378 CCIS

T3 - Communications in Computer and Information Science

SP - 111

EP - 120

BT - Communications in Computer and Information Science

PB - Springer Verlag

ER -