2014
DOI: 10.1155/2014/739640
|View full text |Cite
|
Sign up to set email alerts
|

Bandwidth Selection for Recursive Kernel Density Estimators Defined by Stochastic Approximation Method

Abstract: We propose an automatic selection of the bandwidth of the recursive kernel estimators of a probability density function defined by the stochastic approximation algorithm introduced by Mokkadem et al. (2009a). We showed that, using the selected bandwidth and the stepsize which minimize the MISE (mean integrated squared error) of the class of the recursive estimators defined in Mokkadem et al. (2009a), the recursive estimator will be better than the nonrecursive one for small sample setting in terms of estimatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
40
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 44 publications
(40 citation statements)
references
References 21 publications
0
40
0
Order By: Relevance
“…Now, in order to estimate the optimal bandwidth , we must estimate I 1 and I 2 . We followed the approach of Altman & Leger () and SLAOUI (), which is called the plug‐in estimate, and we use the following kernel estimator of I 1 : Î1=Π@@nni,k=1n@@Πk1γkbk1KbXiXkbkYi2, where K b is a kernel and b n is the associated bandwidth.…”
Section: Assumptions and Main Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…Now, in order to estimate the optimal bandwidth , we must estimate I 1 and I 2 . We followed the approach of Altman & Leger () and SLAOUI (), which is called the plug‐in estimate, and we use the following kernel estimator of I 1 : Î1=Π@@nni,k=1n@@Πk1γkbk1KbXiXkbkYi2, where K b is a kernel and b n is the associated bandwidth.…”
Section: Assumptions and Main Resultsmentioning
confidence: 99%
“…We followed the same steps as in Slaoui (), and we showed that in order to minimize the MISE of falseÎ1, the pilot bandwidth ( b n ) must equal 0.68R(Kb)μ22(Kb)REY4|X=xf2(x)dxREY2|X=xf(2)(x)f(x)dx21/5n2/5. Moreover, we showed that italicBias[]falseÎ10.57×normalΘ0.3em(Kb)1/2I12/5()double-struckRdouble-struckE[]Y2|X=xf(2)(x)0.3emf(x)0.3emdx1/5n4/51em+o()n4/5 and …”
Section: Assumptions and Main Resultsmentioning
confidence: 99%
See 3 more Smart Citations