3 papers
cs.DB2026
Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)
Reon Uemura, Keito Kido, Daichi Amagata
It has been common to represent many objects as high-dimensional vectors due to the proliferation of machine learning-based embedding techniques. One of the most important function…
cs.DB2025
Approximate Reverse -Ranks Queries in High Dimensions
Daichi Amagata, Kazuyoshi Aoyama, Keito Kido +1
Many objects are represented as high-dimensional vectors nowadays. In this setting, the relevance between two objects (vectors) is usually evaluated by their inner product. Recentl…
cs.DB2025
How to Mine Potentially Popular Items? A Reverse MIPS-based Approach
Daichi Amagata, Kazuyoshi Aoayama, Keito Kido +1
The -MIPS ( Maximum Inner Product Search) problem has been employed in many fields. Recently, its reverse version, the reverse -MIPS problem, has been proposed. Given an i…