Exact and approximate maximum inner product search with LEMP

DOI10.1145/2996452MaRDI QIDQ5012573zbMATH OpenOpenAlexWikidataFDO

Authors Christina Teflioudi, Rainer Gemulla

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://madoc.bib.uni-mannheim.de/42428/1/teflioudi16lemp-draft.pdf

zbMATH Keywords

indexingmaximum inner product search (MIPS)recommender systemstop-\(k\) search

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Information storage and retrieval of data (68P20)

Recommendations

• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• Set similarity search beyond MinHash
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Index structures for fast similarity search for real-valued vectors. I
• Speeding up spatial approximation search in metric spaces

Cited in

(7)

• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Optimizing revenue while showing relevant assortments at scale
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• scientific article; zbMATH DE number 7250154 (Why is no real title available?)
• On the hardness of approximate and exact (bichromatic) maximum inner product
• LEMP

Describes a project that uses

Uses Software

• PATTY
• GloVe

This page was built for publication: Exact and approximate maximum inner product search with LEMP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012573)