GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
type: Item
instance of: scholarly article
title: GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
zbMATH Open document ID: 1459.68186
author: Yiqi Li
author: Ruliang Xiao
author: Xin Wei
author: Huakun Liu
author: Shi Zhang
author: Xin Du
published in: Information Sciences
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 68T09
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7341903
zbMATH Keywords: global low-density hyperplane
zbMATH Keywords: graph cut method
zbMATH Keywords: minimum information gain
zbMATH Keywords: random maximum entropy
zbMATH Keywords: nearest neighbor search
MaRDI profile type: Publication
full work available at URL: j.ins.2020.04.046
OpenAlex ID: W3024176277
cites work: Observer-Based Control for Cyber-Physical Systems With Periodic DoS Attacks via a Cyclic Switching Strategy
cites work: Similarity estimation techniques from rounding algorithms
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Q4542583
cites work: Locality-sensitive hashing scheme based on p-stable distributions
cites work: Entropy based nearest neighbor search in high dimensions
cites work: Achieving NTRU with montgomery multiplication
cites work: Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
cites work: A neural algorithm for a fundamental computing problem
cites work: Deep Constrained Siamese Hash Coding Network and Load-Balanced Locality-Sensitive Hashing for Near Duplicate Image Detection
cites work: Multiple Lyapunov Functions Analysis Approach for Discrete-Time-Switched Piecewise-Affine Systems Under Dwell-Time Constraints
DOI: 10.1016/J.INS.2020.04.046
description: scientific article; zbMATH DE number 7341903