179 questions
No questions match those filters.
← All questions
Retrieval & EmbeddingsMedium· HNSW· Graph Algorithms· Reachability
Why would a nearest-neighbor graph deliberately connect...
This is one of the questions in the full AI/ML interview bank. Pro unlocks all 1789 questions; Premium includes the same bank plus the highest daily Practice limit.
See plansIn a nearest-neighbor graph, k-nearest edges within a cluster often point in the same direction, which can lead to greedy search getting stuck. HNSW uses a selection heuristic to retain certain ‘long’ edges to ensure the graph remains navigable, allowing the search to traverse between clusters and improve overall recall.