Redundant bit vectors for quickly searching high-dimensional regions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3635 LNAI, Issue , 2005, Pages 137-158

  Goldstein, Jonathan ^a   Platt, John C ^a   Burges, Christopher J C ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUDIO SYSTEMS; DATA STRUCTURES; DATABASE SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES;

AUDIO FINGERPRINTING; QUERY SPACES; REDUNDANT BIT VECTORS (RBV);

SEARCH ENGINES;

EID: 33645991212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559887_9     Document Type: Conference Paper

References (20)

1. Burges, C.J., Platt, J.C., Jana, S.: Distortion discriminant analysis for audio fingerprinting. IEEE Transactions on Speech and Audio Processing 11 (2003) 165-174
2. Ullman, S., Sali, E., Vidal-Naquet, M.: A fragment-based approach to object representation and classification. In: Proc. of the 4th Intl. Workshop on Visual Form. Volume 2059 of Springer-Verlag Lecture Notes In Computer Science. (2001) 85-102
3. Achlioptas, D.: Database-friendly random projections. In: Proc. of the 20th Ann. Symp. on Principles of Database Systems. (2001) 274-281
4. Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc. of the 20th Ann. Symp. on Computational Geometry. (2004) 253-262
5. Diamantaras, K., Kung, S.: Principal Components Neural Networks. John Wiley (1996)
6. Schölkopf, B., Smola, A.: Learning with Kernels. MIT Press (2002)
7. Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall (1994)
8. Tax, D.M., Duin, R.P.: Uniform object generation for optimizing one-class classifiers. Journal of Machine Learning Research 2 (2001) 155-173
9. Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is "nearest neighbor" meaningful? In: Proc. of the 7th Intl. Conf. on Database Theory. Volume 1540 of Springer-Verlag Lecture Notes in Computer Science. (1999) 217-235
10. Goldstein, J., Ramakrishnan, R.: Contrast plots and P-Sphere trees: Space vs. time in nearest neighbour searches. In: Proc. of the 26th Intl. Conf. on Very Large Databases. (2000) 429-440
11. O'Neil, P., Quass, D.: Improved query performance with variant indexes. In: Proc. of the 1997 ACM SIGMOD Intl. Conf. (1997) 38-49
12. Arya, S., Mount, D.M.: Approximate range searching. In: Proc. of the 11th Ann. Symp. on Computational Geometry. (1995) 172-181
13. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 11 (1979) 397-409
14. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. of the 1984 ACM SIGMOD Conf. (1984) 47-57
15. White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proc. of the 12th Intl. Conf. on Data Engineering. (1996) 516-523
16. Berchtold, S., Keim, D., Kriegel, H.P.: The X-tree: an index structure for high-dimensional data. In: Proc. of the 22nd Intl. Conf. on Very Large Databases. (1996) 28-39
17. Pagel, B.U., Korn, F., Faltusos, C.: Deflating the dimensionality curse using multiple fractal dimensions. In: Proc. of the 16th Intl. Conf. on Data Engineering. (2000) 589-598
18. Andoni, A., Indyk, P.: E2LSH 0.1 user manual. Technical report, Massachusetts Institute of Technology (2004) http://web.mit.edu/andoni/www/LSH/ manual.pdf.
19. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering 13 (2001) 64-78
20. Goldstein, J., Platt, J.C., Burges, C.J.: Indexing high-dimensional rectangles for fast multimedia identification. Technical Report MSR-TR-2003-38, Microsoft Research (2003)