{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T01:10:08Z","timestamp":1748740208791,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276700"},{"type":"electronic","value":"9783319276717"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-27671-7_28","type":"book-chapter","created":{"date-parts":[[2016,1,2]],"date-time":"2016-01-02T10:29:08Z","timestamp":1451730548000},"page":"337-348","source":"Crossref","is-referenced-by-count":0,"title":["SOMH: A Self-Organizing Map Based Topology Preserving Hashing Method"],"prefix":"10.1007","author":[{"given":"Xiao-Long","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin-Shun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhen","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanqing","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Lin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,3]]},"reference":[{"key":"28_CR1","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. arXiv (2014)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Potamias, M., Papapetrou, P., Kollios, G.: Nearest neighbor retrieval using distance-based hashing. In: Proceedings of ICDE, pp. 327\u2013336 (2008)","DOI":"10.1109\/ICDE.2008.4497441"},{"issue":"8","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TCYB.2013.2283497","volume":"44","author":"Z Jin","year":"2013","unstructured":"Jin, Z., Li, C., Lin, Y., Cai, D.: Density sensitive hashing. IEEE Trans. Cybern. 44(8), 1362\u20131371 (2013)","journal-title":"IEEE Trans. Cybern."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Zhen, Y., Yeung, D.Y.: A probabilistic model for multimodal hash function learning. In: Proceedings of KDD, pp. 940\u2013948 (2012)","DOI":"10.1145\/2339530.2339678"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Wang, J., Kumar, S., Chang, S.-F.: Sequential projection learning for hashing with compact codes. In: Proceedings of CVPR, pp. 3424\u20133431 (2010)","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Kim, S., Choi, S.: Semi-supervised discriminant hashing. In: Proceedings of ICDM, pp. 1122\u20131127 (2011)","DOI":"10.1109\/ICDM.2011.128"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Wang, S.S., Huang, Z., Xu, X.-S.: A multi-label least-squares hashing for scalable image search. In: Proceedings of SDM 2015, pp. 954\u2013962 (2015)","DOI":"10.1137\/1.9781611974010.107"},{"key":"28_CR9","unstructured":"Xu, B., Bu, J., Lin, Y., Chen, C., He, X., Cai, D.: Harmonious hashing. In: Proceedings of IJCAI, pp. 1820\u20131826 (2013)"},{"key":"28_CR10","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of VLDB, pp. 518\u2013529 (1999)"},{"key":"28_CR11","unstructured":"Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: NIPS, vol. 22, pp. 1509\u20131517 (2009)"},{"key":"28_CR12","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, vol. 21, pp. 1753\u20131760 (2008)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15, 1373\u20131396 (2003)","journal-title":"Neural Comput."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. In: Proceedings of CVPR, pp. 817\u2013824 (2011)","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Irie, G., Li, Z., Wu, X.M., Chang, S.F.: Locally linear hashing for extracting non-linear manifolds. In: Proceedings of CVPR, pp. 2123\u20132130 (2014)","DOI":"10.1109\/CVPR.2014.272"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Shen, F., Shen, C., Shi, Q., van den Hengel, A.: Inductive hashing on manifolds. In: Proceedings of CVPR, pp. 1562\u20131569 (2013)","DOI":"10.1109\/CVPR.2013.205"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"He, K., Wen, H., Sun, J.: K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: Proceedings of CVPR, pp. 2938\u20132945 (2013)","DOI":"10.1109\/CVPR.2013.378"},{"key":"28_CR18","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-04579-0_30","volume-title":"Mathematics and Computation in Music","author":"T Johnson","year":"2009","unstructured":"Johnson, T.: Networks. In: Klouche, T., Noll, T. (eds.) MCM 2007. CCIS, vol. 37, pp. 311\u2013317. Springer, Heidelberg (2009)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Norouzi, M., Fleet, D.J.: Cartesian K-means. In: Proceedings of CVPR, pp. 3017\u20133024 (2013)","DOI":"10.1109\/CVPR.2013.388"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: Proceedings of CVPR, pp. 2946\u20132953 (2013)","DOI":"10.1109\/CVPR.2013.379"}],"container-title":["Lecture Notes in Computer Science","MultiMedia Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27671-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:34:44Z","timestamp":1748738084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27671-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319276700","9783319276717"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27671-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}