原书出处
Natural Language Processing in Action, Second Edition
Next, let’s look at graph-based algorithms. A good representative of graph-based algorithms, the Hierarchical Navigable Small World (HNSW)51 algorithm approaches the problem from the bottom up. It starts by building navigable small world (NSW) graphs, which are graphs where each vector is connected to its closest neighbors by a vertex. To understand the intuition of it, think of the Facebook connections graph—everyone is connected directly
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-10.html
EPUB SHA-256:0e9a35e49ca446e322e5524e53f39fb6bee5b2b23d9cda10ef052aca770b0b36