Accurate prediction of blood glucose levels is essential for type 1 diabetes optimizing insulin therapy and minimizing complications in patients with type 1 diabetes. Using ensemble learning algorithms is a promising approach. In this regard, this study proposes an improved stacking ensemble learning algorithm for predicting blood glucose level, in which three improved long short-term memory network models are used as the base model, and an improved nearest neighbor propagation clustering algorithm is adaptively weighted to this ensemble model. The OhioT1DM dataset is used to train and evaluate the performance of the proposed model. This study evaluated the performance of the proposed model using the Root Mean Square Error (RMSE), Mean Absolute Error (MAE), and Matthews Correlation Coefficient (MCC) as the evaluation metrics. The experimental results demonstrate that the proposed model achieves an RMSE of 1.425 mg/dL, MAE of 0.721 mg/dL, and MCC of 0.982 mg/dL for a 30-minute prediction horizon(PH), RMSE of 3.212 mg/dL, MAE of 1.605 mg/dL, and MCC of 0.950 mg/dL for a 45-minute PH; and RMSE of 6.346 mg/dL, MAE of 3.232 mg/dL, and MCC of 0.930 mg/dL for a 60-minute PH. Compared with the best non-ensemble model StackLSTM, the RMSE and MAE were improved by up to 27.92% and 65.32%, respectively. Clarke Error Grid Analysis and critical difference diagram revealed that the model errors were within 10%. The model proposed in this study exhibits state-of-the-art predictive performance, making it suitable for clinical decision-making and of significant importance for the effective treatment of diabetes in patients.
Literal researches have proved that most of the algorithms are not capable to solve the problems whose solutions are not locating at the Origin. Due to the large ratio for individuals to maintain their historical trajectories in swarms of the slimed mould (SM), the SM algorithms would perform even worse. Therefore, in this paper, the historical best trajectories were introduced to take part in the updating procedure for positions of individuals in swarms. Simulation experiments were carried out and the final results proved that the improved algorithm could increase capabilities of optimization for those non-symmetric problems.
9 August 2022 in Journal of Testing and Evaluation
Following an investigation undertaken by the publisher, we have determined that this paper was accepted on the basis of a compromised peer review process. We hereby retract the paper. The corresponding author has been notified of the retraction. The retraction statement can be found here: https://doi.org/10.1520/JTE20269996. Trusted network is characterized by a large amount of data, abnormal dispersion, and high complexity. Traditional methods are easily affected by trusted network environment, resulting in unreliable mining results. Therefore, a new real-time mining method of trusted network difference data is proposed. Real-time collection of trusted network difference data through history system is performed on the basis of determining the principle of trusted network difference data mining and collecting and extracting the characteristics of difference data. The process of trusted network differential data mining is designed through the artificial bee colony algorithm. According to the process, differential data mining is carried out from three aspects: constructing a trusted network differential data transmission path, updating pheromone, and establishing a differential data transmission path set. The experimental results show that the proposed method can effectively realize the real-time mining of difference data, and the mining accuracy is more accurate.