Artificial Afterimage Algorithm: A New Bio-Inspired Metaheuristic Algorithm and Its Clustering Application
Source abstract
Abstract
Metaheuristic methods are optimization methods that look for different ways to converge to a solution to a problem where it is difficult to find a solution analytically. Their difference from known optimization methods is that they imitate living things or systems in nature. Each metaheuristic method has its equations, and the solution is found using these equations. In this study, a new, metaheuristic method called the afterimage algorithm is proposed. The proposed method was developed inspired by the fact that when we close our eyes after looking at a luminous image for a while, the vision still occurs in our minds. This is called an afterimage. The proposed method first pre-processes with the operator called afterimage and calculates the best and worst solution values. The visual angle value is then calculated, and new solutions are produced around this value. Three different datasets were used in experimental studies on data clustering. Accuracies of 96.66% for the iris plant dataset, 92% for the Wisconsin breast cancer dataset, and 95% for the occupancy detection dataset were obtained.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Metaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Software Engineering, Faculty of Engineering and Architecture, Muş Alparslan University, 49250 Muş, Türkiye
References (56)
Show source-provided references
1. Creosteanu, A., Gavrila, G., and Creosteanu, L. (2012, January 25–28). Comparison between an analytical method and two numerical methods on a given electrostatic potential determination problem. Proceedings of the 15 International Symposium on Antenna Technology and Applied Electromagnetics, Toulouse, France.10.1109/ANTEM.2012.6262310 ↗
2. Veri, Enformatik, Yapay Zeka ve Optimizasyon10.70447/ktve.2241 ↗
3. Comparison of Recent Meta-Heuristic Optimization Algorithms Using Different Benchmark Functions
4. An exhaustive review of the metaheuristic algorithms for search and optimization: Taxonomy, applications, and open challenges10.1007/s10462-023-10470-y ↗
5. Heuristic Clustering Based on Centroid Learning and Cognitive Feature Capturing10.1155/2019/1530618 ↗
6. A Novel Heuristic for Graph-Based Topic Modeling Using Spectral Clustering
7. Shaikh, M.S., Dong, X., Zheng, G., Wang, C., and Lin, Y. (2024). An Improved Expeditious Meta-Heuristic Clustering Method for Classifying Student Psychological Issues with Homogeneous Characteristics. Mathematics, 12.10.3390/math12111620 ↗
8. Tsai, C.-W., Song, H.-J., and Chiang, M.-C. (2012, January 14–17). A hyper-heuristic clustering algorithm. Proceedings of the 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Seoul, Republic of Korea.10.1109/ICSMC.2012.6378179 ↗
9. A heuristic for improving clustering in biomass supply chains
10. Lamari, Y. (2018). New Heuristics for Clustering Big Data. [Ph.D. Thesis, Faculty of Scineces, University Ibn Zohr].
11. Alam, M., and Sadaf, K. (2015). Web Search Result Clustering based on Heuristic Search and k-means. arXiv.
12. Bare-Bones Based Salp Swarm Algorithm for Text Document Clustering10.1109/ACCESS.2023.3314589 ↗
13. Schnoering, H., Porthaux, P., and Vazirgiannis, M. (2024). Assessing the Efficacy of Heuristic-Based Address Clustering for Bitcoin. arXiv.
14. A novel linear time clustering using heuristically improved mrk-medoids based on modified squirrel search algorithm10.1080/1448837X.2024.2333670 ↗
15. An optimized meta-heuristic clustering-based routing scheme for secured wireless sensor networks10.1002/dac.5791 ↗
16. An improved black hole algorithm designed for K-means clustering method10.1007/s40747-024-01420-4 ↗
17. SBOA: A Novel Heuristic Optimization Algorithm10.21123/bsj.2024.9766 ↗
18. A New Heuristic Algorithm Based on Minimum Spanning Tree for Solving Metric Traveling Salesman Problem
19. GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets
20. Learning search algorithm: Framework and comprehensive performance for solving optimization problems10.1007/s10462-024-10767-6 ↗
21. Nemati, M., Zandi, Y., and Agdas, A.S. (2024). Application of a novel metaheuristic algorithm inspired by stadium spectators in global optimization problems. Sci. Rep., 14.10.1038/s41598-024-53602-2 ↗
22. A Novel Meta-Heuristic Algorithm for Numerical and Engineering Optimization Problems: Piranha Foraging Optimization Algorithm (PFOA)10.1109/ACCESS.2023.3267110 ↗
23. A hybrid model of heuristic algorithm and gradient descent to optimize neural networks
24. Heuristic Simulated Annealing Modeling to Optimum Target Audience Identification in Digital Marketing: A Case Study of a Mining Industry Training Service Company
25. Elite Opposition-Based Bare Bones Mayfly Algorithm for Optimization Wireless Sensor Networks Coverage Problem10.1007/s13369-024-08899-6 ↗
26. Black-winged kite algorithm: A nature-inspired meta-heuristic for solving benchmark functions and engineering problems10.1007/s10462-024-10723-4 ↗
27. Amiri, M.H., Hashjin, N.M., Montazeri, M., Mirjalili, S., and Khodadadi, N. (2024). Hippopotamus optimization algorithm: A novel nature-inspired optimization algorithm. Sci. Rep., 14.10.1038/s41598-024-54910-3 ↗
28. Special Forces Algorithm: A novel meta-heuristic method for global optimization10.1016/j.matcom.2023.06.015 ↗
29. Trojovský, P., and Dehghani, M. (2023). A new bio-inspired metaheuristic algorithm for solving optimization problems based on walruses behavior. Sci. Rep., 13.10.1038/s41598-023-35863-5 ↗
30. EOSMA: An equilibrium optimizer slime mould algorithm for engineering design problems10.1007/s13369-021-06513-7 ↗
31. Palinopsia10.1093/brain/91.2.321 ↗
32. Palinopsia revamped: A systematic review of the literatüre10.1016/j.survophthal.2014.06.003 ↗
33. Lőrinc, G., and András, H. (2023). Analyzing afterimage strength and duration test results with k-means clustering. Szemelvények a BGE Kutatásaiból II. Kötet, Budapesti Gazdasági Egyetem.
34. Lee, H.C. (2005). Introduction to Color Imaging Science, Cambridge University Press.10.1017/CBO9780511614392 ↗
35. Neural locus of color afterimages10.1016/j.cub.2011.12.021 ↗
36. (2024, November 20). Visual Angle-Wikipedia. Available online: https://en.wikipedia.org/wiki/Visual_angle.
37. Yakovyna, V., Shakhovska, N., and Szpakowska, A. (2024). A novel hybrid supervised and unsupervised hierarchical ensemble for COVID-19 cases and mortality prediction. Sci. Rep., 14.10.1038/s41598-024-60637-y ↗
38. Some Clustering Methods, Algorithms and their Applications10.17762/ijritcc.v11i6s.6946 ↗
39. Çatak, F.Ö. (2014). Development of Data Mining Software Framework by Using Map/Reduce Method in Cloud Computing Systems. [Ph.D. Thesis, İstanbul University Institute of Science, Department of Electronics, Informatics Program].
40. Do all roads lead to Rome? Studying distance measures in the context of machine learning10.1016/j.patcog.2023.109646 ↗
41. Performance comparison machine learning algorithms in diabetes disease prediction10.26701/ems.1335503 ↗
42. (2024, November 25). Iris–UCI Machine Learning Repository. Available online: https://archive.ics.uci.edu/dataset/53/iris.
43. (2024, November 25). Occupancy Detection-UCI Machine Learning Repository. Available online: https://archive.ics.uci.edu/dataset/357/occupancy+detection.
44. (2024, November 25). Breast Cancer Wisconsin (Original)-UCI Machine Learning Repository. Available online: https://archive.ics.uci.edu/dataset/15/breast+cancer+wisconsin+original.
45. Black Hole Clustering: Gravity-Based Approach with No Predetermined Parameters10.5334/dsj-2024-027 ↗
46. A Nature-Inspired Hybrid Partitional Clustering Method Based on Grey Wolf Optimization and Jaya Algorithm10.7494/csci.2023.24.3.4962 ↗
47. Optimizing K-Means Clustering using the Artificial Firefly Algorithm
48. Comparative Study of Clustering Techniques in Iris Data Sets
49. Huang, X., and Gel, Y.R. (2017, January 18–21). CRAD: Clustering with Robust Autocuts and Depth. Proceedings of the IEEE International Conference on Data Mining, New Orleans, LA, USA.10.1109/ICDM.2017.116 ↗
50. Breast Cancer Diagnosis Using K-means Methodology
51. Analysis of k-means clustering approach on the breast cancer Wisconsin dataset10.1007/s11548-016-1437-9 ↗
52. Cluster Analysis of Wisconsin Breast Cancer Dataset Using Self-Organizing Maps
53. Ubiquitous multi-occupant detection in smart environments
54. Explainable K-Means Clustering for Occupancy Estimation10.1016/j.procs.2022.07.041 ↗
55. Şen, A., and Gökgöz, T. (2013, January 14–17). Kümelemede Normalleştirmenin Etkisi. Proceedings of the TMMOB Harita ve Kadastro Mühendisleri Odası, 14. Türkiye Harita Bilimsel ve Teknik Kurultayı, Ankara, Turkey.
56. Can, A. (2019). SPSS ile Bilimsel Araştırma Sürecinde Nicel Veri Analizi, Pegem Akademi. [7th ed.].