Optimization of k nearest neighbor density estimates
From MaRDI portal
Cited in
(18)- Weighted locally linear embedding for dimension reduction
- Higher order estimation at Lebesgue points
- On near neighbour estimates of a multivariate density
- Multivariate k-nearest neighbor density estimates
- A training sample sequence planning method for pattern recognition problems
- A weighted \(k\)-nearest neighbor density estimate for geometric inference
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Non-parametric classifier-independent feature selection
- Spatial analysis of two-dimensional orientation data
- Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
- Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
- Minimum local distance density estimation
- Necessary and sufficient condition for the existence of a limit distribution of the nearest-neighbour densitiy estimator
- Choice of the smoothing parameter and efficiency of k-nearest neighbor classification
- A Probabilistic Nearest Neighbour Method for Statistical Pattern Recognition
- SNN-PDM: an improved probability density machine algorithm based on shared nearest neighbors clustering technique
- kNN classification: a review
- Strong pointwise consistency of the \(k_T\)-occupation time density estimator
This page was built for publication: Optimization of k nearest neighbor density estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4403168)