GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
DOI10.1016/J.INS.2020.04.046zbMath1459.68186OpenAlexW3024176277MaRDI QIDQ2023176
Xin Wei, Yiqi Li, Huakun Liu, Xin Du, Shi Zhang, Ruliang Xiao
Publication date: 3 May 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.04.046
nearest neighbor searchglobal low-density hyperplanegraph cut methodminimum information gainrandom maximum entropy
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of data analysis and big data (68T09)
Related Items (3)
Cites Work
- Unnamed Item
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
- Extensions of Lipschitz mappings into a Hilbert space
- Achieving NTRU with montgomery multiplication
- Similarity estimation techniques from rounding algorithms
- Entropy based nearest neighbor search in high dimensions
- Deep Constrained Siamese Hash Coding Network and Load-Balanced Locality-Sensitive Hashing for Near Duplicate Image Detection
- A neural algorithm for a fundamental computing problem
- Multiple Lyapunov Functions Analysis Approach for Discrete-Time-Switched Piecewise-Affine Systems Under Dwell-Time Constraints
- Observer-Based Control for Cyber-Physical Systems With Periodic DoS Attacks via a Cyclic Switching Strategy
- Locality-sensitive hashing scheme based on p-stable distributions
This page was built for publication: GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
