SavedAdd your journal

Journals / Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi / 2020 / Cilt: 24 - Sayı: 1

A Locally Searched Binary Artificial Bee Colony Algorithm Based on Hamming Distance for Binary Optimization

Zeynep Banu ÖZGER
BÜLENT BOLAT
Banu DİRİ
Pages
120–131
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results proved that the increased local search ability improves the performance of the algorithm for all criteria.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Artificial Bee Colony is a population based, bio-inspired optimization algorithm that developed for continues problems.
📊
Key Findings & Data:With a re-population strategy, the diversity of the population is increased and premature convergence is prevented.
💡
Conclusion & Impact:The results proved that the increased local search ability improves the performance of the algorithm for all criteria.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Özet

Artificial Bee Colony is a population based, bio-inspired optimization algorithm that developed for continues problems. The aim of this study is to develop a binary version of the Artificial Bee Colony (ABC) Algorithm to solve feature subset selection problem on bigger data. ABC Algorithm, has good global search capability but there is a lack of local search in the algorithm. To overcome this problem,the neighbor selection mechanism in the employed bee phase is improved by changing the new source generation formula that has hamming distance based local search capacity. With a re-population strategy, the diversity of the population is increased and premature convergence is prevented. To measure the effectiveness of the proposed algorithm, fourteen datasets which have more than 100 features were selected from UCI Machine Learning Repository and processed by the proposed algorithm. The performance of the proposed algorithm was compared to three well-known algorithms in terms of classification error, feature size and computation time. The results proved that the increased local search ability improves the performance of the algorithm for all criteria.

🔖

Cite This Article

ÖZGER, Z. B., BOLAT, B., DİRİ, B. (2020). A Locally Searched Binary Artificial Bee Colony Algorithm Based on Hamming Distance for Binary Optimization. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Cilt: 24 - Sayı: 1, 120–131. https://ajindex.com/articles/309894

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (3)

  1. Guyon, I., Elisseeff, A. 2013. An Introduction to Variable and Feature Selection. Journal of Machine Learning Research, 3, 1157–1182. [2]Sánchez-Maroño, N., Alonso-Betanzos, A., Tombilla-Sanromán, M.2007.Filter Methods for Feature Selection: a Comparative Study. I Proceedings of the 8th International Conference on Intelligent Data Engineering and Automated Learning, December, Berlin, Heidelberg, 178–187. [3]Kohavi, R., John, G. H.1997. Wrappers for Feature Subset Selection.Artificial Intelligence, 1-2, 273-324. [4]Unler, A., Murat, A. 2010. A Discrete Particle Swarm Optimization Method for Feature Selection in Binary Classification Problems. European Journal of Operational Research, 206(3), 528-539. [5]Cervante, L., Xue, B., Shang, L., Zhang, M. 2012. A Dimension Reduction Approach to Classification Based on Particle Swarm Optimisation and Rough Set Theory.Advances in Artificial Intelligence, 1 st ed., Springer, Berlin, Heidelberg, 313–325. [6]Cervante, L., Xue, B., Shang, L., Zhang, M. 2013. A Multi-Objective Feature Selection Approach Based on Binary Pso and Rough Set Theory. Evolutionary Computation in Combinatorial Optimization, 7832, 25–36. [7]Yang, J., Honavar, V.G. 1998. Feature Subset Selection Using a Genetic Algorithm. IEEE Intelligent System, 13(2), 44–49. [8]Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., Jain, A. K. 2000. Dimensionality Reduction Using Genetic Algorithms. IEEE Transactions on Evolutionary Computation,4(2), 164–171. [9]Ahmed, S., Zhang, M., Peng, L. 2014. Improving Feature Ranking for Biomarker Discovery in Proteomics Mass Spectrometry Data Using Genetic Programming. Connection Science, 26(3), 215–243. [10]Nemati, S., Basiri, M. E., Ghasem-Aghaee, N., Aghdam, M.H. 2009. A Novel ACO-GAHybrid Algorithm for Feature Selection in Protein Function Prediction. Expert System Application, 36(10), 12086–12094. [11]Wen, L., Yin, Q., Guo, P. 2008. Ant Colony Optimization Algorithm for Feature Selection and Classification of Multispectral Remote Sensing Image. IEEE International Geoscience and Remote Sensing Symposium (IGARSS2008), 7-11
  2. July, Boston, USA, 923-926. [12]Jensen, R. 2006. Performing Feature Selection with ACO. Swarm Intelligence in Data Mining, Springer, Berlin, Heidelberg,45-73. [13]Nakamura, R., Pereira, L., Costa, K., Rodrigues, D., Papa, J. 2012. BBA: a Binary Bat Algorithm for Feature Selection. Conference on Graphics, Patterns and Images, 22–25
  3. Aug, Ouro Preto, 291-297. [14]Oduntana, I. O., Toulouse, M., Baum