{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T11:22:59Z","timestamp":1696332179500},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,26]],"date-time":"2015-03-26T00:00:00Z","timestamp":1427328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s13042-015-0350-9","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T04:47:48Z","timestamp":1427258868000},"page":"571-586","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sequential conditional entropy maximization semi-supervised hashing for semantic image retrieval"],"prefix":"10.1007","volume":"8","author":[{"given":"Wing W. Y.","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueming","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqian","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Yeung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick P. K.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"issue":"3","key":"350_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3):209\u2013226","journal-title":"ACM Trans Math Softw"},{"key":"350_CR2","doi-asserted-by":"crossref","unstructured":"Silpa-Anan C, Hartley R (2008) Optimised kd-trees for fast image descriptor matching. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"350_CR3","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the international conference on very large data bases, vol 23. Morgan Kaufmann Pub, San Francisco, pp 426\u2013435"},{"key":"350_CR4","doi-asserted-by":"crossref","unstructured":"Beygelzimer A, Kakade S, Langford J (2006) Cover trees for nearest neighbor. In: Proceedings of the 23rd international conference on machine learning. ACM, New York, pp 97\u2013104","DOI":"10.1145\/1143844.1143857"},{"issue":"4","key":"350_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4):175\u2013179","journal-title":"Inf Process Lett"},{"key":"350_CR6","volume-title":"Nearest neighbors in high-dimensional spaces","author":"P Indyk","year":"2004","unstructured":"Indyk P (2004) Nearest neighbors in high-dimensional spaces. CRC Press LLC, FL"},{"issue":"4","key":"350_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s13042-011-0062-8","volume":"3","author":"MK Kundu","year":"2012","unstructured":"Kundu MK, Chowdhury M, Banerjee M (2012) Interactive image retrieval using m-band wavelet, earth movers distance and fuzzy relevance feedback. Int J Mach Learn Cybern 3(4):285\u2013296","journal-title":"Int J Mach Learn Cybern"},{"key":"350_CR8","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing. ACM, New York, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"350_CR9","unstructured":"Gionis A, Indyk P, Motwani R et al (1999) Similarity search in high dimensions via hashing. In: Proceedings of the international conference on very large data bases, vol 99, pp 518\u2013529"},{"key":"350_CR10","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th annual IEEE symposium on foundations of computer science. IEEE, pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"issue":"1","key":"350_CR11","first-page":"6","volume":"9","author":"Y Weiss","year":"2008","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. NIPS 9(1):6","journal-title":"NIPS"},{"key":"350_CR12","unstructured":"Liu W, Wang J, Kumar S, Chang SF (2011) Hashing with graphs. In: Proceedings of the 28th international conference on machine learning (ICML-11), pp 1\u20138"},{"key":"350_CR13","doi-asserted-by":"crossref","unstructured":"He J, Radhakrishnan R, Chang SF, Bauer C (2011) Compact hashing with joint optimization of search accuracy and time. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 753\u2013760","DOI":"10.1109\/CVPR.2011.5995518"},{"issue":"12","key":"350_CR14","doi-asserted-by":"crossref","first-page":"2916","DOI":"10.1109\/TPAMI.2012.193","volume":"35","author":"Y Gong","year":"2013","unstructured":"Gong Y, Lazebnik S, Gordo A, Perronnin F (2013) Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans Pattern Anal Mach Intell 35(12):2916\u20132929","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"350_CR15","doi-asserted-by":"crossref","unstructured":"Norouzi M, Fleet DJ (2013) Cartesian k-means. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 3017\u20133024","DOI":"10.1109\/CVPR.2013.388"},{"key":"350_CR16","doi-asserted-by":"publisher","unstructured":"Lin Y, Jin R, Cai D, Yan S, Li X (2013) Compressed hashing. In: Proceedings of IEEE conference on computer vision and pattern recognition, ser. CVPR\u201913. IEEE Computer Society, Washington, DC, pp 446\u2013451. doi: 10.1109\/CVPR.2013.64","DOI":"10.1109\/CVPR.2013.64"},{"key":"350_CR17","doi-asserted-by":"crossref","unstructured":"He K, Wen F, Sun J (2013) K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 2938\u20132945","DOI":"10.1109\/CVPR.2013.378"},{"key":"350_CR18","doi-asserted-by":"crossref","unstructured":"Gong Y, Kumar S, Rowley HA, Lazebnik S (2013) Learning binary codes for high-dimensional data using bilinear projections. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 484\u2013491","DOI":"10.1109\/CVPR.2013.69"},{"key":"350_CR19","unstructured":"Liu W, Wang J, Ji R, Jiang YG, Chang SF (2012) Supervised hashing with kernels. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 2074\u20132081"},{"issue":"1","key":"350_CR20","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TPAMI.2011.103","volume":"34","author":"C Strecha","year":"2012","unstructured":"Strecha C, Bronstein AM, Bronstein MM, Fua P (2012) Ldahash: improved matching with smaller descriptors. IEEE Trans Pattern Anal Mach Intell 34(1):66\u201378","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"7","key":"350_CR21","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R Salakhutdinov","year":"2009","unstructured":"Salakhutdinov R, Hinton G (2009) Semantic hashing. Int J Approx Reason 50(7):969\u2013978","journal-title":"Int J Approx Reason"},{"key":"350_CR22","unstructured":"Norouzi M, Blei DM (2011) Minimal loss hashing for compact binary codes. In: Proceedings of the 28th international conference on machine learning (ICML-11), pp 353\u2013360"},{"key":"350_CR23","doi-asserted-by":"crossref","unstructured":"Xia Z, Feng X, Peng J, Wu J, Fan J (2015) A regularized optimization framework for tag completion and image retrieval. Neurocomputing 147:500\u2013508. (Advances in self-organizing maps subtitle of the special issue: selected papers from the workshop on self-organizing maps 2012 (WSOM\u201912)","DOI":"10.1016\/j.neucom.2014.06.028"},{"issue":"12","key":"350_CR24","doi-asserted-by":"crossref","first-page":"2393","DOI":"10.1109\/TPAMI.2012.48","volume":"34","author":"J Wang","year":"2012","unstructured":"Wang J, Kumar S, Chang S-F (2012) Semi-supervised hashing for large-scale search. IEEE Trans Pattern Anal Mach Intell 34(12):2393\u20132406","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"350_CR25","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/TKDE.2012.76","volume":"25","author":"C Wu","year":"2013","unstructured":"Wu C, Zhu J, Cai D, Chen C, Bu J (2013) Semi-supervised nonlinear hashing using bootstrap sequential projection learning. IEEE Trans Knowl Data Eng 25(6):1380\u20131393","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"350_CR26","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the twentieth annual symposium on computational geometry. ACM, New York, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"key":"350_CR27","doi-asserted-by":"crossref","unstructured":"Jain P, Kulis B, Grauman K (2008) Fast image search for learned metrics. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587841"},{"key":"350_CR28","doi-asserted-by":"crossref","unstructured":"Grauman K, Darrell T (2007) Pyramid match hashing: sub-linear time indexing over partial correspondences. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 1\u20138","DOI":"10.1109\/CVPR.2007.383225"},{"key":"350_CR29","doi-asserted-by":"crossref","unstructured":"Wang J, Kumar S, Chang S-F (2010) Semi-supervised hashing for scalable image retrieval. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 3424\u20133431","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"350_CR30","unstructured":"Wang J, Kumar S, Chang S-F (2010) Sequential projection learning for hashing with compact codes. In: Proceedings of the 27th international conference on machine learning (ICML-10), pp 1127\u20131134"},{"key":"350_CR31","doi-asserted-by":"publisher","unstructured":"Tanha J, van Someren M, Afsarmanesh H (2015) Semi-supervised self-training for decision tree classifiers. Int J Mach Learn Cybern 1\u201316. doi: 10.1007\/s13042-015-0328-7","DOI":"10.1007\/s13042-015-0328-7"},{"key":"350_CR32","doi-asserted-by":"publisher","unstructured":"Chen W-J, Shao Y-H, Hong N (2014) Laplacian smooth twin support vector machine for semi-supervised classification. Int J Mach Learn Cybern 5(3):459\u2013468. doi: 10.1007\/s13042-013-0183-3","DOI":"10.1007\/s13042-013-0183-3"},{"key":"350_CR33","doi-asserted-by":"publisher","unstructured":"Jiang J, Yan X, Yu Z, Guo J, Tian W (2014) A chinese expert disambiguation method based on semi-supervised graph clustering. Int J MachLearn Cybern 1\u20138. doi: 10.1007\/s13042-014-0255-z","DOI":"10.1007\/s13042-014-0255-z"},{"key":"350_CR34","doi-asserted-by":"publisher","unstructured":"Alok A, Saha S, Ekbal A (2015) Semi-supervised clustering for gene-expression data in multiobjective optimization framework. Int J Mach Learn Cybern 1\u201319. doi: 10.1007\/s13042-015-0335-8","DOI":"10.1007\/s13042-015-0335-8"},{"key":"350_CR35","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.neucom.2012.06.035","volume":"101","author":"C Yao","year":"2013","unstructured":"Yao C, Bu J, Wu C, Chen G (2013) Semi-supervised spectral hashing for fast similarity search. Neurocomputing 101:52\u201358","journal-title":"Neurocomputing"},{"key":"350_CR36","unstructured":"Xu H, Wang J, Li Z, Zeng G, Li S, Yu N (2011) Complementary hashing for approximate nearest neighbor search. In: IEEE international conference on computer vision. IEEE, pp 1631\u20131638"},{"key":"350_CR37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.neucom.2012.07.053","volume":"120","author":"P Li","year":"2013","unstructured":"Li P, Cheng J, Lu H (2013) Hashing with dual complementary projection learning for fast image retrieval. Neurocomputing 120:83\u201389","journal-title":"Neurocomputing"},{"key":"350_CR38","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.neucom.2013.05.033","volume":"122","author":"H Fu","year":"2013","unstructured":"Fu H, Kong X, Lu J (2013) Large-scale image retrieval based on boosting iterative quantization hashing with query-adaptive reranking. Neurocomputing 122:480\u2013489","journal-title":"Neurocomputing"},{"issue":"1","key":"350_CR39","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.cviu.2005.09.012","volume":"106","author":"L Fei-Fei","year":"2007","unstructured":"Fei-Fei L, Fergus R, Perona P (2007) Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. Comput Vis Image Underst 106(1):59\u201370","journal-title":"Comput Vis Image Underst"},{"key":"350_CR40","doi-asserted-by":"crossref","unstructured":"Wang J, Yang J, Yu K, Lv F, Huang T, Gong Y (2010) Locality-constrained linear coding for image classification. In: Proceedings of IEEE conference on computer vision and pattern recognition. IEEE, pp 3360\u20133367","DOI":"10.1109\/CVPR.2010.5540018"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0350-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0350-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T07:06:29Z","timestamp":1566457589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0350-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0350-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}