Add to ORKGNumerous applications in search, databases, machine learning, and computer vision, can benefit from efficient algorithms for near neighbor search. This paper proposes a simple framework for fast near neighbor search in high-dimensional binary data, which are common in practice (e.g., text). We develop a very simple and effective strategy for sub-linear time near neighbor search, by creating hash tables directly using the bits generated by b-bit minwise hashing. The advantages of our method are demonstrated through thorough comparisons with two strong baselines: spectral hashing and sign (1-bit) random projections.NSF Grant #113184
Abstract. We propose a data structure for finding the exact nearest neighbors in 3D in approximately...
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of a...
We address the problem of designing data structures that allow efficient search for approximate near...
Abstract—There is growing interest in representing image data and feature descriptors using compact ...
There is growing interest in representing image data and feature descriptors using compact binary co...
There has been growing interest in mapping image data onto compact binary codes for fast near neighb...
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications....
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
Similarity search in multimedia databases requires an effi-cient support of nearest-neighbor search ...
Nearest neighbor (NN) search in high dimensional space is an im-portant problem in many applications...
Nearest Neighbor (NN) search in high-dimensional space is an important problem in many applications....
The nearest- or near-neighbor query problems arise in a large variety of database applications, usua...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search o...
As databases increasingly integrate different types of information such as time-series, multimedia a...
Nearest neighbor search is a fundamental computational tool and has wide applications. In past decad...
Abstract. We propose a data structure for finding the exact nearest neighbors in 3D in approximately...
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of a...
We address the problem of designing data structures that allow efficient search for approximate near...
Abstract—There is growing interest in representing image data and feature descriptors using compact ...
There is growing interest in representing image data and feature descriptors using compact binary co...
There has been growing interest in mapping image data onto compact binary codes for fast near neighb...
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications....
International audienceThis paper proposes a binarization scheme for vectors of high dimension based ...
Similarity search in multimedia databases requires an effi-cient support of nearest-neighbor search ...
Nearest neighbor (NN) search in high dimensional space is an im-portant problem in many applications...
Nearest Neighbor (NN) search in high-dimensional space is an important problem in many applications....
The nearest- or near-neighbor query problems arise in a large variety of database applications, usua...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search o...
As databases increasingly integrate different types of information such as time-series, multimedia a...
Nearest neighbor search is a fundamental computational tool and has wide applications. In past decad...
Abstract. We propose a data structure for finding the exact nearest neighbors in 3D in approximately...
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of a...
We address the problem of designing data structures that allow efficient search for approximate near...