ES
English
Deutsch
Français
Italiano
Português
Nederlands
Polski
Bahasa Indonesia
Русский
Українська
العربية
עברית
日本語
한국어HNSW (Hierarchical Navigable Small World)
Concepto
HNSW is a graph-based approximate nearest neighbor algorithm that builds a multi-layer proximity graph for fast vector search. It keeps the whole graph in memory, which makes it fast but RAM-intensive at large scale.
| Tipo | Concepto |
|---|---|
| Wikipedia | en.wikipedia.org/wiki/Hierarchical_navigable_small_world |
Community wiki
Short info above, community knowledge below: add practical tips, examples or corrections. New contributions are reviewed first; trusted members publish directly.
Expertos y empresas para este tema
Nadie ha indicado aún este tema. Añádelo a tu perfil.
Fuentes
Mantenido por Mirko Peters (Microsoft MVP) · Última actualización: