Modeling LSH for performance tuning

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 669-678

  Dong, Wei ^a   Wang, Zhe ^a   Josephson, William ^a   Charikar, Moses ^a   Li, Kai ^a  

^a Princeton University   (United States)

Author keywords

Locality sensitive hashing; Similarity search

Indexed keywords

3-D SHAPE; ADAPTIVE SEARCH METHOD; DATA DEPENDENT; DATA SETS; EXISTING METHOD; HIGH DIMENSIONAL SPACES; LOCALITY SENSITIVE HASHING; PARAMETER-TUNING; PERFORMANCE MODEL; PERFORMANCE TUNING; REAL VALUES; SEARCH ALGORITHMS; SEARCH QUALITY; SIMILARITY SEARCH; SMALL SAMPLES; STANDARD DEVIATION; STATISTICAL PERFORMANCE; TUNING PARAMETER;

ADAPTIVE ALGORITHMS; ASYMPTOTIC ANALYSIS; DATA PROCESSING; IMAGE RETRIEVAL; KNOWLEDGE MANAGEMENT; LEARNING ALGORITHMS; SPACE PROBES; TUNING;

THREE DIMENSIONAL;

EID: 70349248484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458172     Document Type: Conference Paper

References (21)

1. http://www.cs.princeton.edu/cass.
2. M. Bawa, T. Condie, and P. Ganesan. Lsh forest: self-tuning indexes for similarity search. In WWW '05: Proceedings of the 14th international conference on World Wide Web, pages 651-660, New York, NY, USA, 2005. ACM.
3. J. L. Bentley. K-d trees for semidynamic point sets. In SCG '90: Proceedings of the sixth annual symposium on Computational geometry, pages 187-197, New York, NY, USA, 1990. ACM.
4. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pages 253-262, New York, NY, USA, 2004. ACM Press.
5. Y. Deng and B. Manjunath. Unsupervised segmentation of color-texture regions in images and video. IEEE Trans. on Pattern Analysis and Machine Intelligence, 23(8):800-810, August 2001.
6. D. Dobkin and R. J. Lipton. Multidimensional searching problems. SIAM Journal on Computingz, 5(2):181-186, 1976.
7. J. S. Garofolo, L. F. Lamel, W. M. Fisher, J. G. Fiscus, D. S. Pallett, and N. L. Dahlgren. DARPA TIMIT acoustic-phonetic continuous speech corpus, 1993.
8. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, pages 518-529, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
9. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47-57, New York, NY, USA, 1984. ACM.
10. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 604-613, New York, NY, USA, 1998. ACM.
11. N. Katayama and S. Satoh. The sr-tree: an index structure for high-dimensional nearest neighbor queries. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 369-380, New York, NY, USA, 1997. ACM.
12. M. Kazhdan, T. Funkhouser, and S. Rusinkiewicz. Rotation invariant spherical harmonic representation of 3d shape descriptors. In SGP '03: Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing, pages 156-164, Aire-la-Ville, Switzerland, Switzerland, 2003. Eurographics Association.
13. Q. Lv, M. Charikar, and K. Li. Image similarity search with compact data structures. In CIKM '04: Proceedings of the thirteenth ACM international conference on Information and knowledge management, pages 208-217, New York, NY, USA, 2004. ACM.
14. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Ferret: a toolkit for content-based similarity search of feature-rich data. In EuroSys '06: Proceedings of the ACM SIGOPS/EuroSys European Conference on Computer Systems 2006, pages 317-330, New York, NY, USA, 2006. ACM.
15. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe lsh: Efficient indexing for high-dimensional similarity search. In VLDB '07: Proceedings of the 24rd International Conference on Very Large Data Bases, Vienna, Austria, 2007.
16. S. Meiser. Point location in arrangements of hyperplanes. Inf. Comput., 106(2):286-303, 1993.
17. B.-U. Pagel, F. Korn, and C. Faloutsos. Deflating the dimensionality curse using multiple fractal dimensions. In ICDE '00: Proceedings of the 16th International Conference on Data Engineering, page 589, Washington, DC, USA, 2000. IEEE Computer Society.
18. R. Panigrahy. Entropy based nearest neighbor search in high dimensions. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 1186-1195, New York, NY, USA, 2006. ACM.
19. G. Tzanetakis and P. Cook. Marsyas: a framework for audio analysis. Organized Sound, 4(3):169-175, 1999.
20. Z. Wang, W. Dong, W. Josephson, Q. Lv, M. Charikar, and K. Li. Sizing sketches: a rank-based analysis for similarity search. In SIGMETRICS '07: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 157-168, New York, NY, USA, 2007. ACM.
21. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases, pages 194-205, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.