共查询到20条相似文献,搜索用时 15 毫秒
1.
Li?Wang Han-Ying?Liang "author-information "> "author-information__contact u-icon-before "> "mailto:hyliang@hotmail.com " title= "hyliang@hotmail.com " itemprop= "email " data-track= "click " data-track-action= "Email author " data-track-label= " ">Email author 《Metrika》2004,59(3):245-261
Suppose the observations (Xi, Yi) taking values in Rd×R, are -mixing. Compared with the i.i.d. case, some known strong uniform convergence results for the estimators of the regression function r(x)=E(Yi|Xi=x) need strong moment conditions under -mixing setting. We consider the following improved kernel estimators of r(x) suggested by Cheng (1983): Qian and Mammitzsch (2000) investigated the strong uniform convergence and convergence rate for to r(x) under weaker moment conditions than those of the others in the literature, and the optimal convergence rate can be attained under almost the same conditions as stated in Theorem 3.3.2 of Györfi et al. (1989). In this paper, under the similar conditions of Qian and Mammitzsch (2000), we study the strong uniform convergence and convergence rates for (j=2,3) to r(x), which have not been discussed by Qian and Mammitzsch (2000). In contrast to , our estimators and are recursive, which is highly desirable for practical computation. 相似文献
2.
Mustapha Rachdi Ali Laksaci Zoulikha Kaid Abbassia Benchiha Fahimah A. Al‐Awadhi 《Statistica Neerlandica》2021,75(1):42-65
We combine the k‐Nearest Neighbors (kNN) method to the local linear estimation (LLE) approach to construct a new estimator (LLE‐kNN) of the regression operator when the regressor is of functional type and the response variable is a scalar but observed with some missing at random (MAR) observations. The resulting estimator inherits many of the advantages of both approaches (kNN and LLE methods). This is confirmed by the established asymptotic results, in terms of the pointwise and uniform almost complete consistencies, and the precise convergence rates. In addition, a numerical study (i) on simulated data, then (ii) on a real dataset concerning the sugar quality using fluorescence data, were conducted. This practical study clearly shows the feasibility and the superiority of the LLE‐kNN estimator compared to competitive estimators. 相似文献
3.
Summary A new multivariate kernel probability density estimator is introduced and its strong uniform consistency is proved under certain regularity conditions. This result is then applied particularly to a kernel estimator whose mean vector and covariance matrix areμ n andV n, respectively, whereμ n is an unspecified estimator of the mean vector andV n, up to a multiplicative constant, the sample covariance matrix of the probability density to be estimated, respectively. Work supported by the Natural Sciences and Engineering Research Council of Canada and by the Fonds F.C.A.R. of the Province of Quebec. 相似文献
4.
Rough-and-ready assessment of the degree and importance of smoothing in functional estimation 总被引:1,自引:0,他引:1
M. C. Jones 《Statistica Neerlandica》2000,54(1):37-46
In nonparametric estimation of functionals of a distribution, it may or may not be desirable, or indeed necessary, to introduce a degree of smoothing into this estimation. In this article, I describe a method for assessing, with just a little thought about the functional of interest, (i) whether smoothing is likely to prove worthwhile, and (ii) if so, roughly how much smoothing is appropriate (in order-of-magnitude terms). This rule-of-thumb is not guaranteed to be accurate nor does it give a complete answer to the smoothing problem. However, I have found it very useful over a number of years; many examples of its use, and limitations, are given. 相似文献
5.
Abstract A class of empirical Bayes estimators (EBE's) is proposed for estimating the natural parameter of a one-parameter exponential family. In contrast to related EBE's proposed and investigated until now, the EBE's presented in this paper possess the nice property of being monotone by construction. Based on an arbitrary reasonable estimator of the underlying marginal density, a simple algorithm is given to construct a monotone EBE. Two representations of these EBE's are given, one of which serves as a tool in establishing asymptotic results, while the other one, related with isotonic regression, proves useful in the actual computation. 相似文献
6.
Relative efficiency and deficiency of kernel type estimators of smooth distribution functions 总被引:4,自引:0,他引:4
M. Falk 《Statistica Neerlandica》1983,37(2):73-83
Abstract The problem is investigated whether a given kernel type estimator of a distribution function at a single point has asymptotically better performance than the empirical estimator. A representation of the relative deficiency of the empirical distribution function with respect to a kernel type estimator is established which gives a complete solution to this problem. The problem of finding optimal kernels is studied in detail. 相似文献
7.
自Granger提出整数阶单整向量序列的协整概念以来,协整理论在国内外学者的共同努力下不断得到完善。关于向量时间序列的分数维单整的研究主要集中在分整的线性协整的存在性条件及性质研究。文中通过引入交换条件数学期望算法(ACE),研究分整时间序列的非线性变换的协整性,对最优非线性变换函数进行估计。 相似文献
8.
For contingency tables with extensive missing data, the unrestricted MLE under the saturated model, computed by the EM algorithm,
is generally unsatisfactory. In this case, it may be better to fit a simpler model by imposing some restrictions on the parameter
space. Perlman and Wu (1999) propose lattice conditional independence (LCI) models for contingency tables with arbitrary missing data patterns. When this LCI model fits well, the restricted MLE under the LCI model is more accurate than the unrestricted
MLE under the saturated model, but not in general. Here we propose certain empirical Bayes (EB) estimators that adaptively
combine the best features of the restricted and unrestricted MLEs. These EB estimators appear to be especially useful when
the observed data is sparse, even in cases where the suitability of the LCI model is uncertain. We also study a restricted
EM algorithm (called the ER algorithm) with similar desirable features.
Received: July 1999 相似文献
9.
The authors consider the problem of estimating a conditional density by a conditional kernel density estimate when the error associated with the estimate is measured by the L1‐norm. On the basis of the combinatorial method of Devroye and Lugosi ( 1996 ), they propose a method for selecting the bandwidths adaptively and for providing a theoretical justification of the approach. They use simulated data to illustrate the finite‐sample performance of their estimator. 相似文献
10.
Suppose the observations (X
i,Y
i), i=1,…, n, are ϕ-mixing. The strong uniform convergence and convergence rate for the estimator of the regression function was studied
by serveral authors, e.g. G. Collomb (1984), L. Gy?rfi et al. (1989). But the optimal convergence rates are not reached unless
the Y
i are bounded or the E exp (a|Y
i|) are bounded for some a>0. Compared with the i.i.d. case the convergence of the Nadaraya-Watson estimator under ϕ-mixing variables needs strong moment
conditions. In this paper we study the strong uniform convergence and convergence rate for the improved kernel estimator of
the regression function which has been suggested by Cheng P. (1983). Compared with Theorem A in Y. P. Mack and B. Silverman
(1982) or Theorem 3.3.1 in L. Gy?rfi et al. (1989), we prove the convergence for this kind of estimators under weaker moment
conditions. The optimal convergence rate for the improved kernel estimator is attained under almost the same conditions of
Theorem 3.3.2 in L. Gy?rfi et al. (1989).
Received: September 1999 相似文献
11.
《Spatial Economic Analysis》2013,8(4):451-471
Abstract This paper demonstrates an evaluation of welfare policies and regional allocation of public investment using the recent developments in efficiency analysis and statistical inference. Specifically, the efficiency of the welfare policies of the Greek prefectures for the census years of 1980, 1990 and 2000 are compared and analyzed. The paper, using bootstrap techniques on unconditional and conditional full frontier applications, indicates that there are major welfare inefficiencies among the prefectures over the three census years. The analysis reveals that the increase of population density over the years has a negative impact on the welfare efficiency levels of the Greek prefectures. RÉSUMÉ Cette communication démontre une évaluation des politiques sociales et de l'affectation régionale d'investissements publics, sur la base de développements récents dans l'analyse du rendement et des conclusions statistiques. Plus spécifiquement, nous comparaisons et nous analysons l'efficacité des politiques sociales des préfectures grecques pour les années de recensement 1980, 1990 et 2000. En appliquant des techniques de rééchantillonnage à des applications à frontières intégrales inconditionnelles et conditionnelles, la communication démontre que les années de recensement ont été marquées par l'existence d'une grande inefficacité sur le plan social, parmi les préfectures. L'analyse révèle que l'augmentation de la densité de la population a, au fil des années, eu un effet négatif sur l'efficacité des préfectures de la Grèce sur le plan social. R esumen Este estudio demuestra una evaluación de las políticas de beneficios sociales y la distribución regional de la inversión pública usando los recientes desarrollos en análisis de eficiencia e inferencia estadística. Específicamente, se compara y analiza la eficiencia de las políticas de beneficios sociales de las prefecturas griegas en los años de censo 1980, 1990 y 2000. El estudio que usa técnicas bootstrap en las aplicaciones de frontera completa incondicionales y condicionales indica que existen importantes ineficiencias en los beneficios sociales entre las prefecturas durante los tres años censados. El análisis revela que el aumento de la densidad de la población a través de los años tiene un impacto negativo en los niveles de eficiencia de los beneficios sociales en las prefecturas griegas. 相似文献
12.
Characterizations of normal distributions given by Nguyen and Dinh (1998) based on conditional expected values of the sample
skewness and the sample kurtosis, given the sample mean and the sample variance, are shown to be stable.
Received: September 1998 相似文献
13.
In this note, we will consider the problem of recovering an unknown input function when the output function is observed in its entirety, blurred with functional error. An estimator is constructed whose risk converges at an optimal rate. In this functional model, convergence rates of order 1/n (n is the sample size) are possible, provided that the error distribution is sufficiently concentrated so as to compensate for the ill‐posedness of the inverse of the model operator. 相似文献
14.
The exact forms of the locally minimum variance unbiased estimators and their variances are given in the case of a discontinuous density function. 相似文献
15.
We consider nonlinear heteroscedastic single‐index models where the mean function is a parametric nonlinear model and the variance function depends on a single‐index structure. We develop an efficient estimation method for the parameters in the mean function by using the weighted least squares estimation, and we propose a “delete‐one‐component” estimator for the single‐index in the variance function based on absolute residuals. Asymptotic results of estimators are also investigated. The estimation methods for the error distribution based on the classical empirical distribution function and an empirical likelihood method are discussed. The empirical likelihood method allows for incorporation of the assumptions on the error distribution into the estimation. Simulations illustrate the results, and a real chemical data set is analyzed to demonstrate the performance of the proposed estimators. 相似文献
16.
D. A. Ioannides 《Metrika》1999,50(1):19-35
Let {(X i, Y i,)}, i≥1, be a strictly stationary process from noisy observations. We examine the effect of the noise in the response Y and the covariates X on the nonparametric estimation of the conditional mode function. To estimate this function we are using deconvoluting kernel estimators. The asymptotic behavior of these estimators depends on the smoothness of the noise distribution, which is classified as either ordinary smooth or super smooth. Uniform convergence with almost sure convergence rates is established for strongly mixing stochastic processes, when the noise distribution is ordinary smooth. Received: April 1998 相似文献
17.
M. N. M. van Lieshout 《Statistica Neerlandica》2011,65(2):183-201
We propose new summary statistics for intensity‐reweighted moment stationary point processes, that is, point processes with translation invariant n‐point correlation functions for all , that generalise the well known J‐, empty space, and spherical Palm contact distribution functions. We represent these statistics in terms of generating functionals and relate the inhomogeneous J‐function to the inhomogeneous reduced second moment function. Extensions to space time and marked point processes are briefly discussed. 相似文献
18.
《International Journal of Forecasting》2019,35(4):1304-1317
This paper is concerned with the forecasting of probability density functions. Density functions are nonnegative and have a constrained integral, and thus do not constitute a vector space. The implementation of established functional time series forecasting methods for such nonlinear data is therefore problematic. Two new methods are developed and compared to two existing methods. The comparison is based on the densities derived from cross-sectional and intraday returns. For such data, one of our new approaches is shown to dominate the existing methods, while the other is comparable to one of the existing approaches. 相似文献
19.
Giovanna Menardi 《Revue internationale de statistique》2016,84(3):413-433
In spite of the current availability of numerous methods of cluster analysis, evaluating a clustering configuration is questionable without the definition of a true population structure, representing the ideal partition that clustering methods should try to approximate. A precise statistical notion of cluster, unshared by most of the mainstream methods, is provided by the density‐based approach, which assumes that clusters are associated to some specific features of the probability distribution underlying the data. The non‐parametric formulation of this approach, known as modal clustering, draws a correspondence between the groups and the modes of the density function. An appealing implication is that the ill‐specified task of cluster detection can be regarded to as a more circumscribed problem of estimation, and the number of clusters is also conceptually well defined. In this work, modal clustering is critically reviewed from both conceptual and operational standpoints. The main directions of current research are outlined as well as some challenges and directions of further research. 相似文献
20.
Thao Nguyen-Trang;Tai Vo-Van;Ha Che-Ngoc; 《Statistica Neerlandica》2024,78(1):244-260
Clustering is a technique used to partition a dataset into groups of similar elements. In addition to traditional clustering methods, clustering for probability density functions (CDF) has been studied to capture data uncertainty. In CDF, automatic clustering is a clever technique that can determine the number of clusters automatically. However, current automatic clustering algorithms update the new probability density function (pdf) fi(t)$$ {f}_i(t) $$ based on the weighted mean of all previous pdfs fj(t−1),j=1,2,…,N$$ {f}_jleft(t-1right),j=1,2,dots, N $$, resulting in slow convergence. This paper proposes an efficient automatic clustering algorithm for pdfs. In the proposed approach, the update of fi(t)$$ {f}_i(t) $$ is based on the weighted mean of f1(t),f2(t),…,fi−1(t),fi(t−1),fi+1(t−1),…,fN(t−1)$$ left{{f}_1(t),{f}_2(t),dots, {f}_{i-1}(t),{f}_ileft(t-1right),{f}_{i+1}left(t-1right),dots, {f}_Nleft(t-1right)right} $$, where N$$ N $$ is the number of pdfs and i=1,2,…,N$$ i=1,2,dots, N $$. This technique allows for the incorporation of recently updated pdfs, leading to faster convergence. This paper also pioneers the applications of certain CDF algorithms in the field of surface image recognition. The numerical examples demonstrate that the proposed method can result in a rapid convergence at some early iterations. It also outperforms other state-of-the-art automatic clustering methods in terms of the Adjusted Rand Index and the Normalized Mutual Information. Additionally, the proposed algorithm proves to be competitive when clustering material images contaminated by noise. These results highlight the applicability of the proposed method in the problem of surface image recognition. 相似文献