An Online Learning Algorithm for Voice Activation Detection Based on a Pretrained Online Extreme Learning Machine

2018 ◽  
Author(s):  
Tianle Zhang ◽  
Muzhou Hou ◽  
Futian Weng ◽  
Yunlei Yang ◽  
Hongli Sun ◽  
...  
Keyword(s):  
Online Learning ◽  
Extreme Learning Machine ◽  
Learning Algorithm ◽  
Activation Detection ◽  
Learning Machine ◽  
Online Learning Algorithm

scholarly journals Online Sequential Extreme Learning Machine with Generalized Regularization and Adaptive Forgetting Factor for Time-Varying System Prediction

2018 ◽  
Vol 2018 ◽  
pp. 1-22 ◽  
Author(s):  
Wei Guo ◽  
Tao Xu ◽  
Keming Tang ◽  
Jianjiang Yu ◽  
Shuangshuang Chen
Keyword(s):  
Online Learning ◽  
Real World ◽  
Learning Algorithm ◽  
Time Varying ◽  
Forgetting Factor ◽  
Ill Posed ◽  
Adaptive Forgetting Factor ◽  
Learning Machine ◽  
Online Learning Algorithm ◽  
Adaptive Forgetting

Many real world applications are of time-varying nature and an online learning algorithm is preferred in tracking the real-time changes of the time-varying system. Online sequential extreme learning machine (OSELM) is an excellent online learning algorithm, and some improved OSELM algorithms incorporating forgetting mechanism have been developed to model and predict the time-varying system. But the existing algorithms suffer from a potential risk of instability due to the intrinsic ill-posed problem; besides, the adaptive tracking ability of these algorithms for complex time-varying system is still very weak. In order to overcome the above two problems, this paper proposes a novel OSELM algorithm with generalized regularization and adaptive forgetting factor (AFGR-OSELM). In the AFGR-OSELM, a new generalized regularization approach is employed to replace the traditional exponential forgetting regularization to make the algorithm have a constant regularization effect; consequently the potential ill-posed problem of the algorithm can be completely avoided and a persistent stability can be guaranteed. Moreover, the AFGR-OSELM adopts an adaptive scheme to adjust the forgetting factor dynamically and automatically in the online learning process so as to better track the dynamic changes of the time-varying system and reduce the adverse effects of the outdated data in time; thus it tends to provide desirable prediction results in time-varying environment. Detailed performance comparisons of AFGR-OSELM with other representative algorithms are carried out using artificial and real world data sets. The experimental results show that the proposed AFGR-OSELM has higher prediction accuracy with better stability than its counterparts for predicting time-varying system.

Study on Deep Structure of Extreme Learning Machine (DS-ELM) for Datasets with Noise

2014 ◽  
Vol 989-994 ◽  
pp. 3679-3682 ◽  
Author(s):  
Meng Meng Ma ◽  
Bo He
Keyword(s):  
Extreme Learning Machine ◽  
Simple Structure ◽  
Learning Algorithm ◽  
Deep Structure ◽  
Noisy Data ◽  
Machine Learning Algorithm ◽  
Feed Forward Neural Networks ◽  
Learning Machine ◽  
Hidden Layer ◽  
Auto Associative Neural Network

Extreme learning machine (ELM), a relatively novel machine learning algorithm for single hidden layer feed-forward neural networks (SLFNs), has been shown competitive performance in simple structure and superior training speed. To improve the effectiveness of ELM for dealing with noisy datasets, a deep structure of ELM, short for DS-ELM, is proposed in this paper. DS-ELM contains three level networks (actually contains three nets ): the first level network is trained by auto-associative neural network (AANN) aim to filter out noise as well as reduce dimension when necessary; the second level network is another AANN net aim to fix the input weights and bias of ELM; and the last level network is ELM. Experiments on four noisy datasets are carried out to examine the new proposed DS-ELM algorithm. And the results show that DS-ELM has higher performance than ELM when dealing with noisy data.

Convergence analysis of online learning algorithm with two-stage step size

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Weilin Nie ◽  
Cheng Wang
Keyword(s):  
Online Learning ◽  
Optimization Problems ◽  
Learning Algorithm ◽  
Computational Cost ◽  
Reproducing Kernels ◽  
Step Size ◽  
Two Stage ◽  
Logarithmic Term ◽  
Convergence Performance ◽  
Online Learning Algorithm

Abstract Online learning is a classical algorithm for optimization problems. Due to its low computational cost, it has been widely used in many aspects of machine learning and statistical learning. Its convergence performance depends heavily on the step size. In this paper, a two-stage step size is proposed for the unregularized online learning algorithm, based on reproducing Kernels. Theoretically, we prove that, such an algorithm can achieve a nearly min–max convergence rate, up to some logarithmic term, without any capacity condition.

Prediction of Software Defect Using Ensemble Learning Based Improved Sparrow Search Algorithm To Optimize Extreme Learning Machine

2021 ◽  
Author(s):  
Yu Tang ◽  
Qi Dai ◽  
Mengyuan Yang ◽  
Lifang Chen
Keyword(s):  
Extreme Learning Machine ◽  
Ensemble Learning ◽  
Learning Algorithm ◽  
Search Algorithm ◽  
Defect Prediction ◽  
Software Defect Prediction ◽  
Prediction Ability ◽  
Software Defect ◽  
Ensemble Learning Algorithm ◽  
Learning Machine

Abstract For the traditional ensemble learning algorithm of software defect prediction, the base predictor exists the problem that too many parameters are difficult to optimize, resulting in the optimized performance of the model unable to be obtained. An ensemble learning algorithm for software defect prediction that is proposed by using the improved sparrow search algorithm to optimize the extreme learning machine, which divided into three parts. Firstly, the improved sparrow search algorithm (ISSA) is proposed to improve the optimization ability and convergence speed, and the performance of the improved sparrow search algorithm is tested by using eight benchmark test functions. Secondly, ISSA is used to optimize extreme learning machine (ISSA-ELM) to improve the prediction ability. Finally, the optimized ensemble learning algorithm (ISSA-ELM-Bagging) is presented in the Bagging algorithm which improve the prediction performance of ELM in software defect datasets. Experiments are carried out in six groups of software defect datasets. The experimental results show that ISSA-ELM-Bagging ensemble learning algorithm is significantly better than the other four comparison algorithms under the six evaluation indexes of Precision, Recall, F-measure, MCC, Accuracy and G-mean, which has better stability and generalization ability.

scholarly journals Short Time Solar Power Forecasting Using Persistence Extreme Learning Machine Approach

2021 ◽  
Vol 294 ◽  
pp. 01002
Author(s):  
Xiaoyan Xiang ◽  
Yao Sun ◽  
Xiaofei Deng
Keyword(s):  
Solar Energy ◽  
Extreme Learning Machine ◽  
Power Output ◽  
Smart Grids ◽  
Large Scale ◽  
Solar Power ◽  
Learning Algorithm ◽  
Power Performance ◽  
Energy Prediction ◽  
Learning Machine

Solar energy in nature is irregular, so photovoltaic (PV) power performance is intermittent, and highly dependent on solar radiation, temperature and other meteorological parameters. Accurately predicting solar power to ensure the economic operation of micro-grids (MG) and smart grids is an important challenge to improve the large-scale application of PV to traditional power systems. In this paper, a hybrid machine learning algorithm is proposed to predict solar power accurately, and Persistence Extreme Learning Machine(P-ELM) algorithm is used to train the system. The input parameters are the temperature, sunshine and solar power output at the time of i, and the output parameters are the temperature, sunshine and solar power output at the time i+1. The proposed method can realize the prediction of solar power output 20 minutes in advance. Mean absolute error (MAE) and root-mean-square error (RMSE) are used to characterize the performance of P-ELM algorithm, and compared with ELM algorithm. The results show that the accuracy of P-ELM algorithm is better in short-term prediction, and P-ELM algorithm is very suitable for real-time solar energy prediction accuracy and reliability.

Sign in / Sign up

Export Citation Format

Share Document