On high-dimensional modifications of the nearest neighbor classifier
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917814118383616 |
|---|---|
| author | Ghosh, Annesha Ghoshal, Deep Banerjee, Bilol Ghosh, Anil K. |
| author_facet | Ghosh, Annesha Ghoshal, Deep Banerjee, Bilol Ghosh, Anil K. |
| contents | Nearest neighbor classifier is arguably the most simple and popular nonparametric classifier available in the literature. However, due to the concentration of pairwise distances and the violation of the neighborhood structure, this classifier often suffers in high-dimension, low-sample size (HDLSS) situations, especially when the scale difference between the competing classes dominates their location difference. Several attempts have been made in the literature to take care of this problem. In this article, we discuss some of these existing methods and propose some new ones. We carry out some theoretical investigations in this regard and analyze several simulated and benchmark datasets to compare the empirical performances of proposed methods with some of the existing ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_05145 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On high-dimensional modifications of the nearest neighbor classifier Ghosh, Annesha Ghoshal, Deep Banerjee, Bilol Ghosh, Anil K. Machine Learning Nearest neighbor classifier is arguably the most simple and popular nonparametric classifier available in the literature. However, due to the concentration of pairwise distances and the violation of the neighborhood structure, this classifier often suffers in high-dimension, low-sample size (HDLSS) situations, especially when the scale difference between the competing classes dominates their location difference. Several attempts have been made in the literature to take care of this problem. In this article, we discuss some of these existing methods and propose some new ones. We carry out some theoretical investigations in this regard and analyze several simulated and benchmark datasets to compare the empirical performances of proposed methods with some of the existing ones. |
| title | On high-dimensional modifications of the nearest neighbor classifier |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2407.05145 |