cluster #4

Papers

• Efficient And Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs (2016)
  Yu. A. Malkov, D. A. Yashunin
  22.99
• K-nearest Neighbour Classifiers: 2nd Edition (with Python Examples) (2020)
  Padraig Cunningham, Sarah Jane Delany
  21.43
• The Case For Learned Index Structures (2017)
  Tim Kraska, Alex Beutel, Ed H. Chi, et al.
  21.00
• Distance And Similarity Measures Effect On The Performance Of K-nearest Neighbor Classifier -- A Review (2017)
  V. B. Surya Prasath, Haneen Arafat Abu Alfeilat, Ahmad B. A. Hassanat, et al.
  20.24
• Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)
  George H. Chen, Devavrat Shah
  18.63
• Visualizing Large-scale And High-dimensional Data (2016)
  Jian Tang, Jingzhou Liu, Ming Zhang, et al.
  18.48
• Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph (2017)
  Cong Fu, Chao Xiang, Changxu Wang, et al.
  18.20
• A Comprehensive Survey And Experimental Comparison Of Graph-based Approximate Nearest Neighbor Search (2021)
  Mengzhao Wang, Xiaoliang Xu, Qiang Yue, et al.
  17.35
• High Dimensional Similarity Search With Satellite System Graph: Efficiency, Scalability, And Unindexed Query Compatibility (2019)
  Cong Fu, Changxu Wang, Deng Cai
  17.30
• Efficient Task-specific Data Valuation For Nearest Neighbor Algorithms (2019)
  Ruoxi Jia, David Dao, Boxin Wang, et al.
  15.75
• A Note On "efficient Task-specific Data Valuation For Nearest Neighbor Algorithms" (2023)
  Jiachen T. Wang, Ruoxi Jia
  15.75
• Dataset Discovery In Data Lakes (2020)
  Alex Bogatu, Alvaro A. A. Fernandes, Norman W. Paton, et al.
  15.28
• Ann-benchmarks: A Benchmarking Tool For Approximate Nearest Neighbor Algorithms (2018)
  Martin Aumüller, Erik Bernhardsson, Alexander Faithfull
  14.73
• Target Before Shooting: Accurate Anomaly Detection And Localization Under One Millisecond Via Cascade Patch Retrieval (2023)
  Hanxi Li, Jianfei Hu, Bo Li, et al.
  14.62
• Hd-index: Pushing The Scalability-accuracy Boundary For Approximate Knn Search In High-dimensional Spaces (2018)
  Akhil Arora, Sakshi Sinha, Piyush Kumar, et al.
  14.02
• High-dimensional Approximate Nearest Neighbor Search: With Reliable And Efficient Distance Comparison Operations (2023)
  Jianyang Gao, Cheng Long
  13.44
• KNN Classification With One-step Computation (2020)
  Shichao Zhang, Jiaye Li
  13.34
• Learning Similarity Measures From Data (2020)
  Bjørn Magnus Mathisen, Agnar Aamodt, Kerstin Bach, et al.
  12.68
• Starling: An I/o-efficient Disk-resident Graph Index Framework For High-dimensional Vector Similarity Search On Data Segment (2024)
  Mengzhao Wang, Weizhi Xu, Xiaomeng Yi, et al.
  12.61
• Refining A \(k\)-nearest Neighbor Graph For A Computationally Efficient Spectral Clustering (2023)
  Mashaan Alshammari, John Stavrakakis, Masahiro Takatsuka
  12.25
• Learnable Locality-sensitive Hashing For Video Anomaly Detection (2021)
  Yue Lu, Congqi Cao, Yanning Zhang
  12.02
• A Memory-efficient Sketch Method For Estimating High Similarities In Streaming Sets (2019)
  Pinghui Wang, Yiyan Qi, Yuanming Zhang, et al.
  12.02
• ACORN: Performant And Predicate-agnostic Search Over Vector Embeddings And Structured Data (2024)
  Liana Patel, Peter Kraft, Carlos Guestrin, et al.
  11.76
• Optimal Hashing-based Time-space Trade-offs For Approximate Near Neighbors (2016)
  Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, et al.
  11.29
• Accelerating Large-scale Graph-based Nearest Neighbor Search On A Computational Storage Platform (2022)
  Ji-Hoon Kim, Yeo-Reum Park, Jaeyoung Do, et al.
  11.29
• A Revisit Of Hashing Algorithms For Approximate Nearest Neighbor Search (2016)
  Deng Cai
  11.19
• Fast Subtrajectory Similarity Search In Road Networks Under Weighted Edit Distance Constraints (2020)
  Satoshi Koide, Chuan Xiao, Yoshiharu Ishikawa
  11.19
• Approximate K-nn Graph Construction: A Generic Online Approach (2018)
  Wan-Lei Zhao, Hui Wang, Chong-Wah Ngo
  11.08
• A Distributed And Approximated Nearest Neighbors Algorithm For An Efficient Large Scale Mean Shift Clustering (2019)
  Gaël Beck, Tarn Duong, Mustapha Lebbah, et al.
  10.85
• Indexing Metric Spaces For Exact Similarity Search (2020)
  Lu Chen, Yunjun Gao, Xuan Song, et al.
  10.85
• FINGER: Fast Inference For Graph-based Approximate Nearest Neighbor Search (2022)
  Patrick H. Chen, Chang Wei-Cheng, Yu Hsiang-Fu, et al.
  10.74
• Set Similarity Search Beyond Minhash (2016)
  Tobias Christiani, Rasmus Pagh
  10.74
• Learning To Index For Nearest Neighbor Search (2018)
  Chih-Yi Chiu, Amorntip Prayoonwong, Yin-Chih Liao
  10.35
• Parlayann: Scalable And Deterministic Parallel Graph-based Approximate Nearest Neighbor Search Algorithms (2023)
  Magdalen Dobson Manohar, Zheqi Shen, Guy E. Blelloch, et al.
  10.35
• Elastic Bands Across The Path: A New Framework And Methods To Lower Bound DTW (2018)
  Chang Wei Tan, Francois Petitjean, Geoffrey I. Webb
  10.35
• Hilbert Exclusion: Improved Metric Search Through Finite Isometric Embeddings (2016)
  Richard Connor, Franco Alberto Cardillo, Lucia Vadicamo, et al.
  10.07
• Lightweight-yet-efficient: Revitalizing Ball-tree For Point-to-hyperplane Nearest Neighbor Search (2023)
  Qiang Huang, Anthony K. H. Tung
  10.01
• Probminhash -- A Class Of Locality-sensitive Hash Algorithms For The (probability) Jaccard Similarity (2019)
  Otmar Ertl
  9.92
• Asymmetric Learning Vector Quantization For Efficient Nearest Neighbor Classification In Dynamic Time Warping Spaces (2017)
  Brijnesh Jain, David Schultz
  9.92
• DET-LSH: A Locality-sensitive Hashing Scheme With Dynamic Encoding Tree For Approximate Nearest Neighbor Search (2024)
  Jiuqi Wei, Botao Peng, Xiaodong Lee, et al.
  9.92
• Privacy Preserving Identification Using Sparse Approximation With Ambiguization (2017)
  Behrooz Razeghi, Slava Voloshynovskiy, Dimche Kostadinov, et al.
  9.76
• HQANN: Efficient And Robust Similarity Search For Hybrid Queries With Structured And Unstructured Constraints (2022)
  Wei Wu, Junlin He, Yu Qiao, et al.
  9.76
• On The Optimal Time/space Tradeoff For Hash Tables (2021)
  Michael A. Bender, Martín Farach-Colton, John Kuszmaul, et al.
  9.59
• Pigeonring: A Principle For Faster Thresholded Similarity Search (2018)
  Jianbin Qin, Chuan Xiao
  9.59
• Monotonic Cardinality Estimation Of Similarity Selection: A Deep Learning Approach (2020)
  Yaoshu Wang, Chuan Xiao, Jianbin Qin, et al.
  9.59
• GB-KMV: An Augmented KMV Sketch For Approximate Containment Similarity Search (2018)
  Yang Yang, Ying Zhang, Wenjie Zhang, et al.
  9.59
• Fast Similarity Sketching (2017)
  Søren Dahlgaard, Mathias Bæk Tejs Langhede, Jakob Bæk Tejs Houen, et al.
  9.41
• A Resource-frugal Probabilistic Dictionary And Applications In Bioinformatics (2017)
  Camille Marchet, Lolita Lecompte, Antoine Limasset, et al.
  9.41
• FLASH: Randomized Algorithms Accelerated Over CPU-GPU For Ultra-high Dimensional Similarity Search (2017)
  Yiqiu Wang, Anshumali Shrivastava, Jonathan Wang, et al.
  9.23
• Parameter-free Locality Sensitive Hashing For Spherical Range Reporting (2016)
  Thomas D. Ahle, Martin Aumüller, Rasmus Pagh
  9.03