Fast Approximation Algorithm for Euclidean Minimum Spanning Tree Building in High Dimensions. - Keito Kido; Daichi Amagata; Takahiro Hara (PAKDD (6), 2025)

How to Mine Potentially Popular Items? A Reverse MIPS-based Approach. - Daichi Amagata; Kazuyoshi Aoyama; Keito Kido; Sumio Fujita (SSDBM, 2025)

Approximate Reverse k-Ranks Queries in High Dimensions. - Daichi Amagata; Kazuyoshi Aoyama; Keito Kido; Sumio Fujita (SSDBM, 2025)

How to Mine Potentially Popular Items? A Reverse MIPS-based Approach. - Daichi Amagata; Kazuyoshi Aoayama; Keito Kido; Sumio Fujita (CoRR, 2025)

Approximate Reverse k-Ranks Queries in High Dimensions. - Daichi Amagata; Kazuyoshi Aoyama; Keito Kido; Sumio Fujita (CoRR, 2025)