{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T12:05:30Z","timestamp":1749557130753,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874805"},{"type":"electronic","value":"9783540874812"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87481-2_17","type":"book-chapter","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T23:30:46Z","timestamp":1218670246000},"page":"250-265","source":"Crossref","is-referenced-by-count":2,"title":["Client-Friendly Classification over Random Hyperplane Hashes"],"prefix":"10.1007","author":[{"given":"Shyamsundar","family":"Rajaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"274","volume-title":"Symposium on Principles of Database Systems (PODS 2001)","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Symposium on Principles of Database Systems (PODS 2001), pp. 274\u2013281. ACM Press, New York (2001)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/FOCS.2006.49","volume-title":"Symposium on Foundations of Computer Science (FOCS 2006)","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Symposium on Foundations of Computer Science (FOCS 2006), pp. 459\u2013468. IEEE Computer Society, Los Alamitos (2006)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Arriaga, R.I., Vempala, S.: An algorithmic theory of learning: Robust concepts and random projection. In: IEEE Symposium on Foundations of Computer Science, pp. 616\u2013623 (1999)","DOI":"10.1109\/SFFCS.1999.814637"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/502512.502546","volume-title":"Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001)","author":"E. Bingham","year":"2001","unstructured":"Bingham, E., Mannila, H.: Random projection in dimensionality reduction: applications to image and text data. In: Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001), pp. 245\u2013250. ACM Press, New York (2001)"},{"key":"17_CR5","first-page":"380","volume-title":"Symposium on Theory of computing (STOC 2002)","author":"M.S. Charikar","year":"2002","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Symposium on Theory of computing (STOC 2002), pp. 380\u2013388. ACM Press, New York (2002)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/997817.997857","volume-title":"Symposium on Computational geometry (SCG 2004)","author":"M. Datar","year":"2004","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Symposium on Computational geometry (SCG 2004), pp. 253\u2013262. ACM Press, New York (2004)"},{"key":"17_CR7","volume-title":"Int. Conf. on Knowledge discovery and data mining (KDD 2008)","author":"K. Eshghi","year":"2008","unstructured":"Eshghi, K., Rajaram, S.: Locality-sensitive hash functions based on concommitant rank order statistics. In: Int. Conf. on Knowledge discovery and data mining (KDD 2008). ACM Press, New York (2008)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1162\/153244303322753670","volume":"3","author":"G. Forman","year":"2003","unstructured":"Forman, G.: An extensive empirical study of feature selection metrics for text classification. Journal of Machine Learning Research (JMLR)\u00a0(3), 1289\u20131305 (2003)","journal-title":"Journal of Machine Learning Research (JMLR)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/956750.956812","volume-title":"Int. Conf. on Knowledge discovery and data mining (KDD 2003)","author":"D. Fradkin","year":"2003","unstructured":"Fradkin, D., Madigan, D.: Experiments with random projections for machine learning. In: Int. Conf. on Knowledge discovery and data mining (KDD 2003), pp. 517\u2013522. ACM Press, New York (2003)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Goel, N., Bebis, G., Nefian, A.: Face recognition experiments with random projection. In: SPIE, Bellingham, WA, pp. 426\u2013437 (2005)","DOI":"10.1117\/12.605553"},{"issue":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Symposium on Theory of computing (STOC 1998), pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of lipschitz maps into a hilbert space. Contemporary Mathematics\u00a026, 189\u2013206 (1984)","journal-title":"Contemporary Mathematics"},{"key":"17_CR14","first-page":"793","volume-title":"Advances in Neural Information Processing Systems (NIPS 2007)","author":"K. Kumar","year":"2008","unstructured":"Kumar, K., Bhattacharya, C., Hariharan, R.: A randomized algorithm for large scale support vector learning. In: Advances in Neural Information Processing Systems (NIPS 2007), pp. 793\u2013800. MIT Press, Cambridge (2008)"},{"key":"17_CR15","volume-title":"Int. Conf. on Knowledge discovery and data mining (KDD 2006)","author":"I. Mierswa","year":"2006","unstructured":"Mierswa, I., Wurst, M., Klinkenberg, R., Scholz, M., Euler, T.: YALE: Rapid prototyping for complex data mining tasks. In: Int. Conf. on Knowledge discovery and data mining (KDD 2006). ACM Press, New York (2006)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Ravichandran, D., Pantel, P., Hovy, E.: Randomized algorithms and NLP: using locality sensitive hash function for high speed noun clustering. In: Association for Computational Linguistics (ACL 2005), pp. 622\u2013629 (2005)","DOI":"10.3115\/1219840.1219917"},{"issue":"11","key":"17_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G. Salton","year":"1975","unstructured":"Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Commun. ACM\u00a018(11), 613\u2013620 (1975)","journal-title":"Commun. ACM"},{"key":"17_CR18","unstructured":"Singh, K., Ma, M., Park, D.W.: A content-based image retrieval using FFT & cosine similarity coefficient. Signal and Image Processing (2003)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Vempala, S.: The Random Projection Method. American Mathematical Society (2004)","DOI":"10.1090\/dimacs\/065"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87481-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T13:33:52Z","timestamp":1738330432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87481-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540874805","9783540874812"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87481-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}