Search

Abstract The global interest in market prediction has driven the adoption of advanced technologies beyond traditional statistical models. This paper explores the use of machine learning and deep learning techniques for stock market forecasting. We propose a comprehensive approach that includes efficient feature selection, data preprocessing, and classification methodologies. The wavelet transform method is employed for data cleaning and noise reduction. Feature selection is optimized using the Dandelion Optimization Algorithm (DOA), identifying the most relevant input features. A novel hybrid model, 3D-CNN-GRU, integrating a 3D convolutional neural network with a gated recurrent unit, is developed for stock market data analysis. Hyperparameter tuning is facilitated by the Blood Coagulation Algorithm (BCA), enhancing model performance. Our methodology achieves a remarkable prediction accuracy of 99.14%, demonstrating robustness and efficacy in stock market forecasting applications. While our model shows significant promise, it is limited by the scope of the dataset, which includes only the Nifty 50 index. Broader implications of this work suggest that incorporating additional datasets and exploring different market scenarios could further validate and enhance the model's applicability. Future research could focus on implementing this approach in varied financial contexts to ensure robustness and generalizability.

The global interest in market prediction has driven the adoption of advanced technologies beyond traditional statistical models. This paper explores the use of machine learning and deep learning techniques for stock market forecasting. We propose a comprehensive approach that includes efficient feature selection, data preprocessing, and classification methodologies. The wavelet transform method is employed for data cleaning and noise reduction. Feature selection is optimized using the Dandelion Optimization Algorithm (DOA), identifying the most relevant input features. A novel hybrid model, 3D-CNN-GRU, integrating a 3D convolutional neural network with a gated recurrent unit, is developed for stock market data analysis. Hyperparameter tuning is facilitated by the Blood Coagulation Algorithm (BCA), enhancing model performance. Our methodology achieves a remarkable prediction accuracy of 99.14%, demonstrating robustness and efficacy in stock market forecasting applications. While our model shows significant promise, it is limited by the scope of the dataset, which includes only the Nifty 50 index. Broader implications of this work suggest that incorporating additional datasets and exploring different market scenarios could further validate and enhance the model's applicability. Future research could focus on implementing this approach in varied financial contexts to ensure robustness and generalizability. [ABSTRACT FROM AUTHOR]

This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical indicators. A lower SLL can improve the signal-to-noise ratio and reduce the impact of clutter signals outside the main beam. Deep nulls need to be aligned with the direction of interference to eliminate the influence of interference sources. The combination of the two can effectively improve the anti-interference ability of the entire system. Therefore, antenna arrays with ultra-low sidelobes and ultra-deep nulls are currently hot in the field of antenna array design and are also some of the key technologies needed to achieve modern high-performance radar systems. As a new type of evolutionary algorithm inspired by nature, the DO algorithm is inspired by the wind propagation behavior of dandelions in nature. This algorithm iteratively updates the population from three stages of ascent, descent, and landing, ultimately finding the optimal position. It has good optimization ability in solving complex problems such as those involving nonlinearity, discreteness, and non-convexity, and the antenna array pattern synthesis optimization problem belongs to multivariate nonlinear problems. Therefore, the DO algorithm can be effectively applied in the field of antenna array optimization. In this work, we use the following method to obtain an optimized pattern of a linear array with the lowest sidelobe level (SLL), null placement in particular directions, and a lower notch in particular directions: by controlling the antenna array's element spacing and leaving the phase unchanged to optimize the current amplitudes and by controlling the excitation current and phase fixation of the antenna array and changing the element spacing. In the first and second examples, different algorithms are used to reduce the SLL of the antenna. In the first example, the DO algorithm reduces the SLL to −33.37 dB, which is 2.67 dB, 2.67 dB, 3.77 dB, 2.74 dB, and 2.52 dB lower than five other algorithms. In the second example, the SLL optimized by the DO algorithm is −42.56 dB, which is 5.04 dB and 1.48 dB lower than two other algorithms. In both examples, the DO algorithm reduces the SLL lower than other algorithms when the main lobe of the antenna is not significantly widened. Examples 3, 4, and 5 use the DO algorithm to optimize the amplitude of the current, generating deep nulls and deep notches in specific directions. In Example 3, the DO algorithm obtains a depth of nulls equal to −187.6 dB, which is 66.7 dB and 44.3 dB lower than that of the flower pollination algorithm (FPA) and the chaotic colony predation algorithm (CCPA), respectively. In Example 4, the deep null obtained by the DO algorithm is as low as −98.69 dB, which is 6.67 dB lower than the deep null obtained by the grey wolf optimization (GWO) algorithm. In Example 5, the deep notch obtained by the DO algorithm is as low as −63.1 dB, which is 6.4 dB and 1.9 dB lower than the spider monkey optimization (SMO) algorithm and the grasshopper optimization algorithm (GOA), respectively. The data prove that the DO algorithm produces deeper nulls and notches than other algorithms. The last two examples involve reducing sidelobe levels and generating deep nulls by optimizing the spacing between elements. In Example 5, the SLL obtained using the DO algorithm is −22.8766 dB, which is 0.1998 dB lower than the lowest SLL of −22.6768 dB among other algorithms. In Example 6, the SLL obtained using the DO algorithm is −20.1012 dB, and the null depth is −125.1 dB, which is 1.592 dB lower than the SLL obtained by the cat swarm optimization (CSO) algorithm and 19.1 dB lower than the deep null obtained by the GWO algorithm, respectively. In summary, the results of six simulation experiments indicate that the DO algorithm has better optimization ability in linear array optimization than other evolutionary algorithms. [ABSTRACT FROM AUTHOR]

In the context of complex structures and blurred cell boundaries present in breast cancer histopathological tissue images under a microscope, traditional thresholding methods struggle to accurately separate lesion areas in breast cancer image segmentation. To address this challenge, we propose a multi-threshold segmentation method for breast cancer images based on an improved Dandelion Optimization algorithm. This approach incorporates the concept of opposite-based learning and utilizes the improved Dandelion Optimization algorithm to calculate the maximum between-class variance as the optimization objective. Moreover, the method establishes fallback strategies and incorporates a memory matrix, while leveraging the golden jackal energy judgment mechanism to identify optimal thresholds. The experimental results show that compared with the Crow search algorithm, Harris Hawks optimization algorithm, artificial gorilla troop optimization algorithm, dandelion optimization algorithm, ocean predator algorithm, whale optimization algorithm, sparrow search algorithm, and sine cosine algorithm, and the improved Dandelion optimization algorithm achieves the highest fitness value and converges at the fastest speed when using the same threshold number, it also occupies an advantageous position in terms of peak signal-to-noise ratio, structural similarity index, feature similarity index, and mean square error. [ABSTRACT FROM AUTHOR]

To improve the tracking accuracy of moving targets in Non-Line-of-Sight (NLOS) environments and reduce positioning errors, a hybrid TDOA/AOA positioning method is proposed using the Time Difference of Arrival (TDOA) and Angle of Arrival (AOA) joint localization. The method is based on an improved multi-objective dandelion optimization algorithm. In the optimization process of the fitness function for the positioning model using the dandelion optimization algorithm, a fast non-dominated sorting method is used to determine the core dandelions, and an approximation ideal solution sorting method is employed to achieve global optimization, thereby enhancing the speed and accuracy of the model solution. By introducing a multi-objective mechanism, the optimal individual of one population guides another population, accelerating the convergence speed, balancing the exploration and exploitation abilities to a certain extent, and enhancing the optimization performance. Simulation results show that compared to TDOA/AOA, Taylor, Chan, PSO, and DOA algorithms, the proposed algorithm outperforms TDOA/AOA algorithm and other similar algorithms. The algorithm exhibits excellent performance in terms of node positioning accuracy, convergence speed, and robustness. [ABSTRACT FROM AUTHOR]

This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical indicators. A lower SLL can improve the signal-to-noise ratio and reduce the impact of clutter signals outside the main beam. Deep nulls need to be aligned with the direction of interference to eliminate the influence of interference sources. The combination of the two can effectively improve the anti-interference ability of the entire system. Therefore, antenna arrays with ultra-low sidelobes and ultra-deep nulls are currently hot in the field of antenna array design and are also some of the key technologies needed to achieve modern high-performance radar systems. As a new type of evolutionary algorithm inspired by nature, the DO algorithm is inspired by the wind propagation behavior of dandelions in nature. This algorithm iteratively updates the population from three stages of ascent, descent, and landing, ultimately finding the optimal position. It has good optimization ability in solving complex problems such as those involving nonlinearity, discreteness, and non-convexity, and the antenna array pattern synthesis optimization problem belongs to multivariate nonlinear problems. Therefore, the DO algorithm can be effectively applied in the field of antenna array optimization. In this work, we use the following method to obtain an optimized pattern of a linear array with the lowest sidelobe level (SLL), null placement in particular directions, and a lower notch in particular directions: by controlling the antenna array’s element spacing and leaving the phase unchanged to optimize the current amplitudes and by controlling the excitation current and phase fixation of the antenna array and changing the element spacing. In the first and second examples, different algorithms are used to reduce the SLL of the antenna. In the first example, the DO algorithm reduces the SLL to −33.37 dB, which is 2.67 dB, 2.67 dB, 3.77 dB, 2.74 dB, and 2.52 dB lower than five other algorithms. In the second example, the SLL optimized by the DO algorithm is −42.56 dB, which is 5.04 dB and 1.48 dB lower than two other algorithms. In both examples, the DO algorithm reduces the SLL lower than other algorithms when the main lobe of the antenna is not significantly widened. Examples 3, 4, and 5 use the DO algorithm to optimize the amplitude of the current, generating deep nulls and deep notches in specific directions. In Example 3, the DO algorithm obtains a depth of nulls equal to −187.6 dB, which is 66.7 dB and 44.3 dB lower than that of the flower pollination algorithm (FPA) and the chaotic colony predation algorithm (CCPA), respectively. In Example 4, the deep null obtained by the DO algorithm is as low as −98.69 dB, which is 6.67 dB lower than the deep null obtained by the grey wolf optimization (GWO) algorithm. In Example 5, the deep notch obtained by the DO algorithm is as low as −63.1 dB, which is 6.4 dB and 1.9 dB lower than the spider monkey optimization (SMO) algorithm and the grasshopper optimization algorithm (GOA), respectively. The data prove that the DO algorithm produces deeper nulls and notches than other algorithms. The last two examples involve reducing sidelobe levels and generating deep nulls by optimizing the spacing between elements. In Example 5, the SLL obtained using the DO algorithm is −22.8766 dB, which is 0.1998 dB lower than the lowest SLL of −22.6768 dB among other algorithms. In Example 6, the SLL obtained using the DO algorithm is −20.1012 dB, and the null depth is −125.1 dB, which is 1.592 dB lower than the SLL obtained by the cat swarm optimization (CSO) algorithm and 19.1 dB lower than the deep null obtained by the GWO algorithm, respectively. In summary, the results of six simulation experiments indicate that the DO algorithm has better optimization ability in linear array optimization than other evolutionary algorithms.

With the increasing demand for electrical energy and the challenges related to its production, along with the need to be environmentally friendly to achieve sustainability for future generations, proton exchange membrane fuel cells (PEMFCs) are emerging as a clean energy source that can effectively replace conventional energy sources, in various fields of application and especially in the field of transportation exploiting electric vehicles (EVs). To improve the development and control of the PEMFCs, the precise determination of its mathematical model remains an essential task. Indeed, the accuracy of such a model depends on the ability to overcome the constraints associated with the nonlinearity and the numerous involved unknown parameters. The present paper proposes a new Dandelion Optimizer (DO) to accurately identify, for the first time, the parameters of the PEMFC model. The DO addresses the weaknesses of the majority of metaheuristic algorithms related to the self-adaptation of parameters, the stagnation of convergence to local minima, and the ability to refer to the whole population. The high ability of the proposed method is investigated using both steady-state and dynamic situations. The DO-based parameters estimation approach has been assessed through a specific comparative study with the most recently published techniques including GWO, GBO, HHO, IAEO, VSDE, and ABCDESC is performed using two typical PEMFC modules, namely 250 W PEMFC and NedStack PS6. The results obtained proved that the proposed approach obtained promising achievements and better performances comparatively with well-recognized and competitive methods. [ABSTRACT FROM AUTHOR]

With the increasing demand for electrical energy and the challenges related to its production, along with the need to be environmentally friendly to achieve sustainability for future generations, proton exchange membrane fuel cells (PEMFCs) are emerging as a clean energy source that can effectively replace conventional energy sources, in various fields of application and especially in the field of transportation exploiting electric vehicles (EVs). To improve the development and control of the PEMFCs, the precise determination of its mathematical model remains an essential task. Indeed, the accuracy of such a model depends on the ability to overcome the constraints associated with the nonlinearity and the numerous involved unknown parameters. The present paper proposes a new Dandelion Optimizer (DO) to accurately identify, for the first time, the parameters of the PEMFC model. The DO addresses the weaknesses of the majority of metaheuristic algorithms related to the self-adaptation of parameters, the stagnation of convergence to local minima, and the ability to refer to the whole population. The high ability of the proposed method is investigated using both steady-state and dynamic situations. The DO-based parameters estimation approach has been assessed through a specific comparative study with the most recently published techniques including GWO, GBO, HHO, IAEO, VSDE, and ABCDESC is performed using two typical PEMFC modules, namely 250 W PEMFC and NedStack PS6. The results obtained proved that the proposed approach obtained promising achievements and better performances comparatively with well-recognized and competitive methods.