AEkNN: An AutoEncoder kNN-based classifier with built-in dimensionality reduction
Francisco J. Pulgar, Francisco Charte, Antonio J. Rivera, Mar\'ia J., del Jesus

TL;DR
This paper introduces AEkNN, a novel kNN-based classifier that incorporates autoencoders for built-in dimensionality reduction, improving classification accuracy and runtime performance in high-dimensional data.
Contribution
The paper presents AEkNN, a new algorithm combining autoencoders with kNN to enhance performance in high-dimensional classification tasks.
Findings
AEkNN outperforms classical kNN in accuracy.
AEkNN reduces computational runtime.
AEkNN effectively handles high-dimensional data.
Abstract
High dimensionality, i.e. data having a large number of variables, tends to be a challenge for most machine learning tasks, including classification. A classifier usually builds a model representing how a set of inputs explain the outputs. The larger is the set of inputs and/or outputs, the more complex would be that model. There is a family of classification algorithms, known as lazy learning methods, which does not build a model. One of the best known members of this family is the kNN algorithm. Its strategy relies on searching a set of nearest neighbors, using the input variables as position vectors and computing distances among them. These distances loss significance in high-dimensional spaces. Therefore kNN, as many other classifiers, tends to worse its performance as the number of input variables grows. In this work AEkNN, a new kNN-based algorithm with built-in dimensionality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
