Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms

DOI10.1007/s10994-018-5737-xzbMath1480.62134OpenAlexW2810692338MaRDI QIDQ669282

Zhi-Hua Zhou, Kai Ming Ting, Yue Zhu, Ye Zhu, Takashi Washio, Mark J. Carman

Publication date: 15 March 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5737-x

zbMATH Keywords

classificationclusteringdistance metricnearest neighbourlowest probability mass neighbourmass-based dissimilarity

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Uses Software

• UCI-ml
• LMNN
• IsolationForest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Half-space mass: a maximally robust and efficient data depth method
• Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
• Applied multidimensional scaling and unfolding
• Survey on distance metric learning and dimensionality reduction in data mining
• Conformal transformation of kernel functions: A data-dependent way to improve support vector machine classifiers
• Mass estimation
• Density-ratio based clustering for discovering clusters with varying densities
• LiNearN: a new approach to nearest neighbour density estimator
• An Optimal Global Nearest Neighbor Metric
• The optimal distance measure for nearest neighbor classification
• A Probabilistic Nearest Neighbour Method for Statistical Pattern Recognition
• Bayesian adaptive nearest neighbor
• Indefinite Proximity Learning: A Review
• Random forests

This page was built for publication: Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms