paper-with-me

홈 › Papers

Large Margin Nearest Neighbor Classification using Curved Mahalanobis Distances

2016-09-22 · Frank Nielsen, Boris Muzellec, Richard Nock

We consider the supervised classification problem of machine learning in Cayley-Klein projective geometries: We show how to learn a curved Mahalanobis metric distance corresponding to either the hyperbolic geometry or the elliptic geometry using the Large Margin Nearest Neighbor (LMNN) framework. We report on our experimental results, and further consider the case of learning a mixed curved Mahalanobis distance. Besides, we show that the Cayley-Klein Voronoi diagrams are affine, and can be built from an equivalent (clipped) power diagrams, and that Cayley-Klein balls have Mahalanobis shapes with displaced centers.

📄 PDF Abstract BibTeX arXiv:1609.07082

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningClassificationGeneral Classification

Similar Papers 제목 키워드 기반

Acceleration of Large Margin Metric Learning for Nearest Neighbor Classification Using Triplet Mining and Stratified Sampling

2020-09-29 · Parisa Abdolrahim Poorheravi, Benyamin Ghojogh, Vincent Gaudet, Fakhri Karray 외

Metric learning is one of the techniques in manifold learning with the goal of finding a projection subspace for increasing and decreasing the inter- and intra-class variances, respectively. Some of the metric learning m…

Metric LearningTriplet

Discriminative Learning of the Prototype Set for Nearest Neighbor Classification

2015-09-27 · Shin Ando

The nearest neighbor rule is a classic yet essential classification model, particularly in problems where the supervising information is given by pairwise dissimilarities and the embedding function are not easily obtaine…

ClassificationGeneral ClassificationPrototype Selection

Near-optimal sample compression for nearest neighbors

2014-04-13 · NeurIPS 2014 12 · Lee-Ad Gottlieb, Aryeh Kontorovich, Pinhas Nisnevitch

We present the first sample compression algorithm for nearest neighbors with non-trivial performance guarantees. We complement these guarantees by demonstrating almost matching hardness lower bounds, which show that our …

General Classification

Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions

2014-11-04 · Sébastien Gadat, Thierry Klein, Clément Marteau

Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \leq i \leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \textit{optimally} predict the label $Y$ of a given a new obs…

General Classification

Nearest Neighbor Classifier with Margin Penalty for Active Learning

2022-03-17 · Yuan Cao, Zhiqiao Gao, Jie Hu, MingChuan Yang 외

As deep learning becomes the mainstream in the field of natural language processing, the need for suitable active learning method are becoming unprecedented urgent. Active Learning (AL) methods based on nearest neighbor …

Active Learning