Enhancing microseismic/acoustic emission source localization accuracy with an outlier-robust kernel density estimation approach

Monitoring sensors in complex engineering environments often record abnormal data,leading to significant positioning errors.To reduce the influence of abnormal arrival times,we introduce an innovative,outlier-robust localization method that integrates kernel density estimation(KDE)with damping linear correction to enhance the precision of microseismic/acoustic emission(MS/AE)source positioning.Our approach systematically addresses abnormal arrival times through a three-step process:initial location by 4-arrival combinations,elimination of outliers based on three-dimensional KDE,and refinement using a linear correction with an adaptive damping factor.We validate our method through lead-breaking experiments,demonstrating over a 23%improvement in positioning accuracy with a maximum error of 9.12 mm(relative error of 15.80%)—outperforming 4 existing methods.Simulations under various system errors,outlier scales,and ratios substantiate our method’s superior performance.Field blasting experiments also confirm the practical applicability,with an average positioning error of 11.71 m(relative error of 7.59%),compared to 23.56,66.09,16.95,and 28.52 m for other methods.This research is significant as it enhances the robustness of MS/AE source localization when confronted with data anomalies.It also provides a practical solution for real-world engineering and safety monitoring applications.

Bayesian Classifier Based on Robust Kernel Density Estimation and Harris Hawks Optimisation

In real-world applications, datasets frequently contain outliers, which can hinder the generalization ability of machine learning models. Bayesian classifiers, a popular supervised learning method, rely on accurate probability density estimation for classifying continuous datasets. However, achieving precise density estimation with datasets containing outliers poses a significant challenge. This paper introduces a Bayesian classifier that utilizes optimized robust kernel density estimation to address this issue. Our proposed method enhances the accuracy of probability density distribution estimation by mitigating the impact of outliers on the training sample’s estimated distribution. Unlike the conventional kernel density estimator, our robust estimator can be seen as a weighted kernel mapping summary for each sample. This kernel mapping performs the inner product in the Hilbert space, allowing the kernel density estimation to be considered the average of the samples’ mapping in the Hilbert space using a reproducing kernel. M-estimation techniques are used to obtain accurate mean values and solve the weights. Meanwhile, complete cross-validation is used as the objective function to search for the optimal bandwidth, which impacts the estimator. The Harris Hawks Optimisation optimizes the objective function to improve the estimation accuracy. The experimental results show that it outperforms other optimization algorithms regarding convergence speed and objective function value during the bandwidth search. The optimal robust kernel density estimator achieves better fitness performance than the traditional kernel density estimator when the training data contains outliers. The Naïve Bayesian with optimal robust kernel density estimation improves the generalization in the classification with outliers.

Visualising data distributions with kernel density estimation and reduced chi-squared statistic

The application of frequency distribution statistics to data provides objective means to assess the nature of the data distribution and viability of numerical models that are used to visualize and interpret data.Two commonly used tools are the kernel density estimation and reduced chi-squared statistic used in combination with a weighted mean.Due to the wide applicability of these tools,we present a Java-based computer application called KDX to facilitate the visualization of data and the utilization of these numerical tools.

Probability distribution of wind power volatility based on the moving average method and improved nonparametric kernel density estimation

In the process of large-scale,grid-connected wind power operations,it is important to establish an accurate probability distribution model for wind farm fluctuations.In this study,a wind power fluctuation modeling method is proposed based on the method of moving average and adaptive nonparametric kernel density estimation(NPKDE)method.Firstly,the method of moving average is used to reduce the fluctuation of the sampling wind power component,and the probability characteristics of the modeling are then determined based on the NPKDE.Secondly,the model is improved adaptively,and is then solved by using constraint-order optimization.The simulation results show that this method has a better accuracy and applicability compared with the modeling method based on traditional parameter estimation,and solves the local adaptation problem of traditional NPKDE.

Kernel density estimation and marginalized-particle based probability hypothesis density filter for multi-target tracking

In order to improve the performance of the probability hypothesis density(PHD) algorithm based particle filter(PF) in terms of number estimation and states extraction of multiple targets, a new probability hypothesis density filter algorithm based on marginalized particle and kernel density estimation is proposed, which utilizes the idea of marginalized particle filter to enhance the estimating performance of the PHD. The state variables are decomposed into linear and non-linear parts. The particle filter is adopted to predict and estimate the nonlinear states of multi-target after dimensionality reduction, while the Kalman filter is applied to estimate the linear parts under linear Gaussian condition. Embedding the information of the linear states into the estimated nonlinear states helps to reduce the estimating variance and improve the accuracy of target number estimation. The meanshift kernel density estimation, being of the inherent nature of searching peak value via an adaptive gradient ascent iteration, is introduced to cluster particles and extract target states, which is independent of the target number and can converge to the local peak position of the PHD distribution while avoiding the errors due to the inaccuracy in modeling and parameters estimation. Experiments show that the proposed algorithm can obtain higher tracking accuracy when using fewer sampling particles and is of lower computational complexity compared with the PF-PHD.

Kernel Density Estimation of Tropical Cyclone Frequencies in the North Atlantic Basin

Previous research has identified specific areas of frequent tropical cyclone activity in the North Atlantic basin. This study examines long-term and decadal spatio-temporal patterns of Atlantic tropical cyclone frequencies from 1944 to 2009, and analyzes categorical and decadal centroid patterns using kernel density estimation (KDE) and centrographic statistics. Results corroborate previous research which has suggested that the Bermuda-Azores anticyclone plays an integral role in the direction of tropical cyclone tracks. Other teleconnections such as the North Atlantic Oscillation (NAO) may also have an impact on tropical cyclone tracks, but at a different temporal resolution. Results expand on existing knowledge of the spatial trends of tropical cyclones based on storm category and time through the use of spatial statistics. Overall, location of peak frequency varies by tropical cyclone category, with stronger storms being more concentrated in narrow regions of the southern Caribbean Sea and Gulf of Mexico, while weaker storms occur in a much larger area that encompasses much of the Caribbean Sea, Gulf of Mexico, and Atlantic Ocean off of the east coast of the United States. Additionally, the decadal centroids of tropical cyclone tracks have oscillated over a large area of the Atlantic Ocean for much of recorded history. Data collected since 1944 can be analyzed confidently to reveal these patterns.

AN EFFECTIVE IMAGE RETRIEVAL METHOD BASED ON KERNEL DENSITY ESTIMATION OF COLLAGE ERROR AND MOMENT INVARIANTS

In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.

Diversity Sampling Based Kernel Density Estimation for Background Modeling

A novel diversity-sampling based nonparametric multi-modal background model is proposed. Using the samples having more popular and various intensity values in the training sequence, a nonparametric model is built for background subtraction. According to the related intensifies, different weights are given to the distinct samples in kernel density estimation. This avoids repeated computation using all samples, and makes computation more efficient in the evaluation phase. Experimental results show the validity of the diversity- sampling scheme and robustness of the proposed model in moving objects segmentation. The proposed algorithm can be used in outdoor surveillance systems.

Improved Logistic Regression Algorithm Based on Kernel Density Estimation for Multi-Classification with Non-Equilibrium Samples

Logistic regression is often used to solve linear binary classification problems such as machine vision,speech recognition,and handwriting recognition.However,it usually fails to solve certain nonlinear multi-classification problem,such as problem with non-equilibrium samples.Many scholars have proposed some methods,such as neural network,least square support vector machine,AdaBoost meta-algorithm,etc.These methods essentially belong to machine learning categories.In this work,based on the probability theory and statistical principle,we propose an improved logistic regression algorithm based on kernel density estimation for solving nonlinear multi-classification.We have compared our approach with other methods using non-equilibrium samples,the results show that our approach guarantees sample integrity and achieves superior classification.

Density Estimation Using Gumbel Kernel Estimator

In this article, our proposed kernel estimator, named as Gumbel kernel, which broadened the class of non-negative, asymmetric kernel density estimators. Such kernel estimator can be used in nonparametric estimation of the probability density function (pdf). When the density functions have limited bounded support on [0, ∞) and they are liberated of boundary bias, always non-negative and obtain the optimal rate of convergence for the mean integrated squared error (MISE). The bias, variance and the optimal bandwidth of the proposed estimators are investigated on theoretical grounds as well as on simulation basis. Further, the applicability of the proposed estimator is compared to Weibull kernel estimator, where performance of newly proposed kernel is outstanding.

Performance Evaluation of Various Functions for Kernel Density Estimation

There have been vast amount of studies on background modeling to detect moving objects. Two recent reviews[1,2] showed that kernel density estimation(KDE) method and Gaussian mixture model(GMM) perform about equally best among possible background models. For KDE, the selection of kernel functions and their bandwidths greatly influence the performance. There were few attempts to compare the adequacy of functions for KDE. In this paper, we evaluate the performance of various functions for KDE. Functions tested include almost everyone cited in the literature and a new function, Laplacian of Gaussian(LoG) is also introduced for comparison. All tests were done on real videos with vary-ing background dynamics and results were analyzed both qualitatively and quantitatively. Effect of different bandwidths was also investigated.

ESSENTIAL RELATIONSHIP BETWEEN DOMAIN-BASED ONE-CLASS CLASSIFIERS AND DENSITY ESTIMATION

One-class support vector machine （OCSVM） and support vector data description （SVDD） are two main domain-based one-class （kernel） classifiers. To reveal their relationship with density estimation in the case of the Gaussian kernel, OCSVM and SVDD are firstly unified into the framework of kernel density estimation, and the essential relationship between them is explicitly revealed. Then the result proves that the density estimation induced by OCSVM or SVDD is in agreement with the true density. Meanwhile, it can also reduce the integrated squared error （ISE）. Finally, experiments on several simulated datasets verify the revealed relationships.

Some Improvement on Convergence Rates of Kernel Density Estimator

In this paper two kernel density estimators are introduced and investigated. In order to reduce bias, we intuitively subtract an estimated bias term from ordinary kernel density estimator. The second proposed density estimator is a geometric extrapolation of the first bias reduced estimator. Theoretical properties such as bias, variance and mean squared error are investigated for both estimators. To observe their finite sample performance, a Monte Carlo simulation study based on small to moderately large samples is presented.

ASYMPTOTIC NORMALITY OF KERNEL ESTIMATES OF A DENSITY FUNCTION UNDER ASSOCIATION DEPENDENCE

Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.

A KERNEL ESTIMATOR OF A DENSITY FUNCTION IN MULTIVARIATE CASE FROM RANDOMLY CENSORED DATA

A kernel density estimator is proposed when tile data are subject to censorship in multivariate case. The asymptotic normality, strong convergence and asymptotic optimal bandwidth which minimize the mean square error of the estimator are studied.

我国护理人力资源区域差异的演变特征——基于Dagum基尼系数分解和Kernel核密度估计的实证研究

目的分析我国护理人力资源的区域差异及分布动态演进,为我国护理人力资源的合理配置和规划提供参考。方法基于2011-2022年省级护理人力资源面板数据,通过测算Kernel密度和Dagum基尼系数对我国护理人力资源的区域差异及分布动态演进进行分析评价。结果2011-2022年,在空间分布上,全国及各地区护理人力资源总量呈增加趋势,各区域差异逐步降低,且两极化特征明显;在区域差异上,我国护理人力资源总体差异均值为0.1149;区域内呈东部>西部>中部>东北区域的梯度逐步递增趋势;区域间差异占总体差异的40.61%。结论全国护理人力资源总体差异处于相对合理状态,区域间差异是主要来源,均等化水平逐步提升;政府应针对各区域精准施策,进一步稳定护理人力资源队伍,完善护理人力资源结构以促进护理人力资源的优质均衡发展。

APPROXIMATION RATES OF ERROR DISTRIBUTION OF DOUBLE KERNEL ESTIMATES OF CONDITIONAL DENSITY

In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to construct the confidence interval of f(y|x) .

Spatiotemporal Patterns of Road Network and Road Development Pri-ority in Three Parallel Rivers Region in Yunnan,China:An Evaluation Based on Modified Kernel Distance Estimate

Road network is a critical component of public infrastructure,and the supporting system of social and economic development.Based on a modified kernel density estimate(KDE)algorithm,this study evaluated the road service capacity provided by a road network composed of multi-level roads(i.e.national,provincial,county and rural roads),by taking account of the differences of effect extent and intensity for roads of different levels.Summarized at town scale,the population burden and the annual rural economic income of unit road service capacity were used as the surrogates of social and economic demands for road service.This method was applied to the road network of the Three Parallel River Region,the northwestern Yunnan Province,China to evaluate the development of road network in this region.In results,the total road length of this region in 2005 was 3.70×104km,and the length ratio between national,provincial,county and rural roads was 1∶2∶8∶47.From 1989 to 2005,the regional road service capacity increased by 13.1%,of which the contributions from the national,provincial,county and rural roads were 11.1%,19.4%,22.6%,and 67.8%,respectively,revealing the effect of′All Village Accessible′policy of road development in the mountainous regions in the last decade.The spatial patterns of population burden and economic requirement of unit road service suggested that the areas farther away from the national and provincial roads have higher road development priority(RDP).Based on the modified KDE model and the framework of RDP evaluation,this study provided a useful approach for developing an optimal plan of road development at regional scale.

Data driven particle size estimation of hematite grinding process using stochastic configuration network with robust technique

As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configuration network(SCN)with robust technique,namely,robust SCN(RSCN).Firstly,this paper proves the universal approximation property of RSCN with weighted least squares technique.Secondly,three robust algorithms are presented by employing M-estimation with Huber loss function,M-estimation with interquartile range(IQR)and nonparametric kernel density estimation(NKDE)function respectively to set the penalty weight.Comparison experiments are first carried out based on the UCI standard data sets to verify the effectiveness of these methods,and then the data-driven PS model based on the robust algorithms are established and verified.Experimental results show that the RSCN has an excellent performance for the PS estimation.

A NON-PARAMETER BAYESIAN CLASSIFIER FOR FACE RECOGNITION

A non-parameter Bayesian classifier based on Kernel Density Estimation (KDE)is presented for face recognition, which can be regarded as a weighted Nearest Neighbor (NN)classifier in formation. The class conditional density is estimated by KDE and the bandwidthof the kernel function is estimated by Expectation Maximum (EM) algorithm. Two subspaceanalysis methods-linear Principal Component Analysis (PCA) and Kernel-based PCA (KPCA)are respectively used to extract features, and the proposed method is compared with ProbabilisticReasoning Models (PRM), Nearest Center (NC) and NN classifiers which are widely used in facerecognition systems. The experiments are performed on two benchmarks and the experimentalresults show that the KDE outperforms PRM, NC and NN classifiers.