Index-based, high-dimensional, cosine threshold querying with optimality guarantees

DOI10.1007/s00224-020-10009-6OpenAlexW3095649573WikidataQ114868002 ScholiaQ114868002MaRDI QIDQ2035468

Yanyan Li

Publication date: 24 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.07695

zbMATH Keywords

similarity searchthreshold algorithmcosinevector databases

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items

An extension of K-means for least-squares community detection in feature-rich networks

Uses Software

• FLANN
• GitHub
• FALCONN
• LFW
• LEMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions of Lipschitz maps into Banach spaces
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Optimal aggregation algorithms for middleware.
• Foundations of multidimensional and metric data structures.
• An efficient algorithm for determining the convex hull of a finite planar set
• Introduction to Information Retrieval
• Exact and Approximate Maximum Inner Product Search with LEMP
• Traces and Emergence of Nonlinear Programming