Index-based, high-dimensional, cosine threshold querying with optimality guarantees
From MaRDI portal
Publication:2035468
Recommendations
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- Approximating high-dimensional range queries with kNN indexing techniques
- Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches
- Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
- scientific article; zbMATH DE number 1832309
- scientific article; zbMATH DE number 2080488
Cites work
- An efficient algorithm for determining the convex hull of a finite planar set
- Computational geometry. Algorithms and applications.
- Exact and approximate maximum inner product search with LEMP
- Extensions of Lipschitz maps into Banach spaces
- Fast exact \(k\) nearest neighbors search using an orthogonal search tree
- Foundations of multidimensional and metric data structures.
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- Introduction to Information Retrieval
- Optimal aggregation algorithms for middleware.
- Traces and Emergence of Nonlinear Programming
Cited in
(4)- An extension of K-means for least-squares community detection in feature-rich networks
- Using non-zero dimensions for the cosine and Tanimoto similarity search among real valued vectors
- Exact and approximate maximum inner product search with LEMP
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
This page was built for publication: Index-based, high-dimensional, cosine threshold querying with optimality guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035468)
