{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T09:32:59Z","timestamp":1769160779185,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T00:00:00Z","timestamp":1534550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T00:00:00Z","timestamp":1534550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s00521-018-3684-x","type":"journal-article","created":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T10:15:12Z","timestamp":1534587312000},"page":"10859-10871","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bagging trees with Siamese-twin neural network hashing versus unhashed features for unsupervised image retrieval"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5147-2639","authenticated-orcid":false,"given":"Mohamed Waleed","family":"Fakhr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Moheeb","family":"Emara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. B.","family":"Abdelhalim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,18]]},"reference":[{"issue":"1","key":"3684_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/JPROC.2015.2487976","volume":"104","author":"J Wang","year":"2016","unstructured":"Wang J, Liu W, Kumar S, Chang S-F (2016) Learning to hash for indexing big data\u2014a survey. Proc IEEE 104(1):34\u201357","journal-title":"Proc IEEE"},{"issue":"6","key":"3684_CR2","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TPAMI.2011.219","volume":"34","author":"B Kulis","year":"2011","unstructured":"Kulis B, Grauman K (2011) Kernelized locality-sensitive hashing. IEEE Trans Pattern Anal Mach Intell 34(6):1092\u20131104","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3684_CR3","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: NIPS, pp 1753\u20131760"},{"issue":"12","key":"3684_CR4","doi-asserted-by":"publisher","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":"3684_CR5","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1109\/TPAMI.2015.2408363","volume":"37","author":"J-P Heo","year":"2015","unstructured":"Heo J-P, Lee Y, He J, Chang S-F, Yoon S-E (2015) Spherical hashing, binary code selection with hyperspheres. IEEE Trans PAMI 37:2304\u20132316","journal-title":"IEEE Trans PAMI"},{"key":"3684_CR6","unstructured":"Xu F, Kumar S, Gong Y, Chang S-F (2014) Circulant binary embedding. In: ICML. arXiv:1405.3162"},{"issue":"9","key":"3684_CR7","doi-asserted-by":"publisher","first-page":"3737","DOI":"10.1109\/TIP.2014.2332764","volume":"23","author":"X Zhu","year":"2014","unstructured":"Zhu X, Zhang L, Huang Z (2014) A sparse embedding and least variance encoding approach to hashing. IEEE Trans Image Process 23(9):3737\u20133750","journal-title":"IEEE Trans Image Process"},{"key":"3684_CR8","first-page":"1042","volume-title":"Advances in neural information processing systems 20","author":"B Kulis","year":"2009","unstructured":"Kulis B, Darrell T (2009) Learning to hash with binary reconstructive embeddings. In: Bengio Y, Schuurmans D, Lafferty J, Williams CKI, Culotta A (eds) Advances in neural information processing systems 20. MIT Press, Cambridge, pp 1042\u20131050"},{"key":"3684_CR9","doi-asserted-by":"crossref","unstructured":"Kulis B, Grauman K (2009) Kernelized locality-sensitive hashing for scalable image search. In: ICCV, pp 2130\u20132137","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"3684_CR10","unstructured":"Jiang Q-Y, Li W-J (2015) Scalable graph hashing with feature transformation (SGH). In: IJCAI"},{"key":"3684_CR11","unstructured":"Norouzi M, Blei DM (2011) Minimal loss hashing for compact binary codes (MLH). In: ICML"},{"key":"3684_CR12","doi-asserted-by":"crossref","unstructured":"Ge T, He K, Sun J (2014) Graph cuts for supervised binary coding (GCC). In: ECCV","DOI":"10.1007\/978-3-319-10584-0_17"},{"key":"3684_CR13","doi-asserted-by":"crossref","unstructured":"Lin G, Shen C, Shi Q, van den Hengel A, Suter D (2014) Fast supervised hashing with decision trees for high-dimensional data. In: CVPR","DOI":"10.1109\/CVPR.2014.253"},{"key":"3684_CR14","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TPAMI.2015.2404776","volume":"37","author":"G Lin","year":"2015","unstructured":"Lin G, Shen C, van den Hengel A (2015) Supervised hashing using graph cuts and boosted decision trees. IEEE Trans. PAMI 37:2317\u20132331","journal-title":"IEEE Trans. PAMI"},{"key":"3684_CR15","unstructured":"Liu W, Wang J, Ji R, Jiang Y-G, Chang S-F (2012) Supervised hashing with kernels (KSH). In: CVPR"},{"key":"3684_CR16","doi-asserted-by":"crossref","unstructured":"Erin Liong V, Lu J, Wang G, Moulin P, Zhou J (2015) Deep hashing for compact binary codes learning (DH). In: CVPR","DOI":"10.1109\/CVPR.2015.7298862"},{"key":"3684_CR17","doi-asserted-by":"crossref","unstructured":"Lin K, Yang H-F, Hsiao J-H, Chen C-S (2015) Deep learning of binary hash codes for fast image retrieval (HDS). In: CVPRW","DOI":"10.1109\/CVPRW.2015.7301269"},{"issue":"2","key":"3684_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/TPAMI.2017.2666812","volume":"40","author":"H-F Yang","year":"2018","unstructured":"Yang H-F, Lin K, Chen C-S (2018) Supervised learning of semantics-preserving hash via deep convolutional neural networks. IEEE Trans Pattern Anal Mach Intell 40(2):437\u2013451","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3684_CR19","doi-asserted-by":"crossref","unstructured":"Cao Z, Long M, Wang J, Philip SY (2017) Hashnet: deep learning to hash by continuation. arXiv preprint arXiv:1702.00758","DOI":"10.1109\/ICCV.2017.598"},{"key":"3684_CR20","doi-asserted-by":"crossref","unstructured":"Huang, S, Xiong Y, Zhang Y, Wang J (2017) Unsupervised triplet hashing for fast image retrieval. In: Proceedings of the on thematic workshops of ACM multimedia 2017. ACM, New York, pp 84\u201392","DOI":"10.1145\/3126686.3126773"},{"key":"3684_CR21","doi-asserted-by":"crossref","unstructured":"Jin S (2018) Unsupervised semantic deep hashing. arXiv preprint arXiv:1803.06911","DOI":"10.1016\/j.neucom.2019.01.020"},{"issue":"4","key":"3684_CR22","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1109\/TIP.2017.2781422","volume":"27","author":"H Zhang","year":"2018","unstructured":"Zhang H, Liu L, Long Y, Shao L (2018) Unsupervised deep hashing with pseudo labels for scalable image retrieval. IEEE Trans Image Process 27(4):1626\u20131638","journal-title":"IEEE Trans Image Process"},{"key":"3684_CR23","doi-asserted-by":"crossref","unstructured":"Fakhr MW, Moheeb M, AbdelHalim MB (2017) Siamese-twin random projection neural network with Bagging Trees tuning for unsupervised binary image hashing. In: 5th international symposium on computational and business intelligence (ISCBI)","DOI":"10.1109\/ISCBI.2017.8053536"},{"key":"3684_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00500-018-3128-7","volume":"22","author":"C Chen","year":"2018","unstructured":"Chen C, Vong C-M, Wong C-M, Wang W, Wong P-K (2018) Efficient extreme learning machine via very sparse random projection. Soft Comput 22:1\u201312","journal-title":"Soft Comput"},{"key":"3684_CR25","doi-asserted-by":"crossref","unstructured":"Fakhr MW, Youssef E-N, El-Mahallawy M (2015) L1-regularized least squares sparse extreme learning machine for classification. In: 2015 international conference on Information and Communication Technology Research (ICTRC), pp 222\u2013225","DOI":"10.1109\/ICTRC.2015.7156462"},{"key":"3684_CR26","doi-asserted-by":"crossref","unstructured":"Sun X, Torfi A, Nasrabadi N (2018) Deep siamese convolutional neural networks for identical twins and look-alike identification. In: Vatsa M, Singh R, Majumdar A (eds) Deep Learning in Biometrics, Chap 3. Taylor and Francis, p 65","DOI":"10.1201\/b22524-3"},{"key":"3684_CR27","unstructured":"Mairal J, Jenatton R, Obozinski G, Bach F (2010) Network flow algorithms for structured sparsity. In: Advance neural information processing systems (NIPS)"},{"issue":"1","key":"3684_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"issue":"14","key":"3684_CR29","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1016\/j.patrec.2010.03.014","volume":"31","author":"R Genuer","year":"2010","unstructured":"Genuer R, Poggi J-M, Tuleau-Malot C (2010) Variable selection using random forests. Pattern Recogn Lett 31(14):2225\u20132236","journal-title":"Pattern Recogn Lett"},{"key":"3684_CR30","unstructured":"https:\/\/sites.google.com\/site\/dctresearch\/Home\/content-based-image-retrieval. Accessed 14 Jan 2018"},{"key":"3684_CR31","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images. Master\u2019s thesis, Department of Computer Science, University of Toronto"},{"key":"3684_CR32","unstructured":"Moheeb M, Fakhr MW, AbdelHalim MB (2016) A neural network approach for binary hashing in image retrieval. In: 2nd international conference on advanced intelligent systems and informatics, Cairo, Egypt"},{"key":"3684_CR33","unstructured":"http:\/\/www.cs.toronto.edu\/~kriz\/cifar.html. Accessed 10 Feb 2018"},{"key":"3684_CR34","unstructured":"Yunchao G, Lazebnik S (2011) Iterative quantization: A procrustean approach to learning binary codes. In: 2011 IEEE conference on computer vision and pattern recognition (CVPR), IEEE"},{"key":"3684_CR35","unstructured":"https:\/\/github.com\/willard-yuan\/hashing-baseline-for-image-retrieval. Accessed 12 Jan 2018"},{"key":"3684_CR36","unstructured":"https:\/\/github.com\/czxxjtu\/Hash-Learning.github.io. Accessed 12 Jan 2018"},{"key":"3684_CR37","unstructured":"https:\/\/github.com\/dengcai78\/MatlabFunc\/tree\/master\/ANNS\/Hashing. Accessed 12 Jan 2018"},{"key":"3684_CR38","unstructured":"MATLAB 2017a (2017) The MathWorks, Natick"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3684-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-018-3684-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3684-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:23:45Z","timestamp":1749803025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-018-3684-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,18]]},"references-count":38,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["3684"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3684-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,18]]},"assertion":[{"value":"2 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}