{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:46:28Z","timestamp":1743104788201,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642235344"},{"type":"electronic","value":"9783642235351"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23535-1_44","type":"book-chapter","created":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T21:41:17Z","timestamp":1314135677000},"page":"517-529","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Approximate Similarity Search Using Random Projection Learning"],"prefix":"10.1007","author":[{"given":"Peisen","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaofeng","family":"Sha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: STOC, pp. 380\u2013388 (2002)","DOI":"10.1145\/509907.509965"},{"key":"44_CR3","first-page":"459","volume-title":"FOCS","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468. MIT, Cambridge (2006)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Min, K., Yang, L., Wright, J., Wu, L., Hua, X.S., Ma, Y.: Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements. In: CVPR, pp. 3477\u20133484 (2010)","DOI":"10.1109\/CVPR.2010.5539973"},{"issue":"7","key":"44_CR6","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R. Salakhutdinov","year":"2009","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic Hashing. International Journal of Approximate Reasoning\u00a050(7), 969\u2013978 (2009)","journal-title":"International Journal of Approximate Reasoning"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, D., Wang, J., Cai, D., Lu, J.: Self-taught hashing for fast similarity search. In: SIGIR, pp. 18\u201325 (2010)","DOI":"10.1145\/1835449.1835455"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear SVMs in linear time. In: SIGKDD, pp. 217\u2013226 (2006)","DOI":"10.1145\/1150402.1150429"},{"key":"44_CR9","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines (2001), http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"44_CR10","unstructured":"World Wide Knowledge\u00a0Base project (2001), http:\/\/www.cs.cmu.edu\/~webkb\/"},{"key":"44_CR11","unstructured":"Reuters21578 (1999), http:\/\/kdd.ics.uci.edu\/databases\/reuters21578\/reuters21578.html"},{"key":"44_CR12","volume-title":"Modern Information Retrieval","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.A.: Modern Information Retrieval. Addison Wesley, Reading (1999)"},{"issue":"9","key":"44_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 517 (1975)","journal-title":"Communications of the ACM"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD\u00a019(2), 322\u2013331 (1990)","journal-title":"SIGMOD"},{"key":"44_CR16","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: SIGMOD, pp. 301\u2013312 (2003)","DOI":"10.1145\/872757.872795"},{"issue":"4","key":"44_CR18","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences\u00a066(4), 614\u2013656 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Yao, B., Li, F., Kumar, P.: k-nearest neighbor queries and knn-joins in large relational databases (almost) for free. In: ICDE, pp. 4\u201315 (2010)","DOI":"10.1109\/ICDE.2010.5447837"},{"key":"44_CR20","unstructured":"Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-tree into a database system kernel. In: VLDB, pp. 263\u2013272 (2000)"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Liao, S., Lopez, M., Leutenegger, S.: High dimensional similarity search with space filling curves. In: ICDE, pp. 615\u2013622 (2001)","DOI":"10.1109\/ICDE.2001.914876"},{"issue":"3","key":"44_CR22","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s10618-008-0096-z","volume":"17","author":"S. Baluja","year":"2008","unstructured":"Baluja, S., Covell, M.: Learning to hash: forgiving hash functions and applications. Data Mining and Knowledge Discovery\u00a017(3), 402\u2013430 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"44_CR23","first-page":"1753","volume":"21","author":"Y. Weiss","year":"2009","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. NIPS\u00a021, 1753\u20131760 (2009)","journal-title":"NIPS"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23535-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T05:30:53Z","timestamp":1560490253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23535-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642235344","9783642235351"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23535-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}