Construct · 1 fields · 1 citations

hierarchical navigable small world graph: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
hierarchical navigablesmall world graph1 CONSTRUCTHierarchical navigableMALKOV · INFORMATION RETRIEVAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Information retrieval

a layered proximity graph for approximate nearest neighbor search, in which greedy search starts on sparse upper layers and refines on denser lower ones.

In information retrieval, hierarchical navigable small world graph refers to a layered proximity graph for approximate nearest neighbor search, in which greedy search starts on sparse upper layers and refines on denser lower ones. This meaning comes from Malkov (2020) in IEEE Transactions on Pattern Analysis and Machine Intelligence.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how hierarchical navigable small world graph sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

dermoscopic pattern analysis1 fields · 1 citationsanchor · a standalone constructinformation4 fields · 5 citationsjingle · one word, four constructsintelligence6 fields · 14 citationsjingle · one name, six constructs

References

  1. Malkov, Y. A., & Yashunin, D. A. (2020). Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 42(4), 824-836. https://doi.org/10.1109/tpami.2018.2889473

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct