{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:46Z","timestamp":1725809086197},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_56","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:24:07Z","timestamp":1415960647000},"page":"708-719","source":"Crossref","is-referenced-by-count":1,"title":["Classification with Sign Random Projections"],"prefix":"10.1007","author":[{"given":"Sanparith","family":"Marukatat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11752790_3","volume-title":"Subspace, Latent Structure and Feature Selection","author":"A. Blum","year":"2006","unstructured":"Blum, A.: Random projection, margins, kernels, and feature-selection. In: Saunders, C., Grobelnik, M., Gunn, S., Shawe-Taylor, J. (eds.) SLSFS 2005. LNCS, vol.\u00a03940, pp. 52\u201368. Springer, Heidelberg (2006)"},{"issue":"12","key":"56_CR2","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory\u00a052(12), 5406\u20135425 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Similarity Estimation Techniques from Rounding Algorithms. In: Proceedings on 34th Annual ACM Symposium on Theory of Computing (2002)","DOI":"10.1145\/509907.509965"},{"issue":"1","key":"56_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S. Dasgupta","year":"2002","unstructured":"Dasgupta, S., Gupta, A.: An Elementary Proof of a Theorem of Johnson and Lindenstrauss. Random Structures & Algorithms\u00a022(1), 60\u201365 (2002)","journal-title":"Random Structures & Algorithms"},{"issue":"4","key":"56_CR5","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Transactions on Information Theory\u00a052(4), 1289\u20131306 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"56_CR6","unstructured":"Fern, X.Z., Brodley, C.E.: Random projection for high dimensional data clustering: A cluster ensemble approach. In: Proceedings of the 20th International Conference, ICML (2003)"},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-59119-2_166","volume-title":"Computational Learning Theory","author":"Y. Freund","year":"1995","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. In: Vit\u00e1nyi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol.\u00a0904, pp. 23\u201337. Springer, Heidelberg (1995)"},{"issue":"6","key":"56_CR8","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. Journal of the Association for Computing Machinery\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of the 30th ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276876"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing. IEEE Transactions on Pattern Analysis and Machine Intelligence, TPAMI (2011)","DOI":"10.1109\/TPAMI.2011.219"},{"key":"56_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/11776420_46","volume-title":"Learning Theory","author":"P. Li","year":"2006","unstructured":"Li, P., Hastie, T.J., Church, K.W.: Improving Random Projections Using Marginal Information. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol.\u00a04005, pp. 635\u2013649. Springer, Heidelberg (2006)"},{"issue":"9","key":"56_CR12","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1016\/j.patrec.2013.03.006","volume":"34","author":"S. Marukatat","year":"2013","unstructured":"Marukatat, S., Methasate, I.: Fast nearest neighbor retrieval using randomized binary codes and approximate euclidean distance. Pattern Recognition Letters\u00a034(9), 1101\u20131107 (2013)","journal-title":"Pattern Recognition Letters"},{"key":"56_CR13","unstructured":"Shi, Q., Shen, C., Hill, R., van den Hengel, A.: Is margin preserved after random projection. In: Proceedings of the 29th International Conference on Machine Learning (ICML). icml.cc\/Omnipress (2012)"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: The International Conference on Computer Vision, CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587638"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:29:04Z","timestamp":1559068144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}