The rapid expansion of complex engineering and real-world optimization problems necessitates the development of efficient, adaptable, and computationally lightweight metaheuristic algorithms. In this study, a novel nature-inspired algorithm called glider snake optimization (GSO) is proposed, which draws behavioral inspiration from the gliding and serpentine locomotion patterns of arboreal snakes to enhance solution exploration and convergence control. The GSO algorithm incorporates a multi-segment movement mechanism, a flexible gliding path generator, and an elite guidance model to ensure effective balance between exploration and exploitation. Extensive experimental validation is conducted using a comprehensive set of 23 classical benchmark functions, high-dimensional test cases (100D, and 500D), the CEC 2019 benchmark suite, and several constrained engineering design problems. The results demonstrate that GSO outperforms or matches 13 state-of-the-art algorithms, including particle swarm optimization (PSO), grey wolf optimizer (GWO), whale optimization algorithm (WOA), and differential evolution (DE) in terms of accuracy, convergence speed, computational cost, and robustness. The algorithm also exhibits exceptional stability across parameter variations, as confirmed through sensitivity analysis and statistical significance testing. These findings highlight the potential of GSO as a powerful and efficient tool for solving complex optimization problems in both theoretical and practical domains. Additionally, GSO achieves leading performance on most benchmark functions, with error reductions of up to 90% compared with competing algorithms. GSO also demonstrates faster convergence and lower variance across repeated trials, confirming its robustness. These quantitative outcomes further reinforce the effectiveness of the proposed algorithm. The MATLAB and Python implementations of GSO are available at https://nimakhodadadi.com .

The Football Optimization Algorithm (FbOA) is introduced as a novel population-based metaheuristic optimization technique inspired by the dynamic strategies of a football team. Designed to address complex optimization problems characterized by high dimensionality, nonlinearity, and multiple local optima, FbOA draws on the strategic balance between exploration and exploitation observed in football gameplay. The algorithm mimics players’ tactical positioning and movement, incorporating short passes, long passes, and positional adjustments to explore and exploit the solution space effectively. This study comprehensively evaluates the performance of FbOA using benchmark functions from the CEC 2005 test suite with 30-dimensional and 100- dimensional optimization problems. The results demonstrate that FbOA outperforms several state-of-the-art metaheuristic algorithms regarding convergence speed, accuracy, and robustness. The findings suggest that FbOA offers a promising alternative for solving various optimization challenges across multiple fields.

Direct marketing strategies in the banking sector have undergone evolution with the integration of predictive analytics and machine learning techniques. The focus of this study is on the utilization of these technologies to foresee bank term deposit subscriptions. The methodology encompasses data exploration, visualization, and the implementation of machine learning models. Datasets from Kaggle are employed, relationships within the data are explored through crosstabulations and heat maps, and feature engineering and preprocessing techniques are applied. The study individually implements models such as SGD Classifier, k-nearest neighbor Classifier, and Random Forest Classifier. The results indicate that the best performance among the evaluated models was exhibited by the Random Forest Classifier, achieving an accuracy of 87.5%, a negative predictive value (NPV) of 92.9972%, and a positive predictive value (PPV) of 87.8307%. These findings provide valuable insights for banks seeking to optimize their marketing strategies within the dynamic landscape of the financial industry.

The feature selection area in data analytics is explored through a comprehensive literature review, and the increasing areas that have a data dependency problem and are being resolved with feature selection are highlighted. Review topics of this course cover the foundations to present use cases, for example, cybersecurity, healthcare, and finance. Particularly crucially for the healthcare domain, it reduces the dimensionality and elucidates complex causal links. The further investigation overlaps contemporary techniques, including optimization-based methods, swarm intelligence and algorithms for the diagnosis of heart diseases. The conclusion builds on the practical assessment and underlines research gaps, serving as a basis to set a diversified technological review. This also exhibits new techniques that have released their efficiency in classification environments, for example, hybrid Ant Colony Optimization and the Gray Wolf Optimizer. The ISSA algorithm stands out as a swarm intelligence technique that is best among others. The paper concludes by demonstrating that feature selection goes beyond the preprocessing stage, but it instead stands as a vital part of the fields of machine learning and data science and thus aids the researchers in both retrospective analysis and forthcoming projects.

The study considers the community of ”urban air quality improvement in modern cities” using an extensive dataset obtained from ”Air quality data of Delhi, India” for the period between 25 November 2020 and 24 January 2023. Research aims to significantly reduce air pollutants, including particulate matter, including PM2.5 and PM10, NO2, SO2, CO2, O3, and others. Different machine learning models are being used for airquality level forecasts. Among the models assessed, the Nearest Neighbors algorithm comes out on top and exhibits a very low Mean Squared Error (MSE) of 0.0002. The model’s superb precision is further supported by very low statistics in other key metrics, which confirm the Nearest Neighbors approach to forecasting the quality of air in urban zones. The Nearest Neighbors algorithm is shown to have its place in the application as a tool in the hands of researchers and decision-makers pursuing the fight against air pollution is also a signal of its efficiency and broad applicability. This modeling approach has thus the potential to first identify and later pinpoint localized empirical patterns and statistical dependencies from the data set. Its high predictive precision makes it a very valuable assistant to public health and environmental management, especially so in regions like Delhi.

Smart city development necessitates the implementation of effective traffic management strategies. In this vein, various deep learning architectures, including VGG16Net, VGG19Net, GoogLeNet, ResNet-50, and AlexNet, are employed to predict diverse traffic patterns extracted from a comprehensive dataset. Evaluating performance metrics such as accuracy, sensitivity, and specificity reveals discernible variations among models, with ResNet-50 and AlexNet demonstrating superior predictive capabilities. Descriptive statistics and statistical analyses, including ANOVA and the Wilcoxon Signed Rank Test, provide nuanced insights into model differences and significance. The findings bear significant implications for urban planners and policymakers transforming cities into intelligent ecosystems, offering valuable insights for informed decision-making in innovative city development. Improved traffic predictions enhance daily commuting experiences and contribute to the informed development of sustainable urban infrastructure, aligning seamlessly with the ongoing evolution of smart cities toward a more connected and efficient future. Notably, AlexNet exhibits a significant accuracy of 0.931780366 in the context of traffic pattern prediction.