{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:27:04Z","timestamp":1742383624672},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290735"},{"type":"electronic","value":"9783540317289"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11559887_9","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T13:21:18Z","timestamp":1129209678000},"page":"137-158","source":"Crossref","is-referenced-by-count":12,"title":["Redundant Bit Vectors for Quickly Searching High-Dimensional Regions"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Goldstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Plat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher J. C.","family":"Burges","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TSA.2003.811538","volume":"11","author":"C.J. Burges","year":"2003","unstructured":"Burges, C.J., Platt, J.C., Jana, S.: Distortion discriminant analysis for audio fingerprinting. IEEE Transactions on Speech and Audio Processing\u00a011, 165\u2013174 (2003)","journal-title":"IEEE Transactions on Speech and Audio Processing"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45129-3_7","volume-title":"Visual Form 2001","author":"S. Ullman","year":"2001","unstructured":"Ullman, S., Sali, E., Vidal-Naquet, M.: A fragment-based approach to object representation and classification. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 85\u2013102. Springer, Heidelberg (2001)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proc.\u00a0of the 20th Ann.\u00a0Symp.\u00a0on Principles of Database Systems, pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc.\u00a0of the 20th Ann.\u00a0Symp.\u00a0on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"9_CR5","volume-title":"Principal Components Neural Networks","author":"K. Diamantaras","year":"1996","unstructured":"Diamantaras, K., Kung, S.: Principal Components Neural Networks. John Wiley, Chichester (1996)"},{"key":"9_CR6","volume-title":"Learning with Kernels","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)"},{"key":"9_CR7","volume-title":"Multidimensional Scaling","author":"T.F. Cox","year":"1994","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall, Boca Raton (1994)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1162\/15324430260185583","volume":"2","author":"D.M. Tax","year":"2001","unstructured":"Tax, D.M., Duin, R.P.: Uniform object generation for optimizing one-class classifiers. Journal of Machine Learning Research\u00a02, 155\u2013173 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K.S. Beyer","year":"1998","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"9_CR10","unstructured":"Goldstein, J., Ramakrishnan, R.: Contrast plots and P-Sphere trees: Space vs. time in nearest neighbour searches. In: Proc.\u00a0of the 26th Intl.\u00a0Conf.\u00a0on Very Large Databases, pp. 429\u2013440 (2000)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, P., Quass, D.: Improved query performance with variant indexes. In: Proc.\u00a0of the 1997 ACM SIGMOD Intl.\u00a0Conf., pp. 38\u201349 (1997)","DOI":"10.1145\/253260.253268"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. In: Proc.\u00a0of the 11th Ann.\u00a0Symp.\u00a0on Computational Geometry, pp. 172\u2013181 (1995)","DOI":"10.1145\/220279.220298"},{"key":"9_CR13","first-page":"397","volume":"11","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a011, 397\u2013409 (1979)","journal-title":"Communications of the ACM"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc.\u00a0of the 1984 ACM SIGMOD Conf., pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proc.\u00a0of the 12th Intl.\u00a0Conf.\u00a0on Data Engineering, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"9_CR16","unstructured":"Berchtold, S., Keim, D., Kriegel, H.-P.: The X-tree: an index structure for high-dimensional data. In: Proc.\u00a0of the 22nd Intl.\u00a0Conf.\u00a0on Very Large Databases, pp. 28\u201339 (1996)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Pagel, B.U., Korn, F., Faltusos, C.: Deflating the dimensionality curse using multiple fractal dimensions. In: Proc.\u00a0of the 16th Intl.\u00a0Conf.\u00a0on Data Engineering, pp. 589\u2013598 (2000)","DOI":"10.1109\/ICDE.2000.839457"},{"key":"9_CR18","unstructured":"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"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E. Cohen","year":"2001","unstructured":"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\u00a013, 64\u201378 (2001)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR20","unstructured":"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)"}],"container-title":["Lecture Notes in Computer Science","Deterministic and Statistical Methods in Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11559887_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:38Z","timestamp":1619507558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11559887_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290735","9783540317289"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11559887_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}