{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:54Z","timestamp":1725807894109},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126395"},{"type":"electronic","value":"9783319126401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12640-1_48","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T20:14:56Z","timestamp":1413836096000},"page":"395-403","source":"Crossref","is-referenced-by-count":1,"title":["Hashing for Financial Credit Risk Analysis"],"prefix":"10.1007","author":[{"given":"Bernardete","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"48_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM\u00a051(1), 117\u2013121 (2008)","journal-title":"Communications of the ACM"},{"key":"48_CR2","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, 402\u2013430 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M. Belkin","year":"2002","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation\u00a015, 1373\u20131396 (2002)","journal-title":"Neural Computation"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.neucom.2013.11.039","volume":"141","author":"Z. Bodo","year":"2014","unstructured":"Bodo, Z., Csato, L.: Linear spectral hashing. Neurocomputing\u00a0141, 117\u2013123 (2014)","journal-title":"Neurocomputing"},{"issue":"8","key":"48_CR5","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"D. Cai","year":"2011","unstructured":"Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized non-negative matrix factorization for data representation. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a033(8), 1548\u20131560 (2011)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Trans. on Intelligent Systems and Technology\u00a02, 27:1\u201327:27 (2011), \n                    \n                      http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Chung, F.: Spectral Graph Theory. American Mathematical Society (1997)","DOI":"10.1090\/cbms\/092"},{"issue":"6","key":"48_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. Journal of the American Society for Information Science\u00a041(6), 391\u2013407 (1990)","journal-title":"Journal of the American Society for Information Science"},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TPAMI.2013.101","volume":"36","author":"A. Gordo","year":"2014","unstructured":"Gordo, A., Perronnin, F., Gong, Y., Lazebnik, S.: Asymmetric distances for binary embeddings. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a036(1), 33\u201347 (2014)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: 30th STOC, pp. 604\u2013613. ACM Press (1998)","DOI":"10.1145\/276698.276876"},{"key":"48_CR11","unstructured":"Nene, S.A., Nayar, S.K.: A simple algorithm for nearest neighbor search in high dimensions. Tech. Rep. CUCS-030-95, CS Dep, University of Columbia, USA (1995)"},{"key":"48_CR12","unstructured":"Raginsky, M., Lazebnik, S.: Locality sensitive binary codes from shift-invariant kernels. In: Adv. in Neural Information Proc. Sys. (NIPS), pp. 1509\u20131517 (2009)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Chen, N.: Graph weighted subspace learning models in bankruptcy. In: Proc. of Int. J. Conf. on Neural Networks (IJCNN), pp. 2055\u20132061. IEEE (2011)","DOI":"10.1109\/IJCNN.2011.6033479"},{"issue":"7","key":"48_CR14","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. Int. J. Approx. Reasoning\u00a050(7), 969\u2013978 (2009)","journal-title":"Int. J. Approx. Reasoning"},{"issue":"6","key":"48_CR15","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/72.97934","volume":"2","author":"D.F. Specht","year":"1991","unstructured":"Specht, D.F.: A general regression neural network. IEEE Transactions on Neural Networks\u00a02(6), 568\u2013576 (1991)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"48_CR16","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Adv. in Neural Information Proc. Sys. 21 (NIPS), pp. 1753\u20131760 (2009)"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, D., Wang, J., Cai, D., Lu, J.: Self-taught hashing for fast similarity search. In: Proc. of the 33rd Int. ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 18\u201325. ACM (2010)","DOI":"10.1145\/1835449.1835455"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12640-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T06:17:37Z","timestamp":1559024257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12640-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126395","9783319126401"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12640-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}