Nearest-Neighbour-Search-Neural-Networks-Product-Quantization

We face the problem of finding nearest neighbours in terms of Euclidean distance, and we use it for classification. In order to accelerate the search we combine Product Quantization (PQ) and binary neural associative memories (Willshaw Neural Networks).
http://dx.doi.org/10.1109/IJCNN.2016.7727873

Demetrio Ferro e72ac7ac8f Upload files to 'Figures' 6 months ago
Figures e72ac7ac8f Upload files to 'Figures' 6 months ago
MNIST b26676a3d3 Upload files to 'MNIST/Neural Networks over PQ' 6 months ago
TEXMEX f0081e936f Update 'TEXMEX/Data/readme-data.md' 6 months ago
LICENSE 8ae58179b2 Initial commit 6 months ago
README.md 161c11ed23 Update 'README.md' 6 months ago

README.md

Nearest Neighbour Search using binary Neural Networks and Product Quantization

We face the problem of finding nearest neighbours in terms of Euclidean distance, Hamming distance or other distance metric. In order to accelerate the search for the nearest neighbour in large collection datasets, many methods rely on the coarse-fine approach. In this paper we propose to combine Product Quantization (PQ) and binary neural associative memories (Willshaw Neural Networks) to perform the coarse search.

Stored Vectors