Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data

DOI10.1016/J.INS.2018.07.005zbMath1441.68223OpenAlexW2870984335WikidataQ129491796 ScholiaQ129491796MaRDI QIDQ2200557

Hong Cheng, Hao Wei, Yingfan Liu

Publication date: 22 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.07.005

zbMATH Keywords

high-dimensional datastatistical lower boundapproximate nearest neighbor searchprogressive lower bound

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Statistical aspects of big data and data science (62R07) Computational aspects of data analysis and big data (68T09)

Uses Software

• RCV1
• FLANN
• SIFT
• GitHub

Cites Work

• Modeling the shape of the scene: A holistic representation of the spatial envelope

This page was built for publication: Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data