Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive...Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive least-square(FB-KRLS)algorithm are presented for online adaptive prediction.The computational complexity of the KLMS algorithm is low and does not require additional solution paradigm constraints,but its regularization process can solve the problem of regularization performance degradation in high-dimensional data processing.To reduce the computational complexity,the sparse criterion is introduced into the KLMS algorithm.To further improve forecasting accuracy,FB-KRLS algorithm is proposed.It is an online learning method with fixed memory budget,and it is capable of recursively learning a nonlinear mapping and changing over time.In contrast to a previous approximate linear dependence(ALD)based technique,the purpose of the presented algorithm is not to prune the oldest data point in every time instant but it aims to prune the least significant data point,thus suppressing the growth of kernel matrix.In order to verify the validity of the proposed methods,they are applied to one-step and multi-step predictions of traffic flow in Beijing.Under the same conditions,they are compared with online adaptive ALD-KRLS method and other kernel learning methods.Experimental results show that the proposed KAF algorithms can improve the prediction accuracy,and its online learning ability meets the actual requirements of traffic flow and contributes to real-time online forecasting of traffic flow.展开更多
A novel particle filter bandwidth adaption for kernel particle filter(BAKPF)is proposed.Selection of the kernel bandwidth is a critical issue in kernel density estimation(KDE).The plug-in method is adopted to get the ...A novel particle filter bandwidth adaption for kernel particle filter(BAKPF)is proposed.Selection of the kernel bandwidth is a critical issue in kernel density estimation(KDE).The plug-in method is adopted to get the global fixed bandwidth by optimizing the asymptotic mean integrated squared error(AMISE)firstly.Then,particle-driven bandwidth selection is invoked in the KDE.To get a more effective allocation of the particles,the KDE with adap-tive bandwidth in the BAKPF is used to approximate the posterior probability density function(PDF)by moving particles toward the posterior.A closed-form expression of the true distribution is given.The simulation results show that the proposed BAKPF performs better than the standard particle filter(PF),unscented particle filter(UPF)and the kernel particle filter(KPF)both in efficiency and estimation precision.展开更多
Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning thi...Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning this,the logarithmic hyperbolic cosine(lncosh)criterion with better robustness and convergence has drawn attention in recent studies.However,existing lncosh loss-based KAFs use the stochastic gradient descent(SGD)for optimization,which lack a trade-off between the convergence speed and accuracy.But recursion-based KAFs can provide more effective filtering performance.Therefore,a Nyström method-based robust sparse kernel recursive least lncosh loss algorithm is derived in this article.Experiments via measures and synthetic data against the non-Gaussian noise confirm the superiority with regard to the robustness,accuracy performance,and computational cost.展开更多
基金National Natural Science Foundation of China(No.51467008)
文摘Considering that the prediction accuracy of the traditional traffic flow forecasting model is low,based on kernel adaptive filter(KAF)algorithm,kernel least mean square(KLMS)algorithm and fixed-budget kernel recursive least-square(FB-KRLS)algorithm are presented for online adaptive prediction.The computational complexity of the KLMS algorithm is low and does not require additional solution paradigm constraints,but its regularization process can solve the problem of regularization performance degradation in high-dimensional data processing.To reduce the computational complexity,the sparse criterion is introduced into the KLMS algorithm.To further improve forecasting accuracy,FB-KRLS algorithm is proposed.It is an online learning method with fixed memory budget,and it is capable of recursively learning a nonlinear mapping and changing over time.In contrast to a previous approximate linear dependence(ALD)based technique,the purpose of the presented algorithm is not to prune the oldest data point in every time instant but it aims to prune the least significant data point,thus suppressing the growth of kernel matrix.In order to verify the validity of the proposed methods,they are applied to one-step and multi-step predictions of traffic flow in Beijing.Under the same conditions,they are compared with online adaptive ALD-KRLS method and other kernel learning methods.Experimental results show that the proposed KAF algorithms can improve the prediction accuracy,and its online learning ability meets the actual requirements of traffic flow and contributes to real-time online forecasting of traffic flow.
基金supported by the National Natural Science Foundation of China(60736043,60805012)the Fundamental Research Funds for the Central Universities(K50510020032)
文摘A novel particle filter bandwidth adaption for kernel particle filter(BAKPF)is proposed.Selection of the kernel bandwidth is a critical issue in kernel density estimation(KDE).The plug-in method is adopted to get the global fixed bandwidth by optimizing the asymptotic mean integrated squared error(AMISE)firstly.Then,particle-driven bandwidth selection is invoked in the KDE.To get a more effective allocation of the particles,the KDE with adap-tive bandwidth in the BAKPF is used to approximate the posterior probability density function(PDF)by moving particles toward the posterior.A closed-form expression of the true distribution is given.The simulation results show that the proposed BAKPF performs better than the standard particle filter(PF),unscented particle filter(UPF)and the kernel particle filter(KPF)both in efficiency and estimation precision.
基金supported in part by the National Natural Science Foundation of China under Grants No.62027803,No.61601096,No.61971111,and No.61801089in part by the Science and Technology Program under Grants No.8091C24,No.2021JCJQJJ0949,and No.2022JCJQJJ0784in part by the Industrial Technology Development Program under Grant No.2020110C041.
文摘Kernel adaptive filters(KAFs)have sparked substantial attraction for online non-linear learning applications.It is noted that the effectiveness of KAFs is highly reliant on a rational learning criterion.Concerning this,the logarithmic hyperbolic cosine(lncosh)criterion with better robustness and convergence has drawn attention in recent studies.However,existing lncosh loss-based KAFs use the stochastic gradient descent(SGD)for optimization,which lack a trade-off between the convergence speed and accuracy.But recursion-based KAFs can provide more effective filtering performance.Therefore,a Nyström method-based robust sparse kernel recursive least lncosh loss algorithm is derived in this article.Experiments via measures and synthetic data against the non-Gaussian noise confirm the superiority with regard to the robustness,accuracy performance,and computational cost.
