Search Results (4)

The high dimensionality of large datasets can severely impact the data mining process. Therefore, feature selection becomes an essential preprocessing stage, aimed at reducing the dimensionality of the dataset by selecting the most informative features while improving classification accuracy. This paper proposes a novel binary Gray Wolf Optimization algorithm to address the feature selection problem in classification tasks. Firstly, the historical optimal position of the search agent helps explore more promising areas. Therefore, by linearly combining the best positions of the search agents, the algorithm’s exploration capability is increased, thus enhancing its global development ability. Secondly, the novel quadratic interpolation technique, which integrates population diversity with local exploitation, helps improve both the diversity of the population and the convergence accuracy. Thirdly, chaotic perturbations (small random fluctuations) applied to the convergence factor during the exploration phase further help avoid premature convergence and promote exploration of the search space. Finally, a novel transfer function processes feature information differently at various stages, enabling the algorithm to search and optimize effectively in the binary space, thereby selecting the optimal feature subset. The proposed method employs a k-nearest neighbor classifier and evaluates performance through 10-fold cross-validation across 32 datasets. Experimental results, compared with other advanced algorithms, demonstrate the effectiveness of the proposed algorithm. Full article

The fast growth of the Internet has made network security problems more noticeable, so intrusion detection systems (IDSs) have become a crucial tool for maintaining network security. IDSs guarantee the normal operation of the network by tracking network traffic and spotting possible assaults, thereby safeguarding data security. However, traditional intrusion detection methods encounter several issues such as low detection efficiency and prolonged detection time when dealing with massive and high-dimensional data. Therefore, feature selection (FS) is particularly important in IDSs. By selecting the most representative features, it can not only improve the detection accuracy but also significantly reduce the computational complexity and attack detection time. This work proposes a new FS approach, BPSO-SA, that is based on the Binary Particle Swarm Optimization (BPSO) and Simulated Annealing (SA) algorithms. It combines these with the Gray Wolf Optimization (GWO) algorithm to optimize the LightGBM model, thereby building a new type of reflective Distributed Denial of Service (DDoS) attack detection model. The BPSO-SA algorithm enhances the global search capability of Particle Swarm Optimization (PSO) using the SA mechanism and effectively screens out the optimal feature subset; the GWO algorithm optimizes the hyperparameters of LightGBM by simulating the group hunting behavior of gray wolves to enhance the detection performance of the model. While showing great resilience and generalizing power, the experimental results show that the proposed reflective DDoS attack detection model surpasses conventional methods in terms of detection accuracy, precision, recall, F1-score, and prediction time. Full article

Predicting particulate matter with a diameter of 10 μm (PM10) is crucial due to its impact on human health and the environment. Today, aerosol optical depth (AOD) offers high resolution and wide coverage, making it a viable way to estimate PM concentrations. Recent years have also witnessed in-creasing promise in refining air quality predictions via deep neural network (DNN) models, out-performing other techniques. However, learning the weights and biases of the DNN is a task classified as an NP-hard problem. Current approaches such as gradient-based methods exhibit significant limitations, such as the risk of becoming ensnared in local minimal within multi-objective loss functions, substantial computational requirements, and the requirement for continuous objective functions. To tackle these challenges, this paper introduces a novel approach that combines the binary gray wolf optimizer (BGWO) with DNN to improve the optimization of models for air pollution prediction. The BGWO algorithm, inspired by the behavior of gray wolves, is used to optimize both the weight and bias of the DNN. In the proposed BGWO, a novel sigmoid function is proposed as a transfer function to adjust the position of the wolves. This study gathers meteorological data, topographic information, PM10 pollution data, and satellite images. Data preparation includes tasks such as noise removal and handling missing data. The proposed approach is evaluated through cross-validation using metrics such as correlation rate, R square, root-mean-square error (RMSE), and accuracy. The effectiveness of the BGWO-DNN framework is compared to seven other machine learning (ML) models. The experimental evaluation of the BGWO-DNN method using air pollution data shows its superior performance compared with traditional ML techniques. The BGWO-DNN, CapSA-DNN, and BBO-DNN models achieved the lowest RMSE values of 16.28, 19.26, and 20.74, respectively. Conversely, the SVM-Linear and GBM algorithms displayed the highest levels of error, yielding RMSE values of 36.82 and 32.50, respectively. The BGWO-DNN algorithm secured the highest R² (88.21%) and accuracy (93.17%) values, signifying its superior performance compared with other models. Additionally, the correlation between predicted and actual values shows that the proposed model surpasses the performance of other ML techniques. This paper also observes relatively stable pollution levels during spring and summer, contrasting with significant fluctuations during autumn and winter. Full article

Feature selection is a widely utilized technique in educational data mining that aims to simplify and reduce the computational burden associated with data analysis. However, previous studies have overlooked the high costs involved in acquiring certain types of educational data. In this study, we investigate the application of a multi-objective gray wolf optimizer (GWO) with cost-sensitive feature selection to predict students’ academic performance in college English, while minimizing both prediction error and feature cost. To improve the performance of the multi-objective binary GWO, a novel position update method and a selection mechanism for a, b, and d are proposed. Additionally, the adaptive mutation of Pareto optimal solutions improves convergence and avoids falling into local traps. The repairing technique of duplicate solutions expands population diversity and reduces feature cost. Experiments using UCI datasets demonstrate that the proposed algorithm outperforms existing state-of-the-art algorithms in hypervolume (HV), inverted generational distance (IGD), and Pareto optimal solutions. Finally, when predicting the academic performance of students in college English, the superiority of the proposed algorithm is again confirmed, as well as its acquisition of key features that impact cost-sensitive feature selection. Full article