{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:12:18Z","timestamp":1771330338926,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642337147","type":"print"},{"value":"9783642337154","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33715-4_25","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T08:06:38Z","timestamp":1348646798000},"page":"340-353","source":"Crossref","is-referenced-by-count":72,"title":["Multidimensional Spectral Hashing"],"prefix":"10.1007","author":[{"given":"Yair","family":"Weiss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Fergus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Torralba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity Search in High Dimensions via Hashing. In: Proc. Intl Conf. on Very Large Data Bases (1999)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"25_CR3","unstructured":"Raginksi, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: NIPS (2009)"},{"key":"25_CR4","unstructured":"Salakhutdinov, R.R., Hinton, G.E.: Semantic hashing. In: SIGIR Workshop on Information Retrieval and Applications of Graphical Models (2007)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Torralba, A., Fergus, R., Weiss, Y.: Small Codes and Large Image Databases for Recognition. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"25_CR6","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS (2008)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Xu, H., Wang, J., Li, Z., Zeng, G., Li, S., Yu, N.: Complementary hashing for approximate nearest neighbor search. In: ICCV, pp. 1631\u20131638 (2011)","DOI":"10.1109\/ICCV.2011.6126424"},{"key":"25_CR8","unstructured":"Wang, J., Kumar, S., Chang, S.F.: Sequential projection learning for hashing with compact codes. In: ICML, pp. 1127\u20131134 (2010)"},{"key":"25_CR9","unstructured":"Kulis, B., Darrell, T.: Learning to Hash with Binary Reconstructive Embeddings. In: NIPS (2009)"},{"key":"25_CR10","unstructured":"Norouzi, M., Fleet, D.: Minimal loss hashing for compact binary codes. In: ICML (2011)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lin, R., Yagnik, D.R.: Spec hashing: Similarity preserving algorithm for entropy-based coding. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5540129"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Iterative quantization: A procrustean approach to learning binary codes. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"25_CR13","unstructured":"Srebro, N., Jaakkola, T.: Weighted low-rank approximations. In: ICML, pp. 720\u2013727 (2003)"},{"key":"25_CR14","unstructured":"Kumar, S., Mohri, M., Talwalkar, A.: Sampling techniques for the Nystrom method. In: AISTATS (2009)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"7426","DOI":"10.1073\/pnas.0500334102","volume":"21","author":"R.R. Coifman","year":"2005","unstructured":"Coifman, R.R., Lafon, S., Lee, A., Maggioni, M., Nadler, B., Warner, F., Zucker, S.: Geometric diffusion as a tool for harmonic analysis and structure definition of data, part i: Diffusion maps. PNAS\u00a021, 7426\u20137431 (2005)","journal-title":"PNAS"},{"key":"25_CR16","unstructured":"Fergus, R., Weiss, Y., Torralba, A.: Semi-supervised learning in gigantic image collections. In: NIPS (2009)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1016\/j.jcss.2007.08.006","volume":"74","author":"M. Belkin","year":"2008","unstructured":"Belkin, M., Niyogi, P.: Towards a theoretical foundation for laplacian-based manifold methods. J. Comput. Syst. Sci.\u00a074, 1289\u20131308 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR18","unstructured":"Nadler, B., Srebro, N., Zhou, X.: Statistical analysis of semi-supervised learning: The limit of infinite unlabelled data. In: NIPS, pp. 1330\u20131338 (2009)"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE PAMI\u00a022, 888\u2013905 (2000)","journal-title":"IEEE PAMI"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33715-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:14:00Z","timestamp":1744208040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33715-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337147","9783642337154"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33715-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}