-
### Title
Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
### Link
https://arxiv.org/abs/1603.09320
### Year
2018
### Author and affiliat…
-
I am using this library in my thesis project and I would like to cite it in my thesis. Beside the library itself, I also want to cite some academic stuff.
Are there any academic publication associate…
-
## Using `recall` in combination with YQL
Using [recall](https://docs.vespa.ai/en/reference/query-api-reference.html#recall)
>This is identical to [filter](https://docs.vespa.ai/en/reference/que…
-
### Description
Lucene always does an approximate nearest neighbors search when no filter is provided.
This seems like unnecessary work. Some benchmarks would have to be done, but some ideas I ha…
-
I'm trying to replace my regular grid search with HNSW, but HNSW seems to fail rather spectacularly in finding the nearest neighbor in some cases. I understand that it's an approximate method, but it'…
-
#### Introduction
Vector databases have gained significant importance due to the rise of AI, machine learning, and deep learning applications. These databases store high-dimensional vectors repre…
-
-
Hi,
Thanks for the great work !
I found out TorchPQ recently : https://github.com/DeMoriarty/TorchPQ
> TorchPQ is a python library for Approximate Nearest Neighbor Search (ANNS) and Maximum I…
-
This attempts to consider some of the criteria we should consider when selecting algorithm:
1. Are the results approximate or exact? If approximate, how accurate vs exhaustive search? is it tuneabl…
-
Following the approach here: https://umap-learn.readthedocs.io/en/latest/sparse.html; I'm sending UMAP a sparse float dataset, consisting only of 1.0 32-bit float values and zeroes, using Jaccard dist…