Fully Elman Neural Network: A Novel Deep Recurrent Neural Network Optimized by an Improved Harris Hawks Algorithm for Classification of Pulmonary Arterial Wedge Pressure

Regional economic forecast using Elman neural networks with wavelet function

Recently, the economy in Guangdong province has ranked first in the country, maintaining a good growth momentum. The prediction of Gross Domestic Product (GDP) for Guangdong province is an important issue. Through predicting the GDP, it is possible to analyze whether the economy in Guangdong province can maintain high-quality growth. Hence, to accurately forecast the economy in Guangdong, this paper proposed an Elman neural network combining with wavelet function. The wavelet function not only stimulates the forecast ability of Elman neural network, but also improves the convergence speed of Elman neural network. Experimental results indicate that our model has good forecast ability of regional economy, and the forecast accuracy reach 0.971. In terms of forecast precision and errors, our model defeats the competitors. Moreover, our model gains advanced forecast results to both individual economic indicator and multiple economic indicators. This means that our model is independently of specific scenarios in regional economic forecast. We also find that the investment in education has a major positive impact on regional economic development in Guangdong province, and the both surges positive correlation. Experimental results also show that our model does not exhibit exponential training time with the augmenting of data volume. Consequently, we propose that our model is suitable for the prediction of large-scale datasets. Additionally, we demonstrate that using wavelet function gains more profits than using complex network architectures in forecast accuracy and training cost. Moreover, using wavelet function can simplify the designs of complexity network architectures, reducing the training parameter of neural networks.

Enhanced Harris hawks optimization-based fuzzy k-nearest neighbor algorithm for diagnosis of Alzheimer's disease

In order to stop deterioration and give patients with Alzheimer's disease (AD) early therapy, it is crucial to correctly diagnose AD and its early stage, mild cognitive impairment (MCI). A framework for diagnosing AD is presented in this paper, which includes magnetic resonance imaging (MRI) image preprocessing, feature extraction, and the Fuzzy k-nearest neighbor algorithm (FKNN) model. In particular, the framework's novelty lies in the use of an improved Harris Hawks Optimization (HHO) algorithm named SSFSHHO, which integrates the Sobol sequence and Stochastic Fractal Search (SFS) mechanisms for optimizing the parameters of FKNN. The HHO method improves the quality of the initial population overall by incorporating the Sobol sequence, and the SFS mechanism increases the algorithm's capacity to get out of the local optimum solution. Comparisons with other classical meta-heuristic algorithms, state-of-the-art HHO variants in low and high dimensions, and enhanced meta-heuristic algorithms on 30 typical IEEE CEC2014 benchmark test problems show that the overall performance of SSFSHHO is significantly better than other comparative algorithms. Moreover, the created framework based on the SSFSHHO-FKNN model is employed to classify AD and MCI using MRI scans from the ADNI dataset, achieving high classification performance for 6 representative cases. Experimental findings indicate that the proposed algorithm performs better than a number of high-performance optimization algorithms and classical machine learning algorithms, thus offering a promising approach for AD classification. Additionally, the proposed strategy can successfully identify relevant features and enhance classification performance for AD diagnosis.

Application of Meta-Heuristic Algorithms for Training Neural Networks and Deep Learning Architectures: A Comprehensive Review

The learning process and hyper-parameter optimization of artificial neural networks (ANNs) and deep learning (DL) architectures is considered one of the most challenging machine learning problems. Several past studies have used gradient-based back propagation methods to train DL architectures. However, gradient-based methods have major drawbacks such as stucking at local minimums in multi-objective cost functions, expensive execution time due to calculating gradient information with thousands of iterations and needing the cost functions to be continuous. Since training the ANNs and DLs is an NP-hard optimization problem, their structure and parameters optimization using the meta-heuristic (MH) algorithms has been considerably raised. MH algorithms can accurately formulate the optimal estimation of DL components (such as hyper-parameter, weights, number of layers, number of neurons, learning rate, etc.). This paper provides a comprehensive review of the optimization of ANNs and DLs using MH algorithms. In this paper, we have reviewed the latest developments in the use of MH algorithms in the DL and ANN methods, presented their disadvantages and advantages, and pointed out some research directions to fill the gaps between MHs and DL methods. Moreover, it has been explained that the evolutionary hybrid architecture still has limited applicability in the literature. Also, this paper classifies the latest MH algorithms in the literature to demonstrate their effectiveness in DL and ANN training for various applications. Most researchers tend to extend novel hybrid algorithms by combining MHs to optimize the hyper-parameters of DLs and ANNs. The development of hybrid MHs helps improving algorithms performance and capable of solving complex optimization problems. In general, the optimal performance of the MHs should be able to achieve a suitable trade-off between exploration and exploitation features. Hence, this paper tries to summarize various MH algorithms in terms of the convergence trend, exploration, exploitation, and the ability to avoid local minima. The integration of MH with DLs is expected to accelerate the training process in the coming few years. However, relevant publications in this way are still rare.

Big Data in cardiac surgery: real world and perspectives

Big Data, and the derived analysis techniques, such as artificial intelligence and machine learning, have been considered a revolution in the modern practice of medicine. Big Data comes from multiple sources, encompassing electronic health records, clinical studies, imaging data, registries, administrative databases, patient-reported outcomes and OMICS profiles. The main objective of such analyses is to unveil hidden associations and patterns. In cardiac surgery, the main targets for the use of Big Data are the construction of predictive models to recognize patterns or associations better representing the individual risk or prognosis compared to classical surgical risk scores. The results of these studies contributed to kindle the interest for personalized medicine and contributed to recognize the limitations of randomized controlled trials in representing the real world. However, the main sources of evidence for guidelines and recommendations remain RCTs and meta-analysis. The extent of the revolution of Big Data and new analytical models in cardiac surgery is yet to be determined.