Showing cs.DBShow all
3 papers · 1 filter
cs.DB2025
Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search
Tingyang Chen, Cong Fu, Xiangyu Ke +3
Maximum Inner Product Search (MIPS) is a fundamental challenge in machine learning and information retrieval, particularly in high-dimensional data applications. Existing approache…
cs.DB2025
Maximum Inner Product is Query-Scaled Nearest Neighbor
Tingyang Chen, Cong Fu, Kun Wang +5
Maximum Inner Product Search (MIPS) for high-dimensional vectors is pivotal across databases, information retrieval, and artificial intelligence. Existing methods either reduce MIP…
cs.DB2025
Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
Jiancheng Ruan, Tingyang Chen, Renchi Yang +2
Approximate Nearest Neighbor Search (ANNS) in high-dimensional spaces finds extensive applications in databases, information retrieval, recommender systems, etc. While graph-based…