Active Search for Nearest Neighbors

TL;DR

This paper introduces an innovative nearest neighbor search method inspired by human visual system behavior, focusing on active, localized search rather than exhaustive comparison, aiming to improve computational efficiency.

Contribution

The paper proposes a novel active search approach for nearest neighbors that mimics human visual strategies, differing from traditional exhaustive methods.

Findings

Reduces computational cost compared to traditional methods

Emulates human visual search behavior

Potentially improves efficiency in large datasets

Abstract

In pattern recognition or machine learning, it is a very fundamental task to find nearest neighbors of a given point. All the methods for the task work basically by comparing the given point to all the points in the data set. That is why the computational cost increases with the number of data points. However, the human visual system seems to work in a different way. When the human visual system tries to find the neighbors of one point on a map, it directly focuses on the area around the point and actively searches the neighbors by looking or zooming in and out around the point. In this paper, we propose an innovative search method for nearest neighbors, which seems very similar to how human visual system works on the task.