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

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.

[1]  Jiye Liang,et al.  International Journal of Approximate Reasoning an Efficient Rough Feature Selection Algorithm with a Multi-granulation View , 2022 .

[2]  Kazuyuki Murase,et al.  A new hybrid ant colony optimization algorithm for feature selection , 2012, Expert Syst. Appl..

[3]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[4]  Zdzislaw Pawlak,et al.  Rough Set Theory , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[5]  Yahya Z. Arajy,et al.  Hybrid variable neighbourhood search algorithm for attribute reduction in Rough Set Theory , 2010, 2010 10th International Conference on Intelligent Systems Design and Applications.

[6]  Daoqiang Zhang,et al.  Constraint Score: A new filter method for feature selection with pairwise constraints , 2008, Pattern Recognit..

[7]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[8]  Kazuyuki Murase,et al.  A new local search based hybrid genetic algorithm for feature selection , 2011, Neurocomputing.

[9]  Qiang Shen,et al.  Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches , 2004, IEEE Transactions on Knowledge and Data Engineering.

[10]  K. Thanushkodi,et al.  A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee Colony Optimization , 2010, ArXiv.

[11]  Nasser R. Sabar,et al.  A constructive hyper-heuristics for rough set attribute reduction , 2010, 2010 10th International Conference on Intelligent Systems Design and Applications.

[12]  Huan Liu,et al.  Feature Selection with Selective Sampling , 2002, International Conference on Machine Learning.

[13]  Aleksander Øhrn,et al.  Discernibility and Rough Sets in Medicine: Tools and Applications , 2000 .

[14]  Andrzej Skowron,et al.  Rough set methods in feature selection and recognition , 2003, Pattern Recognit. Lett..

[15]  Salwani Abdullah,et al.  Investigating composite neighbourhood structure for attribute reduction in rough set theory , 2010, 2010 10th International Conference on Intelligent Systems Design and Applications.

[16]  Masao Fukushima,et al.  Tabu search for attribute reduction in rough set theory , 2008, Soft Comput..

[17]  Xiaofei Wang,et al.  A reduct derived from feature selection , 2012, Pattern Recognit. Lett..

[18]  Salwani Abdullah,et al.  Modified great deluge for attribute reduction in rough set theory , 2011, 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).

[19]  Thomas Roß,et al.  Feature selection for optimized skin tumor recognition using genetic algorithms , 1999, Artif. Intell. Medicine.

[20]  Salwani Abdullah,et al.  Great Deluge Algorithm for Rough Set Attribute Reduction , 2010, FGIT-DTA/BSBT.

[21]  Zulaiha Ali Othman,et al.  Bees algorithm for feature selection in network anomaly detection , 2012 .

[22]  Ajith Abraham,et al.  Nature Inspired Population-Based Heuristics for Rough Set Reduction , 2009 .

[23]  Hiroshi Motoda,et al.  Feature Selection for Knowledge Discovery and Data Mining , 1998, The Springer International Series in Engineering and Computer Science.

[24]  Xiangyang Wang,et al.  Feature selection based on rough sets and particle swarm optimization , 2007, Pattern Recognit. Lett..

[25]  Zuren Feng,et al.  An efficient ant colony optimization approach to attribute reduction in rough set theory , 2008, Pattern Recognit. Lett..

[26]  Qinghua Hu,et al.  Feature Selection via Maximizing Fuzzy Dependency , 2010, Fundam. Informaticae.

[27]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[28]  G. Dueck.  New optimization heuristics , 1993 .

[29]  Javad Rahimipour Anaraki,et al.  Improving fuzzy-rough quick reduct for feature selection , 2011, 2011 19th Iranian Conference on Electrical Engineering.

[30]  P. Langley.  Selection of Relevant Features in Machine Learning , 1994 .

[31]  Yasuo Kudo,et al.  A sequential pattern mining algorithm using rough set theory , 2011, Int. J. Approx. Reason..