Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search
Authors:
Top Cited Papers
- 1 December 2019
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 96
Abstract
No abstract availableKeywords
Funding Information
- CNPq (307560/2016-3, 400487/2016-0, 425340/2016-3, 304380/2018-0, 422593/2018-4)
- CAPES (88881.145912/2017-01)
- FAPEMIG (PPM-00543-17)
- FAPESP (2014/12236-1, 2015/24494-8, 2016/50250-1, 2017/20945-0, 2015/11937-9, 2017/12646-3, 2017/16246-0)
- CAPES (001)
This publication has 18 references indexed in Scilit:
- The Inverted Multi-IndexIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Approximate nearest neighbor algorithm based on navigable small world graphsInformation Systems, 2014
- Scalable Nearest Neighbor Algorithms for High Dimensional DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- Fast and versatile algorithm for nearest neighbor search based on a lower bound treePattern Recognition, 2007
- Some approaches to improve tree-based nearest neighbour search algorithmsPattern Recognition, 2006
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Dimension und u eres MaMathematische Annalen, 1918