Fast nearest-neighbor classifier based on sequential analysis of principal components

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we improve the speed of the nearest neighbor classifiers of a set of points based on sequential analysis of high-dimensional feature vectors. Each input object is associated with a sequence of principal component scores of aggregated features extracted by deep neural network. The number of components in each element of this sequence is dynamically chosen based on explained proportion of total variance for the training set. We propose to process the next element with higher explained variance only if the decision for the current element is unreliable. This reliability is estimated by matching of the ratio of the minimum distance and all other distances with a certain threshold. Experimental study for face recognition with the Labeled Faces in the Wild and YouTube Faces datasets demonstrates the decrease of running time up to 10 times when compared to conventional instance-based learning.

Cite

CITATION STYLE

APA

Sokolova, A. D., & Savchenko, A. V. (2019). Fast nearest-neighbor classifier based on sequential analysis of principal components. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11832 LNCS, pp. 73–80). Springer. https://doi.org/10.1007/978-3-030-37334-4_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free