Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/5318
Title: Comparison between record to record travel and great deluge attribute reduction algorithms for classification problem
Authors: Mafarja, Majdi
Abdullah, Salwani
Keywords: Problem solving;Data mining;Rough sets;Computer algorithms;Classification;Rough sets;Mathematical optimization;Great deluge algorithm;Separation of variables
Issue Date: 11-Nov-2011
Publisher: Springer
Source: Mafarja M., Abdullah S. (2013) Comparison between Record to Record Travel and Great Deluge Attribute Reduction Algorithms for Classification Problem. In: Noah S.A. et al. (eds) Soft Computing Applications and Intelligent Systems. Communications in Computer and Information Science, vol 378. Springer, Berlin, Heidelberg
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.
URI: http://hdl.handle.net/20.500.11889/5318
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
01 RRT and m-GD for Classification.pdf376.07 kBAdobe PDFView/Open
Show full item record

Page view(s)

48
Last Week
0
Last month
3
checked on Jan 2, 2022

Download(s)

128
checked on Jan 2, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.