GLDH: Toward more efficient global low-density locality-sensitive hashing for high dimensions.

Despite decades of intensive effort, the current solutions for efficiently searching high-dimensional data spaces are not entirely satisfactory. This paper proposes a more efficient global low-density locality sensitive hashing search algorithm (GLDH) based on the minimal cut hyperplane and ensemble learning. The innovation is that a novel global low-density hyperplane candidate set is constructed by the graph cut method, the minimum information gain method and random maximum entropy method are used to greedily select the hyperplane, and the ensemble learning method is used to query the global approximate nearest-neighbors data. This paper proves that the GLDH algorithm produces a low error hyperplane partition. The results of extensive experiments show that the proposed GLDH method performs better than the latest methods when using the same hash coding length for datasets from different fields. [ABSTRACT FROM AUTHOR]