# Classification with Nearest Disjoint Centroids

arXiv: https://arxiv.org/abs/2109.10436 · HTML: https://mlsanity.com/paper/2109.10436/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 41 references that are in the map.
- First posted on arXiv 21 Sep 2021.

## Builds on (most cited first, 3 of 3)

- [ImageNet Large Scale Visual Recognition Challenge](https://mlsanity.com/paper/1409.0575/) (2014)
- [Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression](https://mlsanity.com/paper/1509.02957/) (2015)
- [Biclustering with Alternating K-Means](https://mlsanity.com/paper/2009.04550/) (2020)

## Abstract (arXiv)

In this paper, we develop a new classification method based on nearest centroid, and it is called the nearest disjoint centroid classifier. Our method differs from the nearest centroid classifier in the following two aspects: (1) the centroids are defined based on disjoint subsets of features instead of all the features, and (2) the distance is induced by the dimensionality-normalized norm instead of the Euclidean norm. We provide a few theoretical results regarding our method. In addition, we propose a simple algorithm based on adapted k-means clustering that can find the disjoint subsets of features used in our method, and extend the algorithm to perform feature selection. We evaluate and compare the performance of our method to other classification methods on both simulated data and real-world gene expression datasets. The results demonstrate that our method is able to outperform other competing classifiers by having smaller misclassification rates and/or using fewer features in various settings and situations.