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

DOI10.1007/S10994-018-5737-XzbMATH Open1480.62134OpenAlexW2810692338MaRDI QIDQ669282FDOQ669282

Authors: Kai Ming Ting, Ye Zhu, Yue Zhu, Takashi Washio, Zhi-Hua Zhou, 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

Recommendations

• Effect of choice of dissimilarity measure on classification efficiency with nearest neighbor method
• Distance metric learning for large margin nearest neighbor classification
• scientific article; zbMATH DE number 2222699
• Rough Sets and Current Trends in Computing
• The Metric Nearness Problem

zbMATH Keywords

clusteringclassificationdistance metricnearest neighbourlowest probability mass neighbourmass-based dissimilarity

Mathematics Subject Classification ID

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

Cites Work

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

Uses Software

• UCI-ml
• LMNN
• IsolationForest

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)