An optimal k-nearest neighbor for density estimation
A 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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
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.
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:82:y:2012:i:10:p:1786-1791. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.