Nearest Neighbor Classifier based on Generalized Inter-point Distances for HDLSS Data

02/08/2019
by   Sarbojit Roy, et al.
0

In high dimension, low sample size (HDLSS) settings, Euclidean distance based classifiers suffer from curse of dimensionality if the competing populations are similar in terms of their location and scale parameters. In this article, we propose a classifier which can discriminate between populations having different marginal distributions. A generalization of the proposed classifier has been developed to differentiate between populations having different joint distributions for the component variables. Performance of the proposed classifiers are demonstrated using a variety of simulated data sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2020

On a Generalization of the Average Distance Classifier

In high dimension, low sample size (HDLSS)settings, the simple average d...
research
08/14/2017

Distance and Similarity Measures Effect on the Performance of K-Nearest Neighbor Classifier - A Review

The K-nearest neighbor (KNN) classifier is one of the simplest and most ...
research
06/22/2022

Nearest Neighbor Classification based on Imbalanced Data: A Statistical Approach

In a classification problem, where the competing classes are not of comp...
research
08/19/2020

Neural Neighborhood Encoding for Classification

Inspired by the fruit-fly olfactory circuit, the Fly Bloom Filter [Dasgu...
research
09/21/2021

Classification with Nearest Disjoint Centroids

In this paper, we develop a new classification method based on nearest c...
research
11/19/2015

The Kernel Two-Sample Test for Brain Networks

In clinical and neuroscientific studies, systematic differences between ...
research
09/10/2020

Population structure-learned classifier for high-dimension low-sample-size class-imbalanced problem

The Classification on high-dimension low-sample-size data (HDLSS) is a c...

Please sign up or login with your details

Forgot password? Click here to reset