Actually , if we use LSH technique ( Andoni and Indyk , 2008 ) in retrieval process , the local method can be easily scaled to a larger training data .
nearoptimal hashing algorithms for approximate nearest neighbor in high dimensions
Alexandr Andoni Piotr Indyk
Further , compared to the retrieval , the local training is not the bottleneck . Actually , if we use LSH technique ( Andoni and Indyk , 2008 ) in retrieval process , the local method can be easily scaled to a larger training data .
Actually , if we use LSH technique ( @@CITATION ) in retrieval process , the local method can be easily scaled to a larger training data .