{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T18:40:03Z","timestamp":1748630403421,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662485699"},{"type":"electronic","value":"9783662485705"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48570-5_25","type":"book-chapter","created":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T09:59:10Z","timestamp":1442570350000},"page":"257-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Discriminative Framework for Hashing"],"prefix":"10.1007","author":[{"given":"Lijie","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiumei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbo","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. of ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"25_CR2","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proc. of 25th International Conference on Very Large Data Bases, pp. 518\u2013529 (1999)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc of ACM Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. In: Proc of IEEE Conference on Computer Vision and Pattern Recognition, pp. 817\u2013824 (2011)","DOI":"10.1109\/CVPR.2011.5995432"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. on Pattern Analysis and Machine Intelligence 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"He, K., Wen, F., Sun, J.: K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: Proc of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2938\u20132945 (2013)","DOI":"10.1109\/CVPR.2013.378"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Shen, F., Shen, C., Shi, Q., Anton, H., Tang, Z.: Inductive hashing on manifolds. In: Proc of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1562\u20131569 (2013)","DOI":"10.1109\/CVPR.2013.205"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Wang, J., Sanjiv, K., Chang, S.: Supervised Hashing for Large Scale search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2393\u20132406 (2012)","DOI":"10.1109\/TPAMI.2012.48"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Liu, W., Wang, J., Ji, R., Jiang, Y., Chang, S.: Supervised hashing with kernels. In: Proc of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2074\u20132081 (2012)","DOI":"10.1109\/CVPR.2012.6247912"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Svante, W., Michael, S.: SIMCA: a method for analyzing chemical data in terms of similarity and analogy. In: Chemometrics: Theory and Application, vol. 52, pp. 243\u2013282 (1977)","DOI":"10.1021\/bk-1977-0052.ch012"},{"key":"25_CR11","unstructured":"Nikos, K., Paul, M.: Discriminative features via generalized eigenvectors. In: Proc of International Conference on Machine Learning, pp. 494\u2013502 (2014)"},{"key":"25_CR12","unstructured":"John, C., Toutanova, K., Yih, W.T.: Translingual document representations from discriminative projections. In: Proc of Conference on Empirical Methods in Natural Language Processing, pp. 251\u2013261. Association for Computational Linguistics (2010)"},{"key":"25_CR13","unstructured":"http:\/\/www.cs.toronto.edu\/~kriz\/cifar.html"},{"key":"25_CR14","unstructured":"http:\/\/yann.lecun.com\/exdb\/mnist"}],"container-title":["Communications in Computer and Information Science","Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48570-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T18:08:37Z","timestamp":1748628517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48570-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662485699","9783662485705"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48570-5_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"6 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}