Hierarchical Navigable Small World

GPTKB entity

Statements (33)
Predicate Object
gptkbp:instanceOf graph
gptkbp:abbreviation gptkb:HNSW
gptkbp:application gptkb:machine_learning
information retrieval
recommendation systems
vector similarity search
gptkbp:basedOn small-world graph
navigable small world graph
gptkbp:citation Malkov, Y. A., & Yashunin, D. A. (2018). Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. IEEE TPAMI, 42(4), 824-836.
gptkbp:complexity logarithmic search complexity
sub-linear
gptkbp:data_structure multi-layer graph
gptkbp:feature scalability
hierarchical structure
low memory usage
high recall
efficient search
https://www.w3.org/2000/01/rdf-schema#label Hierarchical Navigable Small World
gptkbp:introduced gptkb:Yury_Malkov
2016
Dmitry Yashunin
gptkbp:openSource gptkb:FAISS
NMSLIB
hnswlib
gptkbp:publishedIn gptkb:IEEE_Transactions_on_Pattern_Analysis_and_Machine_Intelligence
gptkbp:relatedTo ANN (Approximate Nearest Neighbor) algorithms
k-nearest neighbor graph
navigable small world graphs
gptkbp:search_method greedy search
multi-layer navigation
gptkbp:usedFor approximate nearest neighbor search
gptkbp:bfsParent gptkb:HNSW
gptkbp:bfsLayer 7