Adaptive Kernel Firefly Algorithm Based Feature Selection and Q-Learner Machine Learning Models in Cloud

CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferring information.A dynamic strategy,DevMLOps(Development Machine Learning Operations)used in automatic selections and tunings of MLTs result in significant performance differences.But,the scheme has many disadvantages including continuity in training,more samples and training time in feature selections and increased classification execution times.RFEs(Recursive Feature Eliminations)are computationally very expensive in its operations as it traverses through each feature without considering correlations between them.This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets.The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers.The proposed AKFA(Adaptive Kernel Firefly Algorithm)is for selecting features for CNM(Cloud Network Monitoring)operations.AKFA methodology is demonstrated using CNSD(Cloud Network Security Dataset)with satisfactory results in the performance metrics like precision,recall,F-measure and accuracy used.

Fast Image Segmentation Algorithm Based on Salient Features Model and Spatial-frequency Domain Adaptive Kernel

A fast image segmentation algorithm based on salient features model and spatial-frequency domain adaptive kernel is proposed to solve the accurate discriminate objects problem of online visual detection in such scenes of variable sample morphological characteristics,low contrast and complex background texture.Firstly,by analyzing the spectral component distribution and spatial contour feature of the image,a salient feature model is established in spatial-frequency domain.Then,the salient object detection method based on Gaussian band-pass filter and the design criterion of adaptive convolution kernel are proposed to extract the salient contour feature of the target in spatial and frequency domain.Finally,the selection and growth rules of seed points are improved by integrating the gray level and contour features of the target,and the target is segmented by seeded region growing.Experiments have been performed on Berkeley Segmentation Data Set,as well as sample images of online detection,to verify the effectiveness of the algorithm.The experimental results show that the Jaccard Similarity Coefficient of the segmentation is more than 90%,which indicates that the proposed algorithm can availably extract the target feature information,suppress the background texture and resist noise interference.Besides,the Hausdorff Distance of the segmentation is less than 10,which infers that the proposed algorithm obtains a high evaluation on the target contour preservation.The experimental results also show that the proposed algorithm significantly improves the operation efficiency while obtaining comparable segmentation performance over other algorithms.

Active Kriging-Based Adaptive Importance Sampling for Reliability and Sensitivity Analyses of Stator Blade Regulator

The reliability and sensitivity analyses of stator blade regulator usually involve complex characteristics like highnonlinearity,multi-failure regions,and small failure probability,which brings in unacceptable computing efficiency and accuracy of the current analysismethods.In this case,by fitting the implicit limit state function(LSF)with active Kriging(AK)model and reducing candidate sample poolwith adaptive importance sampling(AIS),a novel AK-AIS method is proposed.Herein,theAKmodel andMarkov chainMonte Carlo(MCMC)are first established to identify the most probable failure region(s)(MPFRs),and the adaptive kernel density estimation(AKDE)importance sampling function is constructed to select the candidate samples.With the best samples sequentially attained in the reduced candidate samples and employed to update the Kriging-fitted LSF,the failure probability and sensitivity indices are acquired at a lower cost.The proposed method is verified by twomulti-failure numerical examples,and then applied to the reliability and sensitivity analyses of a typical stator blade regulator.Withmethods comparison,the proposed AK-AIS is proven to hold the computing advantages on accuracy and efficiency in complex reliability and sensitivity analysis problems.

Short-term traffic flow online forecasting based on kernel adaptive filter

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.

Nyström kernel algorithm based on least logarithmic hyperbolic cosine loss

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.

Bandwidth adaption for kernel particle filter

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.

Theoretical convergence analysis of complex Gaussian kernel LMS algorithm

With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square（LMS） algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error（MSE） performance among of complex kernel LMS（KLMS） methods according to the specified kernel bandwidth and the length of dictionary.

Quantitative Analysis of Methanol in Methanol Gasoline by Calibration Transfer Strategy Based on Kernel Domain Adaptive Partial Least Squares(kda-PLS)

The application of near-infrared(NIR)spectroscopy combined with multivariate calibration methods can achieve the rapid analysis of methanol gasoline.However,instrumental or environmental differences found for spectra make it impossible to continuously apply the previously developed calibration model.Therefore,the calibration transfer technique would be required to solve the time-consuming and laborious problem of reestablishing a new model.In this work,a calibration transfer method named kernel domain adaptive partial least squares(kda-PLS)was applied to the calibration transfer from the primary instrument to the secondary ones.Firstly,wavelet transform(WT)and variable importance in projection(VIP)were employed to enhance the predictive performance of the kda-PLS transfer model.Then,the results found for the calibration transfer by piecewise direct standardization(PDS)and domain adaptive partial least squares(da-PLS)were compared to verify the calibration transfer(CT)effect of kda-PLS.The results point that the kda-PLS method can transfer the PLS model developed on the primary instrument to the secondary ones,and achieve results comparable to the those of reestablishing a new PLS model on the secondary instrument,with R_(P)^(2)=0.9979(R_(P)^(2):coefficients of determination of the prediction set),RMSEP=0.0040(RMSEP:root mean square error of the prediction set),and MREP=3.03%(MREP:mean relative error of the prediction set).Therefore,kda-PLS will provide a new method for quantitative analysis of methanol content in methanol gasoline.

Online prediction of EEG based on KRLST algorithm

Kernel adaptive algorithm is an extension of adaptive algorithm in nonlinear,and widely used in the field of non-stationary signal processing.But the distribution of classic data sets seems relatively regular and simple in time series.The distribution of the electroencephalograph(EEG)signal is more randomness and non-stationarity,so online prediction of EEG signal can further verify the robustness and applicability of kernel adaptive algorithms.What’s more,the purpose of modeling and analyzing the time series of EEG signals is to discover and extract valuable information,and to reveal the internal relations of EEG signals.The time series prediction of EEG plays an important role in EEG time series analysis.In this paper,kernel RLS tracker(KRLST)is presented to online predict the EEG signals of motor imagery and compared with other 13 kernel adaptive algorithms.The experimental results show that KRLST algorithm has the best effect on the brain computer interface(BCI)dataset.

Mapping Seismic Hazard for Canadian Sites Using Spatially Smoothed Seismicity Model

The estimated seismic hazard based on the delineated seismic source model is used as the basis to assign the seismic design loads in Canadian structural design codes.An alternative for the estimation is based on a spatially smoothed source model.However,a quantification of differences in the Canadian seismic hazard maps(CanSHMs)obtained based on the delineated seismic source model and spatially smoothed model is unavailable.The quantification is valuable to identify epistemic uncertainty in the estimated seismic hazard and the degree of uncertainty in the CanSHMs.In the present study,we developed seismic source models using spatial smoothing and historical earthquake catalogue.We quantified the differences in the estimated Canadian seismic hazard by considering the delineated source model and spatially smoothed source models.For the development of the spatially smoothed seismic source models,we considered spatial kernel smoothing techniques with or without adaptive bandwidth.The results indicate that the use of the delineated seismic source model could lead to under or over-estimation of the seismic hazard as compared to those estimated based on spatially smoothed seismic source models.This suggests that an epistemic uncertainty caused by the seismic source models should be considered to map the seismic hazard.