Kejing Lu

According to our database, Kejing Lu authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search.

Kejing Lu, Chuan Xiao, Yoshiharu Ishikawa

CoRR, 2024

2022

MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances.

Kejing Lu, Yoshiharu Ishikawa, Chuan Xiao

Proc. VLDB Endow., 2022

2021

HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search.

Kejing Lu, Mineichi Kudo, Chuan Xiao, Yoshiharu Ishikawa

Proc. VLDB Endow., 2021

AdaLSH: Adaptive LSH for Solving <i>c</i>-Approximate Maximum Inner Product Search Problem.

Kejing Lu, Mineichi Kudo

IEICE Trans. Inf. Syst., 2021

MLSH: Mixed Hash Function Family for Approximate Nearest Neighbor Search in Multiple Fractional Metrics.

Kejing Lu, Mineichi Kudo

Proceedings of the Database Systems for Advanced Applications, 2021

Approximate Query Processing with Error Guarantees.

Tianjia Ni, Kento Sugiura, Yoshiharu Ishikawa, Kejing Lu

Proceedings of the Big-Data-Analytics in Astronomy, Science, and Engineering, 2021

2020

VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning.

Kejing Lu, Hongya Wang, Wei Wang, Mineichi Kudo

Proc. VLDB Endow., 2020

R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces.

Kejing Lu, Mineichi Kudo

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2018

Why locality sensitive hashing works: A practical perspective.

Kejing Lu, Hongya Wang, Yingyuan Xiao, Hui Song

Inf. Process. Lett., 2018