Incremental Extreme Learning Machine Research Articles

Cox Regressive Outlier Robust Incremental Extreme Learning Machine based IoT aware Smart Car Parking and Route Optimization for Intelligent Transportation

An Intelligent Transport System (ITS) is a wide-ranging framework that influences advanced technologies to improve efficiency of transportation networks. An ITS integrated with an IoT enhances the capabilities of transportation networks. Owing to quick development of vehicles, traffic congestion during road network is major problems. Therefore, intelligent traffic control system is required to create smart transportation through optimization of vehicle route, and so on. In this paper, Cox Regressive Fuzzified Outlier Robust Incremental Extreme Learning Machine (CRFORIELM) is developed for smart ITS. The IoT technology in IT’S is used to collect traffic data, vehicle information, Parking slot occupancy data. After data collection process, proposed CRFORIELM technique includes two major processing steps namely parking slot availability detection and traffic aware route optimization. The extreme learning machine includes three types of layers such as input, three hidden layers as well as output layer. Initial hidden layer predicts the parking slot availability using Cox regression is performed. With the parking lot availability predictions, integrate this information into a route optimization algorithm. This algorithm considers the real-time traffic conditions as well as parking availability for detecting optimal route by applying fuzzy triangular membership function in the second hidden layer. Finally, nearest route path is effectively determined to minimize travel time in intelligent transport system. Experimental analysis indicates that the CRFORIELM technique achieved 2%, 5%, 10% improvement in accuracy, sensitivity, specificity and reduced error rates, route detection time by 39%, and 36%, compared to existing methods.

A Novel Deep Kernel Incremental Extreme Learning Machine Based on Artificial Transgender Longicorn Algorithm and Multiple Population Gray Wolf Optimization Methods

Redundant nodes in a kernel incremental extreme learning machine (KI-ELM) increase ineffective iterations and reduce learning efficiency. To address this problem, this study established a novel improved hybrid intelligent deep kernel incremental extreme learning machine (HI-DKIELM), which is based on a hybrid intelligent algorithm and a KI-ELM. First, a hybrid intelligent algorithm was established based on the artificial transgender longicorn algorithm and multiple population gray wolf optimization methods to reduce the parameters of hidden layer neurons and then to determine the effective number of hidden layer neurons. The learning efficiency of the algorithm was improved through the reduction of network complexity. Then, to improve the classification accuracy and generalization performance of the algorithm, a deep network structure was introduced to the KI-ELM to gradually extract the original input data layer by layer and realize high-dimensional mapping of data. The experimental results show that the number of network nodes of HI-DKIELM algorithm is obviously reduced, which reduces the network complexity of ELM and greatly improves the learning efficiency of the algorithm. From the regression and classification experiments, its CCPP can be seen that the training error and test error of the HI-DKIELM algorithm proposed in this paper are 0.0417 and 0.0435, which are 0.0103 and 0.0078 lower than the suboptimal algorithm, respectively. On the Boston Housing database, the average and standard deviation of this algorithm are 98.21 and 0.0038, which are 6.2 and 0.0003 higher than the suboptimal algorithm, respectively.

Robot error compensation based on incremental extreme learning machines and an improved sparrow search algorithm

Robot error compensation based on incremental extreme learning machines and an improved sparrow search algorithm

Blockchain-Federated and Deep-Learning-Based Ensembling of Capsule Network with Incremental Extreme Learning Machines for Classification of COVID-19 Using CT Scans.

Due to the rapid rate of SARS-CoV-2 dissemination, a conversant and effective strategy must be employed to isolate COVID-19. When it comes to determining the identity of COVID-19, one of the most significant obstacles that researchers must overcome is the rapid propagation of the virus, in addition to the dearth of trustworthy testing models. This problem continues to be the most difficult one for clinicians to deal with. The use of AI in image processing has made the formerly insurmountable challenge of finding COVID-19 situations more manageable. In the real world, there is a problem that has to be handled about the difficulties of sharing data between hospitals while still honoring the privacy concerns of the organizations. When training a global deep learning (DL) model, it is crucial to handle fundamental concerns such as user privacy and collaborative model development. For this study, a novel framework is designed that compiles information from five different databases (several hospitals) and edifies a global model using blockchain-based federated learning (FL). The data is validated through the use of blockchain technology (BCT), and FL trains the model on a global scale while maintaining the secrecy of the organizations. The proposed framework is divided into three parts. First, we provide a method of data normalization that can handle the diversity of data collected from five different sources using several computed tomography (CT) scanners. Second, to categorize COVID-19 patients, we ensemble the capsule network (CapsNet) with incremental extreme learning machines (IELMs). Thirdly, we provide a strategy for interactively training a global model using BCT and FL while maintaining anonymity. Extensive tests employing chest CT scans and a comparison of the classification performance of the proposed model to that of five DL algorithms for predicting COVID-19, while protecting the privacy of the data for a variety of users, were undertaken. Our findings indicate improved effectiveness in identifying COVID-19 patients and achieved an accuracy of 98.99%. Thus, our model provides substantial aid to medical practitioners in their diagnosis of COVID-19.

A Combined Safety Monitoring Model for High Concrete Dams

When applying reliability analysis to the monitoring of structural health, it is very important that gross errors–which affect prediction accuracy–are included within the monitoring information. An approach using gross errors identification and a dam safety monitoring model for deformation monitoring data of concrete dams is proposed in this paper. It can solve the problems of strong nonlinearity and the difficulty of identifying and eliminating gross errors in deformation monitoring data in concrete dams. This new method combines the advantages of an incremental extreme learning machine (I-ELM) method to seek an optimal network structure, the Least Median Squares (LMS) method with strong robustness to multiple failure points, the robust estimation IGG method with the good robustness to outliers (gross errors) and extreme learning machine (ELM) method with high prediction efficiency and handling of nonlinear problems. The proposed method can eliminate gross errors and be utilized to predict the behavior of concrete dams. The deformation monitoring data of an existing 305 m-high concrete arch dam is acquired by combining remote sensing technology with other monitoring methods. The LMS-IGG-ELM method is utilized to eliminate outliers from the dam monitoring sequence and is compared with the processing result from a DBSCAN clustering algorithm, Romanovsky criterion and the 3σ method. The results show that the proposed method has the highest gross errors identification rate, the strongest generalization ability and the best prediction effect.

PCA-Based Incremental Extreme Learning Machine (PCA-IELM) for COVID-19 Patient Diagnosis Using Chest X-Ray Images.

Novel coronavirus 2019 has created a pandemic and was first reported in December 2019. It has had very adverse consequences on people's daily life, healthcare, and the world's economy as well. According to the World Health Organization's most recent statistics, COVID-19 has become a worldwide pandemic, and the number of infected persons and fatalities growing at an alarming rate. It is highly required to have an effective system to early detect the COVID-19 patients to curb the further spreading of the virus from the affected person. Therefore, to early identify positive cases in patients and to support radiologists in the automatic diagnosis of COVID-19 from X-ray images, a novel method PCA-IELM is proposed based on principal component analysis (PCA) and incremental extreme learning machine. The suggested method's key addition is that it considers the benefits of PCA and the incremental extreme learning machine. Further, our strategy PCA-IELM reduces the input dimension by extracting the most important information from an image. Consequently, the technique can effectively increase the COVID-19 patient prediction performance. In addition to these, PCA-IELM has a faster training speed than a multi-layer neural network. The proposed approach was tested on a COVID-19 patient's chest X-ray image dataset. The experimental results indicate that the proposed approach PCA-IELM outperforms PCA-SVM and PCA-ELM in terms of accuracy (98.11%), precision (96.11%), recall (97.50%), F1-score (98.50%), etc., and training speed.

Noise/fault aware regularization for incremental learning in extreme learning machines

This paper investigates noise/fault tolerant incremental algorithms for the extreme learning machine (ELM) concept. Existing incremental ELM algorithms can be classified into two approaches: non-recomputation and recomputation. This paper first formulates a noise/fault aware objective function for nonlinear regression problems. Instead of developing noise/fault aware algorithms for the two computational approaches in a one-by-one manner, this paper uses two representative incremental algorithms, namely incremental ELM (I-ELM) and error minimized ELM (EM-ELM), to develop two noise/fault aware incremental algorithms. The proposed algorithms are called generalized I-ELM (GI-ELM) and generalized EM-ELM (GEM-ELM). The GI-ELM adds k hidden nodes into the existing network at each incremental step without recomputing the existing weights. To have a fair comparison, we consider a modified version of I-ELM as a comparison algorithm. The simulation demonstrates that the noise/fault tolerance of the proposed GI-ELM is better than that of the modified I-ELM. In the GEM-ELM, k hidden nodes are added into the existing network at each incremental step. Meanwhile, all output weights are recomputed based on a recursive formula. We also consider a modified version of EM-ELM as a comparison algorithm. The simulation demonstrates that the noise/fault tolerance of the proposed GEM-ELM is better than that of the modified EM-ELM. Moreover, we demonstrate that the multiple set concept can further enhance the performance of the two proposed algorithms. Following our research results, one can make some non-noise/fault tolerant incremental algorithms to be noise/fault tolerant.

A hybrid deep kernel incremental extreme learning machine based on improved coyote and beetle swarm optimization methods

The iteration times and learning efficiency of kernel incremental extreme learning machines are always affected by the redundant nodes. A hybrid deep kernel incremental extreme learning machine (DKIELM) based on the improved coyote and beetle swarm optimization methods was proposed in this paper. A hybrid intelligent optimization algorithm based on the improved coyote optimization algorithm (ICOA) and improved beetle swarm optimization algorithm (IBSOA) was proposed to optimize the parameters and determine the number of effectively hidden layer neurons for the proposed DKIELM. A Gaussian global best-growing operator was adopted to replace the original growing operator in the intelligent optimization algorithm to improve COA searching efficiency and convergence. In the meantime, IBSOA was designed based on tent mapping inverse learning and dynamic mutation strategies to avoid falling into a local optimum. The experimental results demonstrated the feasibility and effectiveness of the proposed DKIELM with encouraging performances compared with other ELMs.

An innovative ensemble learning air pollution early-warning system for China based on incremental extreme learning machine

Air pollution has lots of adverse effects on industrial production and public life. Thus, it is an urgent task to construct an efficient air quality early-warning system to guide public life and production. This paper proposes an innovative air pollution early-warning system, including four main modules: clustering, preprocessing, forecasting and evaluation. In the clustering module, with the aim of building an efficient air pollution warning system, the air pollution situation of 31 provincial capitals is clustered and the study areas of the current study are selected based on the clustering result. A new data preprocessing algorithm is conducted to excavate the potential characteristics of the raw time series in the first place in the preprocessing module. Then, the length-changeable incremental extreme learning machine is used to forecast each component. In the evaluation module, the air quality is qualitatively analyzed by the fuzzy evaluation method. Moreover, the DM test and the SPA test are employed to test the accuracy of the forecasting model. The experimental results of eighteen data sets from three cities show that the hybrid air quality early-warning system establish in the study not only has higher accuracy and generalization ability than other benchmark models, but can provide sufficient air quality information, which is essential to control air pollution.

Retraction: Deep learning based Food Recognition using Tensorflow (J. Phys.: Conf. Ser 1916 012149)

This article has been retracted by IOP Publishing following an allegation that this article contains text overlap from multiple unreferenced sources [1, 2]. IOP Publishing has investigated and agrees the article constitutes plagiarism. IOP Publishing also expresses concern regarding a number of nonsensical phrases used in the article, which suggests the article may have been created at least partly by artificial intelligence or translation software.IOP Publishing wishes to credit the PubPeer commenters for bringing the issue to our attention.The authors disagree to this retraction. 1. G. A. Tahir and C. K. Loo, "An Open-Ended Continual Learning for Food Recognition Using Class Incremental Extreme Learning Machines," in IEEE Access, vol. 8, pp. 82328-82346, 2020, doi: 10.1109/ACCESS.2020.2991810. 2. Wang H., Min W., Li X., Jiang S. (2016) Where and What to Eat: Simultaneous Restaurant and Dish Recognition from Food Image. In: Chen E., Gong Y., Tie Y. (eds) Advances in Multimedia Information Processing - PCM 2016. PCM 2016. Lecture Notes in Computer Science, vol 9916. Springer, Cham. https://doi.org/10.1007/978-3-319-48890-5_51. Retraction published: 10 January 2022

Spacecraft structure reconstruction with fiber bragg grating and incremental extreme learning machine

Spacecraft structure reconstruction with fiber bragg grating and incremental extreme learning machine

Multi-step wind speed forecast based on sample clustering and an optimized hybrid system

At present, accurate forecast of very-short-term wind speed is still a critical issue, mainly due to the complex characteristics of wind variations such as intermittence, fluctuation and randomness. On this topic, our paper contributes to the development of an effective multi-step forecasting method termed ECKIE, which provides multi-step forecast for the very-short-term wind speed in specific stations. This method consists of three stages: a data filtering process driven by the ensemble empirical mode decomposition (EEMD), an improved K-harmonic mean (KHM) clustering optimized by the Cuckoo search (CS) algorithm and a single-hidden-layer feedforward network (SLFN) trained by the incremental extreme learning machine (IELM) algorithm. The developed method is capable of clustering the model inputs into groups according to their characteristics and of constructing the models for each group. It is further capable of reducing forecasting errors by choosing a suitable model. It is a purely data-driven process and is an effective method for very-short-term wind speed forecasts. The simulation demonstrates that the developed method drastically improves upon original model performance and performs the best among comparable models.

Classifier-Based Approximator for Friction Compensation in High Accelerated Positioning System

This article proposes a classifier-based approximator to compensate for friction in a high accelerated positioning system. Since friction function is globally non-smooth, an unsupervised k-means clustering algorithm is adopted to classify the friction into micro and macro motion segment, then the frictions are estimated with two sub-approximator in the corresponding segment respectively. Due to the unsupervised classification of friction, the classifier-based approximator can realize universal approximation of nonlinear friction with high precision. Finally, comparative experiments on a high accelerated position system driven by voice coil motors are conducted to verify the effectiveness of the proposed method. The proposed method can reduce the root mean square error (RMSE) of tracking by 57.2%, 19.1%, and 27.4% compared with a parametric model, recurrent neural network (RNN), and incremental extreme learning machine (I-ELM), respectively.

A Novel Hierarchical Hybrid Model for Short-Term Bus Passenger Flow Forecasting

For the increasing travel demands and public transport problems, dynamically adjusting timetable or bus scheduling is necessary based on accurate real-time passenger flow forecasting. In order to get more accurate passenger flow in future, this paper proposes a novel hierarchical hybrid model based on time series model, deep belief networks (DBNs), and improved incremental extreme learning machine (Im-ELM) to forecast short-term passenger flow. The proposed model is named HTSDBNE with two modelling steps. First, referring the idea of parallelization, the hybrid model, constructed by time series model, DBN, and Im-ELM, is used to forecast short-term passenger flow in different time scales hierarchically and parallel. Second, Im-ELM is utilized to analyse the relationship of forecasting results from the first step, and the weighted outputs of Im-ELM are as the final forecasting results. Comparing with single forecasting models and typical hybrid forecasting models, the testing results indicate that HTSDBNE has better performances. The mean absolute percent error of prediction results is around 10% and fully meets the application requirements of bus operation enterprise.

A Novel Kernel-based Extreme Learning Machine with Incremental Hidden Layer Nodes

Extreme learning machine (ELM) is widely used in various fields because of its advantages such as short training time and good generalization performance. The input weights and bias of hidden layer of traditional ELM are generated randomly, and the number of hidden layer nodes is determined by artificial experience. Only by adjusting parameters manually can an appropriate network structure be found. This training method is complex and time-consuming, which increases the workload of workers. To solve this problem, the incremental extreme learning machine (I-ELM) is used to determine the appropriate number of hidden layer nodes and construct a compact network structure in this paper. At the same time, a new hidden layer activation function STR is proposed, which avoids the disadvantages of incomplete output information of hidden layer due to uneven distribution of sample data. The proposed algorithm is evaluated by public data sets and applied to the classification of superheat degree (SD) in aluminum electrolysis industry. The experimental results show that STR activation function has a good learning speed, and the proposed algorithm is superior to the existing SD identification algorithm in terms of accuracy and robustness.

Inverse-Free Incremental Learning Algorithms With Reduced Complexity for Regularized Extreme Learning Machine

The existing inverse-free incremental learning algorithm for the regularized extreme learning machine (ELM) was based on an inverse-free algorithm to update the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in the existing inverse-free ELM, its improved version had been utilized in previous literatures. Then from the improved recursive algorithm to update the inverse, we deduce a more efficient inverse-free algorithm to update the regularized pseudo-inverse, from which we propose the inverse-free incremental ELM algorithm based on regularized pseudo-inverse. Usually the above-mentioned inverse is smaller than the pseudo-inverse, while in the processor units with limited precision, the recursive algorithm to update the inverse may introduce numerical instabilities. Then to further reduce the computational complexity, we also propose the inverse-free incremental ELM algorithm based on the ${\mathrm {LDL}}^{T}$ factors of the inverse, where the ${\mathrm {LDL}}^{T}$ factors are updated iteratively by the inverse ${\mathrm {LDL}}^{T}$ factorization. With respect to the existing inverse-free ELM, the proposed ELM based on regularized pseudo-inverse and that based on ${\mathrm {LDL}}^{T}$ factors are expected to require only $\frac {3}{8+M}$ and $\frac {1}{8+M}$ of complexities, respectively, where $M$ is the output node number. The numerical experiments show that both the proposed ELM algorithms significantly accelerate the existing inverse-free ELM, and the speedup in training time is not less than 1.41. On the Modified National Institute of Standards and Technology (MNIST) Dataset, usually the proposed algorithm based on ${\mathrm {LDL}}^{T}$ factors is much faster than that based on regularized pseudo-inverse. On the other hand, in the numerical experiments, the original ELM, the existing inverse-free ELM and the proposed two ELM algorithms achieve the same performance in regression and classification, and result in the same solutions, which include the output weights and the output sequence for the same input sequence.

Two noise tolerant incremental learning algorithms for single layer feed-forward neural networks

This paper focuses on noise resistant incremental learning algorithms for single layer feed-forward neural networks (SLFNNs). In a physical implementation of a well trained neural network, faults or noise are unavoidable. As biological neural networks have ability to tolerate noise, we would like to have a trained neural network that has certain ability to tolerate noise too. This paper first develops a noise tolerant objective function that can handle multiplicative weight noise. We assume that multiplicative weight noise exist in the weights between the input layer and the hidden layer, and in the weights between the hidden layer and the output layer. Based on the developed objective function, we propose two noise tolerant incremental extreme learning machine algorithms, namely weight deviation incremental extreme learning machine (WDT-IELM) and weight deviation convex incremental extreme learning machine (WDTC-IELM). Compared to the original extreme learning machine algorithms, the two proposed algorithms have much better ability to tolerate the multiplicative weight noise. Several simulations are carried out to demonstrate the superiority of the two proposed algorithms.

Inverse partitioned matrix-based semi-random incremental ELM for regression

Incremental extreme learning machine has been verified that it has the universal approximation capability. However, there are two major issues lowering its efficiency: one is that some “random” hidden nodes are inefficient which decrease the convergence rate and increase the structural complexity, the other is that the final output weight vector is not the minimum norm least-squares solution which decreases the generalization capability. To settle these issues, this paper proposes a simple and efficient algorithm in which the parameters of even hidden nodes are calculated by fitting the residual error vector in the previous phase, and then, all existing output weights are recursively updated based on inverse partitioned matrix. The algorithm can reduce the inefficient hidden nodes and obtain a preferable output weight vector which is always the minimum norm least-squares solution. Theoretical analyses and experimental results show that the proposed algorithm has better performance on convergence rate, generalization capability and structural complexity than other incremental extreme learning machine algorithms.

Research on Network Intrusion Detection Based on Incremental Extreme Learning Machine and Adaptive Principal Component Analysis

Recently, network attacks launched by malicious attackers have seriously affected modern life and enterprise production, and these network attack samples have the characteristic of type imbalance, which undoubtedly increases the difficulty of intrusion detection. In response to this problem, it would naturally be very meaningful to design an intrusion detection system (IDS) to effectively and quickly identify and detect malicious behaviors. In our work, we have proposed a method for an IDS-combined incremental extreme learning machine (I-ELM) with an adaptive principal component (A-PCA). In this method, the relevant features of network traffic are adaptively selected, where the best detection accuracy can then be obtained by I-ELM. We have used the NSL-KDD standard dataset and UNSW-NB15 standard dataset to evaluate the performance of our proposed method. Through analysis of the experimental results, we can see that our proposed method has better computation capacity, stronger generalization ability, and higher accuracy.

RETRACTED: Uncalibrated dynamic visual servoing via multivariate adaptive regression splines and improved incremental extreme learning machine

This article has been retracted: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/about/our-business/policies/article-withdrawal). This article has been retracted at the request of the authors and with the Editor-in-Chief’s approval due to errors in Figures 9-10 under Section 6. The authors apologise for the inconvenience caused to readers.