In this section, we present our hashing method, named Semi-Supervised SimHash ( Given the labeled data X L , we construct two sets, attraction set Θ a and repulsion set Θ r .
any pair Unlike previews works that attempt to find L optimal hyperplanes, the basic idea of S 3 H is to fix L random hyperplanes and to find an optimal feature-weight vector to relocate the objects such that similar objects have similar codes.