Data-dependent k/sub n/-NN estimators consistent for arbitrary processes
暂无分享,去创建一个
Let X/sub 1/,X/sub 2/,... be an arbitrary random process taking values in a totally bounded subset of a separable metric space. Associated with X/sub i/ we observe Y/sub i/ drawn from an unknown conditional distribution F(y|X/sub i/=x) with continuous regression function m(x)=E[Y|X=/spl middot/x]. The problem of interest is to estimate Y/sub n/ based on X/sub n/ and the data {(X/sub i/,Y/sub i/)}/sub i=1//sup n-1/. We construct an appropriate data-dependent nearest neighbor estimator and show, with a very elementary proof, that it is consistent for every process X/sub 1/,X/sub 2/.
[1] Sanjeev R. Kulkarni,et al. Rates of convergence of nearest neighbor estimation under arbitrary sampling , 1995, IEEE Trans. Inf. Theory.