Multimedia data-driven customer churn prediction using an enhanced extreme learning machine

This paper proposes a procedure to estimate tsunami wave forces on coastal bridges through a novel method based on Extreme Learning Machine (ELM) and laboratory experiments. This research included three water depths, ten wave heights, and four bridge models with a variety of girders providing a total of 120 cases. The research was designed and adapted to estimate tsunami bore forces including horizontal force, vertical uplift and overturning moment on a coastal bridge. The experiments were carried out on 1:40 scaled concrete bridge models in a wave flume with dimensions of 24 m × 1.5 m × 2 m. Two six-axis load cells and four pressure sensors were installed to the base plate to measure forces. In the numerical procedure, estimation and prediction results of the ELM model were compared with Genetic Programming (GP) and Artificial Neural Networks (ANNs) models. The experimental results showed an improvement in predictive accuracy, and capability of generalization could be achieved by the ELM approach in comparison with GP and ANN. Moreover, results indicated that the ELM models developed could be used with confidence for further work on formulating novel model predictive strategy for tsunami bore forces on a coastal bridge. The experimental results indicated that the new algorithm could produce good generalization performance in most cases and could learn thousands of times faster than conventional popular learning algorithms. Therefore, it can be conclusively obtained that utilization of ELM is certainly developing as an alternative approach to estimate the tsunami bore forces on a coastal bridge.

Surface roughness prediction by extreme learning machine constructed with abrasive water jet

Extreme Learning Machine (ELM) is a learning algorithm proposed recently to train single hidden layer feed forward networks (SLFN). It has many attractive properties that include better generalization performance and very fast learning. ELM starts by assigning random values to the input weights and hidden biases and then in one step it determines the output weights using Moore-Penrose generalized inverse. Despite the aforementioned advantages, ELM performance might be affected by the random initialization of weights and biases or by the large generated network which might contain unnecessary number of neurons. In order to increase the generalization performance and to produce more compact networks, a hybrid model that combines ELM with competitive swarm optimizer (CSO) is proposed in this paper. The proposed model (CSONN-ELM) optimizes the weights and biases and dynamically determines the most appropriate number of neurons. To evaluate the effectiveness of the CSONN-ELM, it is experimented using 23 benchmark datasets, and compared to a set of static rules extracted from literature that are used to determine the number of neurons of SLFN. Moreover, it is compared to two dynamic methods that are used to enhance the performance of ELM, that are Optimally pruned ELM (OP-ELM) and metaheuristic based ELMs (Particle Swarm Optimization-ELM and Differential Evolution-ELM). The obtained results show that the proposed method enhances the generalization performance of ELM and overcomes the static and dynamic methods.

Welding parameters play a significant role in determining the bead geometry and hence the quality of the weld joint. To further improve prediction accuracy and optimization quality of laser brazing, the published experiment results are utilized to build a prediction model of top and bottom width of weld bead and further establish an optimization model by a novel hybrid extreme learning machine and genetic algorithm method. Firstly, about two-third experiment results are used to train the extreme learning machine network for suitable weights, and then the rest one-third experiments are selected as a test set to illustrate the validity and reliability of the prediction network. Then, by regarding the prediction values from the extreme learning machine as the fitness values of genetic algorithm, optimal results of the inputs and outputs are obtained through the procedure of selection, crossover, and mutation. Eventually, the final optimization results are confirmed by verification experiments. Meanwhile, the hybrid model is more accurate and stable than that using back propagation neural network and genetic algorithm. In the whole, the proposed method in this paper is an effective and accurate way for optimizing laser brazing welding parameters and guiding the actual welding process.

For classification problem, extreme learning machine (ELM) can get better generalization performance at a much faster learning speed. Nevertheless, a single ELM is unstable in data classification. The Bagging-based ensemble classifier, i.e., Bagging-ELM has been studied popularly and proved to improve the performance of ELM significantly in terms of accuracy, however, it is inappropriate to deal with large-scale datasets due to the highly intensive computation. In this study, we propose a novel ELM ensemble classifier, namely b-ELM, which leverages the Bag of Little Bootstraps technique to obtain a scalable, efficient means of classification for large-scale data. Efficiency of classification is achieved as it only requires repeated training under consideration on quantities of data that can be much smaller than the original training data. Furthermore, b-ELM is suited to implementation on modern parallel and distributed computing platforms. The experimental results demonstrate that b-ELM can efficiently handle large-scale data with a good performance on prediction accuracy.

Pulp concentration is one of the most important production parameters during ore dressing process. Generally, pulp concentration not only affects concentrate grade and recovery rate, but also has a major influence on the chemical and power consumptions during the flotation process. Recently, there has been a growing interest in the study of prediction for pulp concentration to improve the productivity and reduce consumption of various resources. Since the pulp concentration and other production parameters are nonlinearly related, it imposes very challenging obstacles to the prediction for this parameter. Because extreme learning machine (ELM) has the advantages of extremely fast learning speed, good generalization performance, and the smallest training errors, we employ ELM to predict pulp concentration in this paper. Pulp concentration data is first preprocessed using phase space reconstruction method. Then time series prediction model is adjusted from one dimension to multiple dimensions and thus it is established by several improved ELM algorithms, including traditional ELM, kernel-based ELM (Kernel-ELM), regularized ELM (R-ELM), and \(L_2\)-norm based ELM (ELM-L2). The experiments are conducted with a real-world production data set from a mine. The experimental results show the effectiveness of ELM-based prediction approaches, and we can also find that ELM-L2 has better prediction effects than other algorithms with the increase of sample size. Both training speed and prediction accuracy are improved by employing ELM-L2 to the prediction of pulp concentration.

The principle objective of this chapter is to build up a churn prediction model which helps telecom administrators to foresee clients who are no doubt liable to agitate. Many studies affirmed that AI innovation is profoundly effective to anticipate this circumstance as it is applied through training from past information. The prediction procedure is involved three primary stages: normalization of the data, then feature selection based on information gain, and finally, classification utilizing different AI methods, for example, back propagation neural network (BPNNM), naïve Bayesian, k-nearest neighborhood (KNN), support vector machine (SVM), discriminant analysis (DA), decision tree (DT), and extreme learning machine (ELM). It is shown from simulation study that out of these seven methods SVM with polynomial based kernel is coming about 91.33% of precision where ELM is at the primary situation with 92.10% of exactness and MLANN-based CCP model is at third rank with 90.4% of accuracy. Similar observation is noted for 10-fold cross validation also.

This paper addresses the analysis of the problem of combining Infinite Kernel Learning (IKL) approach and Extreme Learning Machine (ELM) structure. ELM represents a novel and promising alternative to Neural Networks, for its simplicity in implementation and high efficiency, especially concerning convergence and generalization performance. A currently underdeveloped topic concerning ELM implementation is given by the optimization process of base kernels: choosing different kernel combinations may lead to very dissimilar performance results. An innovative ELM approach using a combination of multiple kernels has been proposed in Liu et al. As a change of paradigm, we are interested in using an infinite set of base kernels, defining in this way an original ELM based algorithm called Infinite Kernel Extreme Learning Machine (IK-ELM). About that, a novel 3-step algorithm combining IKL and ELM is proposed. Finally, a brief analysis about further possible directions is discussed.

Extreme learning machine (ELM) has gained increasing interests from various research fields recently. Researchers have proposed various extensions to improve its stability, sparsity, and generalization performance. In this paper, we propose a robust and sparse ELM to exploit <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{21} $ </tex-math></inline-formula> -norm minimization of both loss function and regularization (LR21-ELM). Our <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{21} $ </tex-math></inline-formula> -norm-based loss function can diminish the undue influence of noises and outliers of data points compared with the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{2} $ </tex-math></inline-formula> -norm based loss function and make the learned ELM model more robust and stable. The powerful structural sparse-inducing <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{21} $ </tex-math></inline-formula> -norm regularization is integrated into the ELM objective function to eliminate the potential redundant neurons of ELM adaptively and reduce the complexity of the learning model. We introduce an effective iterative optimization algorithm to solve the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$L_{21} $ </tex-math></inline-formula> -norm minimization problem. Empirical tests on a number of benchmark datasets indicate that our proposed algorithm can generate a more compact, robust, and discriminative model compared with the original ELM algorithm.

Extreme Learning Machine (ELM) is an extension of feed forward Neural Network model with extremely learning capacity and good generalization capabilities. Generally, the classification performance of ELM highly focused on three parameters such as the input weight matrix, the value of bias and the number of hidden neurons presented. ELM randomly chooses the input weights and bias values to minimize the training time. The arbitrary selection of biases and the input weight produce an unforeseen result which causes training error and also produces lesser prediction accuracy. For improving efficiency of ELM training, Ant Colony Optimization with continuous domain algorithm (ACO R ) used to find the optimum input weight and hidden bias values for ELM. With the unequal distribution of classes in imbalanced data sets, ELM algorithms tussle to find good accuracy. ELM algorithm doesn't acquire the mandatory information about the minority class to make an accurate classification. To deal the issues of ELM, in this paper the hybrid algorithms Weighted ELM and Weighted ELM with ACO R are proposed. The main objective of weighted ELM is that the related weight value is computed and assigned for each training sample to increase the classification rate. ACO R method is also integrated with the weighted ELM to find the optimum input weight and bias to maximize the accuracy of classification task. The comparative analysis has been accomplished over Hepatitis dataset. Further, the experimental results clearly revealed that Weighted ELM with ACO R is superior to other proposed methods.

During the last decade, the deluge of multimedia data has impacted a wide range of research areas, including multimedia retrieval, 3D tracking, database management, data mining, machine learning, social media analysis, medical imaging, and so on. Machine learning is largely involved in multimedia applications of building models for classification and regression tasks, etc., and the learning principle consists in designing the models based on the information contained in the multimedia dataset. While many paradigms exist and are widely used in the context of machine learning, most of them suffer from the `curse of dimensionality', which means that some strange phenomena appears when data are represented in a high-dimensional space. Given the high dimensionality and the high complexity of multimedia data, it is important to investigate new machine learning algorithms to facilitate multimedia data analysis. To deal with the impact of high dimensionality, an intuitive way is to reduce the dimensionality. On the other hand, some researchers devoted themselves to designing some effective learning schemes for high-dimensional data. In this survey, we cover feature transformation, feature selection and feature encoding, three approaches fighting the consequences of the curse of dimensionality. Next, we briefly introduce some recent progress of effective learning algorithms. Finally, promising future trends on multimedia learning are envisaged.

Extreme learning machine (ELM) is a fast and quick learning algorithm with better generalization performance. However, the randomness of input weight and hidden layer bias may affect the overall performance of ELM. This paper proposed a new approach to determine the optimized values of input weight and hidden layer bias for ELM using whale optimization algorithm (WOA), which we call WOA-ELM. An online gearbox vibration signals is used in this study. Empirical mode decomposition (EMD) and complementary mode decomposition (CEEMD) are used to decompose the signals into sub-signals known as intrinsic mode functions (IMFs). Then, statistical features are extracted from selected IMFs. WOA-ELM is used for classification of healthy and faulty condition of gearbox. The result shows that WOA-ELM provide better classification result as compared with conventional ELM. Therefore, this study provide a new diagnosis approach for gearbox application.

The extreme learning machine (ELM), which was originally proposed for “generalized” single-hidden layer feedforward neural networks (SLFNs), provides efficient unified learning solutions for the applications of regression and classification. It presents competitive accuracy with superb efficiency in many applications. However, due to its single-layer architecture, feature selection using ELM may not be effective for natural signals. To address this issue, this paper proposes a new ELM-based multi-layer learning framework for dimension reduction. The novelties of this work are as follows: (1) Unlike the existing multi-layer ELM methods in which all hidden nodes are generated randomly, in this paper some hidden layers are calculated by replacement technologies. By doing so, more important information can be exploited for feature learning, which lead to a better generalization performance. (2) Unlike the existing multi-layer ELM methods which only work for sparse representation, the proposed method is designed for dimension reduction. Experimental results on several classification datsets show that, compared to other feature selection methods, the proposed method performs competitively or much better than other feature selection methods with fast learning speed.

Dynamic per-branch history length adjustment to improve branch prediction accuracy

The theory and implementation of extreme learning machine (ELM) prove that it is a simple, efficient, and accurate machine learning method. Compared with other single hidden layer feedforward neural network algorithms, ELM is characterized by simpler parameter selection rules, faster convergence speed, and less human intervention. The multiple hidden layer regularized extreme learning machine (MRELM) inherits these advantages of ELM and has higher prediction accuracy. In the MRELM model, the number of hidden layers is randomly initiated and fixed, and there is no iterative tuning process. However, the optimal number of hidden layers is the key factor to determine the generalization ability of MRELM. Given this situation, it is obviously unreasonable to determine this number by trial and random initialization. In this paper, an incremental MRELM training algorithm (FC-IMRELM) based on forced positive-definite Cholesky factorization is put forward to solve the network structure design problem of MRELM. First, an MRELM-based prediction model with one hidden layer is constructed, and then a new hidden layer is added to the prediction model in each training step until the generalization performance of the prediction model reaches its peak value. Thus, the optimal network structure of the prediction model is determined. In the training procedure, forced positive-definite Cholesky factorization is used to calculate the output weights of MRELM, which avoids the calculation of the inverse matrix and Moore-Penrose generalized inverse of matrix involved in the training process of hidden layer parameters. Therefore, FC-IMRELM prediction model can effectively reduce the computational cost brought by the process of increasing the number of hidden layers. Experiments on classification and regression problems indicate that the algorithm can be effectively used to determine the optimal network structure of MRELM, and the prediction model training by the algorithm has excellent performance in prediction accuracy and computational cost.