An optimal k-nearest neighbor for density estimation
AbstractA k-nearest neighbor method, which has been widely applied in machine learning, is a useful tool to obtain statistical inference for an underlying distribution of multi-dimensional data. However, the knowledge on choosing an optimal order for the k-nearest neighbor is relatively little. This paper proposes an asymptotic distribution for the nearest neighbor statistic. Under some conditions, we find an optimal unbiased density estimate based on a linear combination of nearest neighbors, and it leads to an optimal choice for the order of the k-nearest neighbor.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Statistics & Probability Letters.
Volume (Year): 82 (2012)
Issue (Month): 10 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mack, Y. P. & Rosenblatt, M., 1979. "Multivariate k-nearest neighbor density estimates," Journal of Multivariate Analysis, Elsevier, vol. 9(1), pages 1-15, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.