2002
DOI: 10.1006/jmva.2001.2021
|View full text |Cite
|
Sign up to set email alerts
|

New Multivariate Product Density Estimators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 30 publications
(11 citation statements)
references
References 20 publications
0
11
0
Order By: Relevance
“…For example, using an L p norm on the d-vectors of differences between ranks, one can show that the classical k-NN regression function estimate is universally consistent in the sense of Stone [37]. This was observed by Olshen [30], and shown by Devroye [8] (see also [15,16,10,2] for related works). Rules based upon statistically equivalent blocks (see, e.g., [1,34,13,14], and [9, Section 21.4]) are other important examples of regression methods invariant with respect to monotone transformations of the coordinate axes.…”
Section: Introductionmentioning
confidence: 61%
“…For example, using an L p norm on the d-vectors of differences between ranks, one can show that the classical k-NN regression function estimate is universally consistent in the sense of Stone [37]. This was observed by Olshen [30], and shown by Devroye [8] (see also [15,16,10,2] for related works). Rules based upon statistically equivalent blocks (see, e.g., [1,34,13,14], and [9, Section 21.4]) are other important examples of regression methods invariant with respect to monotone transformations of the coordinate axes.…”
Section: Introductionmentioning
confidence: 61%
“…4. The k -nearest neighbor distribution density estimator (NNDE), which is based on the distance to the nearest k observation position evaluation to the tested random dimension and has been examined by Devroye and Krzyżak [9];…”
Section: The Density Estimation Algorithms Analysedmentioning
confidence: 99%
“…is the k-th nearest x neighbor in the whole sample of observations {X(t), t = 1, ..., n}. k is the nearest neighbor density estimator depending on the coordinate system, as the distances vary after their changes x − X(t) , 1 ≤ t ≤ n. In order to avoid this dependence, the following changes are introduced [9]:…”
Section: The Density Estimation Algorithms Analysedmentioning
confidence: 99%
See 1 more Smart Citation
“…Note from Lemma 1.1 and (1.7) and (1.8) thatĥ N (x) bears the same relationship to B (N ) andF N that h N (x) does to B (N ) and F . One can show thatĥ N (X) → h(X) in various senses as N grows without bound; see, for example, [8], Theorem 12.7 of [1] and [4,5,10,11,14]. A particularly strong notion of convergence, but one that matters for applications, is unconditional almost sure convergence, where "unconditional" is meant with respect to the learning sample and test case.…”
Section: Definitions and Notationmentioning
confidence: 99%