Near-Optimal Partial Linear Scan for Nearest Neighbor Search in High-Dimensional Space

@inproceedings{Cui2013NearOptimalPL,
  title={Near-Optimal Partial Linear Scan for Nearest Neighbor Search in High-Dimensional Space},
  author={Jiangtao Cui and Zi Huang and Bing Wang and Yingfan Liu},
  booktitle={DASFAA},
  year={2013}
}
One-dimensional mapping has been playing an important role for nearest neighbor search in high-dimensional space. Two typical kinds of one-dimensional mapping method, direct projection and distance computation regarding to reference points, are discussed in this paper. An optimal combination of one-dimensional mappings is achieved for the best search performance. Furthermore, we propose a near-optimal partial linear scan algorithm by considering several one-dimensional mapping values. During… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

Very large scale nearest neighbor search: ideas, strategies and challenges

  • International Journal of Multimedia Information Retrieval
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Adaptive Cluster Distance Bounding for High-Dimensional Indexing

  • IEEE Transactions on Knowledge and Data Engineering
  • 2011
VIEW 1 EXCERPT

Nearest Neighbor Retrieval Using Distance-Based Hashing

  • 2008 IEEE 24th International Conference on Data Engineering
  • 2008
VIEW 1 EXCERPT