Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
December 28, 2018IEEE Transactions on Pattern Analysis and Machine Intelligence

Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs

View Full Paper
Ask AI
Bookmark
Share

Authors

YMYu. A. MalkovSamsung (Russia)DYD. A. YashuninRussian Academy of Sciences

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Malkov et al. (2018) studied this question.

synapsesocial.com/papers/69d7d60f3b601d7be3ae322dhttps://doi.org/10.1109/tpami.2018.2889473
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1The small-world phenomenon2000 · 1,904 citations
  2. 2Efficient k-nearest neighbor graph construction for generic similarity measures2011 · 688 citations
  3. 3Gradient-based learning applied to document recognition1998 · 59,913 citations
  4. 4Indexing by latent semantic analysis1990 · 12,881 citations