BriefGPT.xyz
May, 2024
基于聚类的近似最大内积搜索中的乐观查询路由
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
HTML
PDF
Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini
TL;DR
本研究旨在研究基于聚类的最近邻搜索中路由问题,通过乐观主义的原则,利用内积分布的矩来乐观地估计最大内积,通过只使用前两个矩实现与现有算法相当准确度的搜索,并且所提出的算法在空间利用上也更为高效。
Abstract
clustering-based nearest neighbor search
is a simple yet effective method in which data points are partitioned into geometric
shards
to form an index, and only a few
→