Natural extensions: Bat algorithm with memory

Ahmed Majid Taha, Soong Der Chen, Aida Mustapha

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Bat Algorithm (BA) has recently started to attract a lot of attention as a powerful search method in various machine learning tasks including feature selection. Feature selection is essentially a dimensionality reduction problem that aims at two key objectives; to shorten the computational time and to improve classification accuracy. This paper attempts to address the issue of high computational time in feature selection by proposing a natural extension to the BA called the Bat Algorithm with Memory (BAM). This algorithm is inspired from observations that natural bats must rely upon spatial memory in navigating familiar spaces with dimensions larger than a few meters due to their limited biosonar operating range. Using the same approach, bats in existing BA is extended with memory capability to enable them to navigate easily over familiar locations. To evaluate the proposed algorithm, a series of experiments were carried out on twelve datasets with different number of objects and attributes. Next, the experimental results were compared with the original version of BA. The results showed that BAM was able to deliver competitive classification accuracy with increased saving time ranging from 28% up to 95%. The results also demonstrated that the time saving was attributed to three characteristics, which are samples number, feature number, and dataset geography. Consequently, BAM is also more efficient with lower number of features and higher number of samples.

Original languageEnglish
Pages (from-to)65-75
Number of pages11
JournalJournal of Theoretical and Applied Information Technology
Volume79
Issue number1
Publication statusPublished - 10 Sep 2015

Fingerprint

Natural Extension
Data storage equipment
Feature Selection
Feature extraction
Geography
Dimensionality Reduction
Search Methods
Learning systems
Machine Learning
Attribute
Series
Evaluate
Experimental Results
Range of data

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{738e224059484365ac8d1000c882aca3,
title = "Natural extensions: Bat algorithm with memory",
abstract = "Bat Algorithm (BA) has recently started to attract a lot of attention as a powerful search method in various machine learning tasks including feature selection. Feature selection is essentially a dimensionality reduction problem that aims at two key objectives; to shorten the computational time and to improve classification accuracy. This paper attempts to address the issue of high computational time in feature selection by proposing a natural extension to the BA called the Bat Algorithm with Memory (BAM). This algorithm is inspired from observations that natural bats must rely upon spatial memory in navigating familiar spaces with dimensions larger than a few meters due to their limited biosonar operating range. Using the same approach, bats in existing BA is extended with memory capability to enable them to navigate easily over familiar locations. To evaluate the proposed algorithm, a series of experiments were carried out on twelve datasets with different number of objects and attributes. Next, the experimental results were compared with the original version of BA. The results showed that BAM was able to deliver competitive classification accuracy with increased saving time ranging from 28{\%} up to 95{\%}. The results also demonstrated that the time saving was attributed to three characteristics, which are samples number, feature number, and dataset geography. Consequently, BAM is also more efficient with lower number of features and higher number of samples.",
author = "Taha, {Ahmed Majid} and Chen, {Soong Der} and Aida Mustapha",
year = "2015",
month = "9",
day = "10",
language = "English",
volume = "79",
pages = "65--75",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "1",

}

Natural extensions : Bat algorithm with memory. / Taha, Ahmed Majid; Chen, Soong Der; Mustapha, Aida.

In: Journal of Theoretical and Applied Information Technology, Vol. 79, No. 1, 10.09.2015, p. 65-75.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Natural extensions

T2 - Bat algorithm with memory

AU - Taha, Ahmed Majid

AU - Chen, Soong Der

AU - Mustapha, Aida

PY - 2015/9/10

Y1 - 2015/9/10

N2 - Bat Algorithm (BA) has recently started to attract a lot of attention as a powerful search method in various machine learning tasks including feature selection. Feature selection is essentially a dimensionality reduction problem that aims at two key objectives; to shorten the computational time and to improve classification accuracy. This paper attempts to address the issue of high computational time in feature selection by proposing a natural extension to the BA called the Bat Algorithm with Memory (BAM). This algorithm is inspired from observations that natural bats must rely upon spatial memory in navigating familiar spaces with dimensions larger than a few meters due to their limited biosonar operating range. Using the same approach, bats in existing BA is extended with memory capability to enable them to navigate easily over familiar locations. To evaluate the proposed algorithm, a series of experiments were carried out on twelve datasets with different number of objects and attributes. Next, the experimental results were compared with the original version of BA. The results showed that BAM was able to deliver competitive classification accuracy with increased saving time ranging from 28% up to 95%. The results also demonstrated that the time saving was attributed to three characteristics, which are samples number, feature number, and dataset geography. Consequently, BAM is also more efficient with lower number of features and higher number of samples.

AB - Bat Algorithm (BA) has recently started to attract a lot of attention as a powerful search method in various machine learning tasks including feature selection. Feature selection is essentially a dimensionality reduction problem that aims at two key objectives; to shorten the computational time and to improve classification accuracy. This paper attempts to address the issue of high computational time in feature selection by proposing a natural extension to the BA called the Bat Algorithm with Memory (BAM). This algorithm is inspired from observations that natural bats must rely upon spatial memory in navigating familiar spaces with dimensions larger than a few meters due to their limited biosonar operating range. Using the same approach, bats in existing BA is extended with memory capability to enable them to navigate easily over familiar locations. To evaluate the proposed algorithm, a series of experiments were carried out on twelve datasets with different number of objects and attributes. Next, the experimental results were compared with the original version of BA. The results showed that BAM was able to deliver competitive classification accuracy with increased saving time ranging from 28% up to 95%. The results also demonstrated that the time saving was attributed to three characteristics, which are samples number, feature number, and dataset geography. Consequently, BAM is also more efficient with lower number of features and higher number of samples.

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

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

M3 - Article

AN - SCOPUS:84941049439

VL - 79

SP - 65

EP - 75

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -