{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:46:29Z","timestamp":1760237189582,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61472194","No. 61572266"],"award-info":[{"award-number":["No. 61472194","No. 61572266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang NSF","award":["No. LZ20F020001","No. LY20F020009"],"award-info":[{"award-number":["No. LZ20F020001","No. LY20F020009"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>With the rapid development of modern society, generated data has increased exponentially. Finding required data from this huge data pool is an urgent problem that needs to be solved. Hashing technology is widely used in similarity searches of large-scale data. Among them, the ranking-based hashing algorithm has been widely studied due to its accuracy and speed regarding the search results. At present, most ranking-based hashing algorithms construct loss functions by comparing the rank consistency of data in Euclidean and Hamming spaces. However, most of them have high time complexity and long training times, meaning they cannot meet requirements. In order to solve these problems, this paper introduces a distributed Spark framework and implements the ranking-based hashing algorithm in a parallel environment on multiple machines. The experimental results show that the Spark-RLSH (Ranking Listwise Supervision Hashing) can greatly reduce the training time and improve the training efficiency compared with other ranking-based hashing algorithms.<\/jats:p>","DOI":"10.3390\/info11030148","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T05:37:34Z","timestamp":1583732254000},"page":"148","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Ranking-Based Hashing Algorithm Based on the Distributed Spark Platform"],"prefix":"10.3390","volume":"11","author":[{"given":"Anbang","family":"Yang","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangbo","family":"Qian","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huahui","family":"Chen","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihong","family":"Dong","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Indyk, P. (2004). Nearest Neighbors in High-Dimensional Spaces. Discrete Math. Its Appl., 20042571.","DOI":"10.1201\/9781420035315.ch39"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/293347.293348","article-title":"An Optimal Algorithm for Approximate Nearest Neighbor Searching","volume":"45","author":"Arya","year":"1998","journal-title":"J. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD International Conference on Management of Data, SIGMOD.","DOI":"10.1145\/602259.602266"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bentley, J.L. (1990). K-d trees for semidynamic point sets. Annu. Symp., 187\u2013197.","DOI":"10.1145\/98524.98564"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., and Mirrokni, V. (2004). Locality-sensitive hashing scheme based on p-stable distributions. Annu. Symp., 253\u2013262.","DOI":"10.1145\/997817.997857"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","article-title":"A Survey on Learning to Hash","volume":"40","author":"Wangb","year":"2018","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TPAMI.2011.219","article-title":"Kernelized Locality-Sensitive Hashing","volume":"34","author":"Kulis","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_8","unstructured":"Weiss, Y., Torralba, A., and Fergus, R. (2020, March 07). Spectral Hashing. Available online: https:\/\/people.csail.mit.edu\/torralba\/publications\/spectralhashing.pdf."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhang, D., Wang, J., Cai, D., and Lu, J. (2010, January 19). Self-taught hashing for fast similarity search. Proceedings of the  33rd international ACM SIGIR conference, New York, NY, USA.","DOI":"10.1145\/1835449.1835455"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.neucom.2013.05.033","article-title":"Large-scale image retrieval based on boosting iterative quantization hashing with query-adaptive reranking","volume":"122","author":"Fu","year":"2013","journal-title":"Neurocomputing"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1109\/TIP.2018.2882155","article-title":"Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval","volume":"28","author":"Wu","year":"2018","journal-title":"IEEE Trans. Image Process."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Lin, R.-S., Ross, D.A., and Yagnik, J. SPEC Hashing: Similarity Preserving Algorithm for Entropy-Based Coding; In Proceedings of the 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), San Francisco, CA, USA2010; pp.","DOI":"10.1109\/CVPR.2010.5540129"},{"key":"ref_13","unstructured":"Norouzi, M., and Blei, D.M. Minimal Loss Hashing for Compact Binary Codes; In Proceedings of the International Machine Learning Society (IMLS), 28 June\u20132 July 2011; pp."},{"key":"ref_14","unstructured":"Liu, W., Wang, J., Ji, R., Jiang, Y.-G., and Chang, S.-F. (2012, January 16\u201321). Supervised hashing with kernels. Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Shen, F., Shen, C., Liu, W., and Shen, H.T. (2015, January 7\u201312). Supervised Discrete Hashing. Proceedings of the 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Boston, MA, USA.","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yao, T., Kong, X., Fu, H., and Tian, Q. (2019). Discrete Semantic Alignment Hashing for Cross-Media Retrieval. IEEE Trans. Cybern., 1\u201312.","DOI":"10.1016\/j.patcog.2018.12.012"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TPAMI.2011.103","article-title":"LDAHash: Improved Matching with Smaller Descriptors","volume":"34","author":"Strecha","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Lin, G., Shen, C., and Wu, J. (2014, January 6\u201312). Optimizing Ranking Measures for Compact Binary Code Learning. Proceedings of the 13th European Conference on Computer Vision, Zurich, Switzerland.","DOI":"10.1007\/978-3-319-10578-9_40"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Wang, J., Wangb, J., Yu, N., and Li, S. (2013, January 21). Order preserving hashing for approximate nearest neighbor search. Proceedings of the 21st ACM international conference on Multimedia\u2014MM\u201913, Nara, Japan.","DOI":"10.1145\/2502081.2502100"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ji, T., Liu, X., Deng, C., Huang, L., and Lang, B. (2014, January 3). Query-Adaptive Hash Code Ranking for Fast Nearest Neighbor Search. Proceedings of the ACM International Conference on Interactive Experiences for TV and Online Video\u2014TVX\u201916; Association for Computing Machinery (ACM), Newcastle, UK.","DOI":"10.1145\/2647868.2655018"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Song, D., Liu, W., Ji, R., Meyer, D., and Smith, J.R. (2015, January 7\u201313). Top Rank Supervised Binary Coding for Visual Search. Proceedings of the 2015 IEEE International Conference on Computer Vision (ICCV), Santiago, Chile.","DOI":"10.1109\/ICCV.2015.223"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Song, D., Liu, W., Meyer, D., Tao, D., and Ji, R.D.A.M. (2015, January 7\u20139). Rank Preserving Hashing for Rapid Image Search. In Proceedings of the 2015 Data Compression Conference. Proceedings of the  Institute of Electrical and Electronics Engineers (IEEE), Snowbird, UT, USA.","DOI":"10.1109\/DCC.2015.85"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TMM.2012.2231061","article-title":"Query-Adaptive Image Search with Hash Codes","volume":"15","author":"Jiang","year":"2012","journal-title":"IEEE Trans. Multimedia"},{"key":"ref_24","unstructured":"Zhang, X., Zhang, L., and Heung-Yeung, S. (2012, January 16\u201321). QsRank:Query-sensitive Hash Code Ranking for Efficient \u03b5-nighbor Search. Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Providence, RI, USA."},{"key":"ref_25","unstructured":"Li, X., Lin, G., Shen, C., Hengel, A.V.D., and Dick, A. (2013). Learning Hash Functions Using Column Generation. arXiv."},{"key":"ref_26","unstructured":"Norouzi, M., Fleet, D.J., and Salakhutdinov, R. (2012, January 3\u20138). Hamming Distance Metric Learning. Proceedings of the Twenty-sixth Conference on Neural Information Processing Systems, Lake Tahoe, NA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Wang, J., Liu, W., Sun, A.X., and Jiang, Y.-G. (2013, January 2\u20133). Learning Hash Codes with Listwise Supervision. Proceedings of the 2013 IEEE International Conference on Computer Vision, Sydney, Australia.","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref_28","unstructured":"Wang, Q., Zhang, Z., and Si, L. (2015, January 27). Ranking Preserving Hashing for Fast Similiarity Search. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina."},{"key":"ref_29","unstructured":"Yao, T., Long, F., Mei, T., and Rui, Y. (2016, January 9). Deep Semantic Preserving and Ranking-based Hashing for Image Retrieval. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Liu, L., Shao, L., Shen, F., and Yu, M. (2017, January 21\u201326). Discretely Coding Semantic Rank Orders for Supervised Image Hashing. Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Honolulu, HI, USA.","DOI":"10.1109\/CVPR.2017.546"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/3\/148\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:05:19Z","timestamp":1760173519000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/3\/148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,3]]}},"alternative-id":["info11030148"],"URL":"https:\/\/doi.org\/10.3390\/info11030148","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2020,3,9]]}}}