Functional Kernel Estimation of the Conditional Extreme Quantile under Random Right Censoring

The study of estimation of conditional extreme quantile in incomplete data frameworks is of growing interest. Specially, the estimation of the extreme value index in a censorship framework has been the purpose of many investigations when finite dimension covariate information has been considered. In this paper, the estimation of the conditional extreme quantile of a heavy-tailed distribution is discussed when some functional random covariate (i.e. valued in some infinite-dimensional space) information is available and the scalar response variable is right-censored. A Weissman-type estimator of conditional extreme quantiles is proposed and its asymptotic normality is established under mild assumptions. A simulation study is conducted to assess the finite-sample behavior of the proposed estimator and a comparison with two simple estimations strategies is provided.

Asymptotics for Kernel Estimation of Slicing Average Third-Moment Estimation

To estimate central dimension-reduction space in multivariate nonparametric rcgression, Sliced Inverse Regression （SIR）, Sliced Average Variance Estimation （SAVE） and Slicing Average Third-moment Estimation （SAT） have been developed, Since slicing estimation has very different asymptotic behavior for SIR, and SAVE, the relevant study has been madc case by case, when the kernel estimators of SIH and SAVE share similar asymptotic properties. In this paper, we also investigate kernel estimation of SAT. We. prove the asymptotic normality, and show that, compared with tile existing results, the kernel Slnoothing for SIR, SAVE and SAT has very similar asymptotic behavior,

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.

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.

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.

BLOW-UP CONDITIONS FOR A SEMILINEAR PARABOLIC SYSTEM ON LOCALLY FINITE GRAPHS

In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of degree m, the initial values, and the exponents in absorption terms, we prove that every non-negative solution of the semilinear parabolic system blows up in a finite time. Our current work extends the results achieved by Lin and Wu (Calc Var Partial Differ Equ, 2017, 56: Art 102) and Wu (Rev R Acad Cien Serie A Mat, 2021, 115: Art 133).

Using Extreme Value Theory Approaches to Estimate High Quantiles for Stroke Data

This paper aims to explore the application of Extreme Value Theory (EVT) in estimating the conditional extreme quantile for time-to-event outcomes by examining the functional relationship between ambulatory blood pressure trajectories and clinical outcomes in stroke patients. The study utilizes EVT to analyze the functional connection between ambulatory blood pressure trajectories and clinical outcomes in a sample of 297 stroke patients. The 24-hour ambulatory blood pressure measurement curves for every 15 minutes are considered, acknowledging a censored rate of 40%. The findings reveal that the sample mean excess function exhibits a positive gradient above a specific threshold, confirming the heavy-tailed distribution of data in stroke patients with a positive extreme value index. Consequently, the estimated conditional extreme quantile indicates that stroke patients with higher blood pressure measurements face an elevated risk of recurrent stroke occurrence at an early stage. This research contributes to the understanding of the relationship between ambulatory blood pressure and recurrent stroke, providing valuable insights for clinical considerations and potential interventions in stroke management.

Heating load interval forecasting approach based on support vector regression and error estimation

As the existing heating load forecasting methods are almostly point forecasting,an interval forecasting approach based on Support Vector Regression (SVR) and interval estimation of relative error is proposed in this paper.The forecasting output can be defined as energy saving control setting value of heating supply substation;meanwhile,it can also provide a practical basis for heating dispatching and peak load regulating operation.By means of the proposed approach,SVR model is used to point forecasting and the error interval can be gained by using nonparametric kernel estimation to the forecast error,which avoid the distributional assumptions.Combining the point forecasting results and error interval,the forecast confidence interval is obtained.Finally,the proposed model is performed through simulations by applying it to the data from a heating supply network in Harbin,and the results show that the method can meet the demands of energy saving control and heating dispatching.

Robust estimation of time-dependent precision matrix with application to the cryptocurrency market

Most financial signals show time dependency that,combined with noisy and extreme events,poses serious problems in the parameter estimations of statistical models.Moreover,when addressing asset pricing,portfolio selection,and investment strategies,accurate estimates of the relationship among assets are as necessary as are delicate in a time-dependent context.In this regard,fundamental tools that increasingly attract research interests are precision matrix and graphical models,which are able to obtain insights into the joint evolution of financial quantities.In this paper,we present a robust divergence estimator for a time-varying precision matrix that can manage both the extreme events and time-dependency that affect financial time series.Furthermore,we provide an algorithm to handle parameter estimations that uses the“maximization–minimization”approach.We apply the methodology to synthetic data to test its performances.Then,we consider the cryptocurrency market as a real data application,given its remarkable suitability for the proposed method because of its volatile and unregulated nature.

Asymptotic Confidence Bands for Copulas Based on the Local Linear Kernel Estimator

In this paper, we establish asymptotically optimal simultaneous confidence bands for the copula function based on the local linear kernel estimator proposed by Chen and Huang [1]. For this, we prove under smoothness conditions on the derivatives of the copula a uniform in bandwidth law of the iterated logarithm for the maximal deviation of this estimator from its expectation. We also show that the bias term converges uniformly to zero with a precise rate. The performance of these bands is illustrated by a simulation study. An application based on pseudo-panel data is also provided for modeling the dependence structure of Senegalese households’ expense data in 2001 and 2006.

Effective Bandwidth Estimation in Data Networks: An Analysis for Two Traffic Characterizations

The Generalized Markov Fluid Model(GMFM)is assumed for modeling sources in the network because it is versatile to describe the traffic fluctuations.In order to estimate resources allocations or in other words the channel occupation of each source,the concept of effective bandwidth(EB)proposed by Kelly is used.In this paper we use an expression to determine the EB for this model which is of particular interest because it allows expressing said magnitude depending on the parameters of the model.This paper provides EB estimates for this model applying Kernel Estimation techniques in data networking.In particular we will study two differentiated cases:dispatches following a Gaussian and Exponential distribution.The performance of the proposed method is analyzed using simulated traffic traces generated by Monte Carlo Markov Chain algorithms.The estimation process worked much better in the Gaussian distribution case than in the Exponential one.

MODERATE DEVIATIONS AND LARGEDE VIATIONS FOR A TEST OF SYMMETRY BASED ON KERNEL DENSITY ESTIMATOR

Let fn be a non-parametric kernel density estimator based on a kernel function K. and a sequence of independent and identically distributed random variables taking values in R. The goal of this article is to prove moderate deviations and large deviations for the statistic sup ｜fn（x） - fn（-x） ｜.

A KERNEL-TYPE ESTIMATOR OF A QUANTILE FUNCTION UNDER RANDOMLY TRUNCATED DATA

A kernel-type estimator of the quantile function Q（p） = inf{t：F（t） ≥ p}, 0 ≤ p ≤ 1, is proposed based on the kernel smoother when the data are subjected to random truncation. The Bahadur-type representations of the kernel smooth estimator are established, and from Bahadur representations the authors can show that this estimator is strongly consistent, asymptotically normal, and weakly convergent.

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.

SAR images classification method based on Dempster-Shafer theory and kernel estimate

To study the scene classification in the Synthetic Aperture Radar （SAR） image, a novel method based on kernel estimate, with the Maxkov context and Dempster-Shafer evidence theory is proposed. Initially, a nonpaxametric Probability Density Function （PDF） estimate method is introduced, to describe the scene of SAR images. And then under the Maxkov context, both the determinate PDF and the kernel estimate method axe adopted respectively, to form a primary classification. Next, the primary classification results are fused using the evidence theory in an unsupervised way to get the scene classification. Finally, a regularization step is used, in which an iterated maximum selecting approach is introduced to control the fragments and modify the errors of the classification. Use of the kernel estimate and evidence theory can describe the complicated scenes with little prior knowledge and eliminate the ambiguities of the primary classification results. Experimental results on real SAR images illustrate a rather impressive performance.

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.

Improved Algorithm of Variable Bandwidth Kernel Particle Filter

Aiming at the large cost of calculating variable bandwidth kernel particle filter and the high complexity of its algorithm,a self-adjusting kernel function particle filter is presented. Kernel density estimation is facilitated to iterate and obtain new particle set. And the standard deviation of particle is introduced in the kernel bandwidth. According to the characteristics of particle distribution,the bandwidth is dynamically adjusted,and the particle distribution can thus be more close to the posterior probability density model of the system. Meanwhile,the kernel density is used to estimate the weight of updating particle and the system state. The simulation results show the feasibility and effectiveness of the proposed algorithm.

Improved estimator of the continuous-time kernel estimator

There have been many papers presenting kernel density estimators for a strictly stationary continuous time process observed over the time interval [0, T ]. However the estimators do not satisfy the property of mean-square continuity if the process is mean-square continuous. In this paper we present a modified kernel estimator and substantiate that the modified estimator satisfies the property of mean-square continuity. In a simulation study the results show the modified estimator is better than the original estimator in some cases.

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.

Optimization Strategy of Commercial Space in Xianyukou Hutong Based on Kernel Density and Space Syntax

Beijing Xianyukou Hutong(hutong refers to historical and cultural block in Chinese)occupies an important geographical location with unique urban fabric,and after years of renewal and protection,the commercial space of Xianyukou Street and has gained some recognition.This article Xianyukou takes commercial hutong in Beijing as an example,spatial analysis was carried out using methods like GIS kernel density method,space syntax after site investigation and research.Based on the street space problems found,this paper then puts forward strategies to improve and upgrade Xianyukou Street’s commercial space and improve businesses in Xianyukou Street and other similar hutong.