2000
DOI: 10.1016/s0764-4442(00)01688-8
|View full text |Cite
|
Sign up to set email alerts
|

Vitesse de convergence presque sûre de l'estimateur à noyau du mode

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2001
2001
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…In the i.i.d. case, various works such as Parzen (1962), Konakov (1973), Romano (1988) and Leclerc and Pierre-Loti-Viaud (2000) establish consistency properties of the approach under regularity assumptions. While yielding much insight into the problem, the estimator θn is hard to implement in the practice where the argmax is usually computed over a nite grid.…”
Section: Introductionmentioning
confidence: 99%
“…In the i.i.d. case, various works such as Parzen (1962), Konakov (1973), Romano (1988) and Leclerc and Pierre-Loti-Viaud (2000) establish consistency properties of the approach under regularity assumptions. While yielding much insight into the problem, the estimator θn is hard to implement in the practice where the argmax is usually computed over a nite grid.…”
Section: Introductionmentioning
confidence: 99%
“…, X n with density f . This problem has been studied by many authors, see for example Parzen [8], Konakov [5], Samanta [13], Devroye [2], Romano [10], Vieu [15], Leclerc and Pierre-Loti-Viaud [6], Mokkadem and Pelletier [7] and the references therein. Mostly, the estimateθ n of θ is defined as any maximizer of f n , i.e., where f n is a kernel density estimate Rosenblatt [11], Parzen [8], Devroye [3] .…”
Section: Introductionmentioning
confidence: 99%
“…In the univariate framework, upper bounds of the almost sure convergence rate of θ n are given in Eddy [5], Vieu [30] and Leclerc and Pierre-Loti-Viaud [14]. The exact strong convergence rate of the univariate kernel mode estimator is given in Mokkadem and Pelletier [16] who proved the following law of the iterated logarithm:…”
mentioning
confidence: 99%