Get the latest tech news
Hierarchical Navigable Small World: a scalable nearest neighbor search
HNSW tutorial. Contribute to brtholomy/hnsw development by creating an account on GitHub.
"Hierarchical Navigable Small World" (HNSW): an intriguing mouthful, designating a dense bouquet of concepts developed in the last 70 years in sociology, graph theory, and algorithmic science. We begin from the top where it's sparse and wide, proceeding down to where it's dense and narrow: according to our earlier analogy, that'd be like taking a plane, then a car, and finally walking. There is one other important factor in the creation of these layers: at the stage when nearest neighbors are selected for insertion, a heuristic is applied which prefers long distance connections, thus creating graphs which are not only sparse but wide.
Or read this on Hacker News