This paper proposes a new meta-heuristic optimization algorithm, namely Mud Ring Algorithm (MRA) that mimics the mud ring feeding behaviour of bottlenose dolphins in Atlantic coast of Florida. The inspiration of MRA is mainly based on the foraging behaviour of bottlenose dolphins and their mud ring feeding strategy. This strategy is applied by dolphins to trap fish via creating a plume by a single dolphin moving his tail swiftly in the sand and swims around the group of fish. The fishes become disoriented and jump over the surface only to find the waiting mouths of dolphins. MRA optimization algorithm mathematically simulates this feeding strategy and proves its optimization effectiveness through a comprehensive comparison with other meta-heuristic algorithms. Twenty-nine benchmark functions and four commonly used benchmark engineering challenges are used in the comparison. The statistical comparisons and results prove that the proposed MRA has the superiority in dealing with these optimization problems and can obtain the best solutions than other meta-heuristic optimizers.

This systematic review comprehensively examines the application and impacts of Educational Data Mining (EDM) over the past decade. It explores the use of various data mining tools and techniques, statistics, and machine learning algorithms in education. The review discusses how EDM helps understand and improve the learning experience, educational strategies, and institutional efficiency. It highlights the iterative process of EDM, its applications, and the benefits it offers to different stakeholders, including students, teachers, and educational institutions. The paper also discusses the challenges related to data ethics, privacy, and security in EDM. Key sections include a methodology for conducting the systematic review, exploring different data mining techniques and learning styles, and using Artificial Intelligence in EDM. The review concludes with a discussion of findings, future research directions, and a summary of the study’s contributions and limitations.

Feature selection plays a crucial role in order to mitigate the high dimensional feature space in different classification problems. The computational cost is reduced, and the accuracy of the classification is improved by reducing the dimension of feature space. Hence, in the classification task, finding the optimal subset of features is of utmost importance. Metaheuristic techniques have proved their efficacy in solving many real-world optimization issues. One of the recently introduced physics-inspired optimization methods is Archimedes Optimization Algorithm (AOA). This paper proposes an Enhanced Archimedes Optimization Algorithm (EAOA) by adding a new parameter that depends on the step length of each individual while revising the individual location. The EAOA algorithm is proposed to improve the AOA exploration and exploitation balance and enhance the classification performance for the feature selection issue in real-world data sets. Experiments were performed on twenty-three standard benchmark functions and sixteen real-world data sets to investigate the performance of the proposed EAOA algorithm. The experimental results based on the standard benchmark functions show that the EAOA algorithm provides very competitive results compared to the basic AOA algorithm and five well-known optimization algorithms in terms of improved exploitation, exploration, local optima avoidance and convergence rate. In addition, the results based on sixteen real-world data sets ascertain that reduced feature subset yields higher classification performance when compared with the other feature selection methods.

Instance reduction is a pre-processing step devised to improve the task of classification. Instance reduction algorithms search for a reduced set of instances to mitigate the low computational efficiency and high storage requirements. Hence, finding the optimal subset of instances is of utmost importance. Metaheuristic techniques are used to search for the optimal subset of instances as a potential application. Antlion optimization (ALO) is a recent metaheuristic algorithm that simulates antlion’s foraging performance in finding and attacking ants. However, the ALO algorithm suffers from local optima stagnation and slow convergence speed for some optimization problems. In this study, a new modified antlion optimization (MALO) algorithm is recommended to improve the primary ALO performance by adding a new parameter that depends on the step length of each ant while revising the antlion position. Furthermore, the suggested MALO algorithm is adapted to the challenge of instance reduction to obtain better results in terms of many metrics. The results based on twenty-three benchmark functions at 500 iterations and thirteen benchmark functions at 1000 iterations demonstrate that the proposed MALO algorithm escapes the local optima and provides a better convergence rate as compared to the basic ALO algorithm and some well-known and recent optimization algorithms. In addition, the results based on 15 balanced and imbalanced datasets and 18 oversampled imbalanced datasets show that the instance reduction proposed method can statistically outperform the basic ALO algorithm and has strong competitiveness against other comparative algorithms in terms of four performance measures: Accuracy, Balanced Accuracy (BACC), Geometric mean (G-mean), and Area Under the Curve (AUC) in addition to the run time. MALO algorithm results show increment in Accuracy, BACC, G-mean, and AUC rates up to 7%, 3%, 15%, and 9%, respectively, for some datasets over the basic ALO algorithm while keeping less computational time.