Tag
nearest-neighbor-search
- Mar 24, 2026 Distance Concentration and Why Tree Indexes Collapse in High Dimensions Why bounding-box and ball-tree pruning stops helping as dimensionality grows, what the concentration effect does to nearest-neighbor contrast, and which index families survive it. information retrieval
- Feb 6, 2026 Coarse Quantization with Inverted Files and the nprobe Setting How an inverted-file index reduces a full scan to a few cluster scans, what the centroid training step optimizes, and why the nprobe parameter buys recall at a nearly linear price in work. information retrieval
- Oct 9, 2024 HNSW Layer Assignment and the Greedy Descent How a hierarchical proximity graph assigns levels by an exponential draw, why the top layers act as a coarse skip list, and what ef actually bounds during the search. information retrieval
- Jul 21, 2022 DBSCAN, Density Reachability, and the Parameter Cliff A cluster as a maximal set of density-connected points needs only a radius and a count, produces non-convex shapes and explicit noise, and is order sensitive only at the boundary of a cluster. machine learning