Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
From MaRDI portal
(Redirected from Publication:669282)
Recommendations
Cites work
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 3023295 (Why is no real title available?)
- A Probabilistic Nearest Neighbour Method for Statistical Pattern Recognition
- An Optimal Global Nearest Neighbor Metric
- Applied multidimensional scaling and unfolding
- Bayesian adaptive nearest neighbor
- Conformal transformation of kernel functions: A data-dependent way to improve support vector machine classifiers
- Density-ratio based clustering for discovering clusters with varying densities
- Distance metric learning for large margin nearest neighbor classification
- Half-space mass: a maximally robust and efficient data depth method
- Indefinite proximity learning: a review
- LiNearN: a new approach to nearest neighbour density estimator
- Mass estimation
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- Random forests
- Similarity-based classification: concepts and algorithms
- Statistical comparisons of classifiers over multiple data sets
- Survey on distance metric learning and dimensionality reduction in data mining
- The optimal distance measure for nearest neighbor classification
This page was built for publication: Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669282)