{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:43:04Z","timestamp":1777502584331,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T00:00:00Z","timestamp":1647043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T00:00:00Z","timestamp":1647043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2019jcyj-msxmX0683"],"award-info":[{"award-number":["cstc2019jcyj-msxmX0683"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006029"],"award-info":[{"award-number":["62006029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11276-022-02927-9","type":"journal-article","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T17:02:41Z","timestamp":1647104561000},"page":"4195-4208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A robust method based on locality sensitive hashing for K-nearest neighbors searching"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3500-5461","authenticated-orcid":false,"given":"Dongdong","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinlong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanwang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,12]]},"reference":[{"issue":"1","key":"2927_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TKDE.2015.2460735","volume":"28","author":"AM Almalawi","year":"2016","unstructured":"Almalawi, A. M., Fahad, A., Tari, Z., Cheema, M. A., & Khalil, I. (2016). $$k$$ nnvwc: An efficient $$k$$ -nearest neighbors approach based on various-widths clustering. IEEE Transactions on Knowledge and Data Engineering, 28(1), 68\u201381.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2927_CR2","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, ICML \u201906, p. 97C104. Association for Computing Machinery, New York, NY, USA.","DOI":"10.1145\/1143844.1143857"},{"issue":"3","key":"2927_CR3","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder, A. Z., Charikar, M., & Frieze, A. M. (2000). Min-wise independent permutations. Journal of computer and system sciences, 60(3), 630\u2013659.","journal-title":"Journal of computer and system sciences"},{"key":"2927_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, Moses, S. (2002). Similarity estimation techniques from rounding algorithms. In The 34th symposium on theory of computing (STOC), pp. 380\u2013388.","DOI":"10.1145\/509907.509965"},{"key":"2927_CR5","doi-asserted-by":"publisher","first-page":"104824","DOI":"10.1016\/j.knosys.2019.06.032","volume":"187","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Hu, X., Fan, W., Shen, L., Zhang, Z., Liu, X., Du, J., Li, H., Chen, Y., & Li, H. (2020). Fast density peak clustering for large scale data based on knn. Knowledge-Based Systems, 187, 104824.","journal-title":"Knowledge-Based Systems"},{"key":"2927_CR6","doi-asserted-by":"publisher","unstructured":"Chen, Y., Zhou, L., Bouguila, N., Zhong, B., Wu, F., Lei, Z., Du, J., & Li, H. (2018). Semi-convex hull tree: Fast nearest neighbor queries for large scale data on gpus. In 2018 IEEE International Conference on Data Mining (ICDM), pp. 911\u2013916 . https:\/\/doi.org\/10.1109\/ICDM.2018.00110","DOI":"10.1109\/ICDM.2018.00110"},{"key":"2927_CR7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2956527","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Zhou, L., Pei, S., Yu, Z., Chen, Y., Liu, X., Du, J., & Xiong, N. (2019). Knn-block dbscan: Fast clustering for large-scale data. IEEE Transactions on Systems, Man, and Cybernetics: Systems. https:\/\/doi.org\/10.1109\/TSMC.2019.2956527","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"2927_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3049490","author":"D Cheng","year":"2021","unstructured":"Cheng, D., Huang, J., Zhang, S., Zhang, X., & Luo, X. (2021). A novel approximate spectral clustering algorithm with dense cores and density peaks. IEEE Transactions on Systems, Man, and Cybernetics: Systems.https:\/\/doi.org\/10.1109\/TSMC.2021.3049490","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems."},{"issue":"4","key":"2927_CR9","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/TNNLS.2018.2853710","volume":"30","author":"D Cheng","year":"2019","unstructured":"Cheng, D., Zhu, Q., Huang, J., Wu, Q., & Yang, L. (2019). A novel cluster validity index based on local cores. IEEE Transactions on Neural Networks and Learning Systems, 30(4), 985\u2013999.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"2","key":"2927_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","volume":"33","author":"D Cheng","year":"2021","unstructured":"Cheng, D., Zhu, Q., Huang, J., Wu, Q., & Yang, L. (2021). Clustering with local density peaks-based minimum spanning tree. IEEE Transactions on Knowledge and Data Engineering, 33(2), 374\u2013387. https:\/\/doi.org\/10.1109\/TKDE.2019.2930056","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2927_CR11","unstructured":"Ciaccia, P., Patella, M., & Zezula, P. (1997). M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB \u201997, p. 426C435. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"2927_CR12","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., & Sarlos, T. (2011). Fast locality-sensitive hashing. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1073\u20131081. Association for Computing Machinery, New York, NY, USA.","DOI":"10.1145\/2020408.2020578"},{"key":"2927_CR13","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. (2004). Locality sensitive hashing scheme based on p-stable distributions. socg \u201904. In SCG\u201904 proceedings of the twentieth annual symposium on computational Geometry, pp. 253\u2013262.","DOI":"10.1145\/997817.997857"},{"key":"2927_CR14","doi-asserted-by":"crossref","unstructured":"Gu, X., Zhang, L., Zhang, D., Zhang, Y., Li, J., & Bao, N. (2012). Query range sensitive probability guided multi-probe locality sensitive hashing.","DOI":"10.1109\/SNPD.2012.35"},{"key":"2927_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.knosys.2015.10.014","volume":"92","author":"J Huang","year":"2015","unstructured":"Huang, J., Zhu, Q., Yang, L., & Ji, F. (2015). A non-parameter outlier detection algorithm based on natural neighbor. Knowledge-Based Systems, 92, 71\u201377.","journal-title":"Knowledge-Based Systems"},{"key":"2927_CR16","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R., Raghavan, P., & Vempala, S. (1997). Locality-preserving hashing in multidimensional spaces. In The 29th Symposium on Theory of Computing (STOC), pp. 618\u2013625.","DOI":"10.1145\/258533.258656"},{"key":"2927_CR17","doi-asserted-by":"crossref","unstructured":"Indyk, P., R., M. (1998). Approximate nearest neighbor: Towards removing the curse of dimensionality. In The 30th symposium on theory of computing (STOC), pp. 618\u2013625.","DOI":"10.1145\/276698.276876"},{"key":"2927_CR18","doi-asserted-by":"publisher","unstructured":"Koga, H., Oguri, M., & Watanabe, T. (2012). Mixed-lsh: Reduction of remote accesses in distributed locality-sensitive hashing based on l1-distance. In 2012 IEEE 26th international conference on advanced information networking and applications, pp. 175\u2013182 . https:\/\/doi.org\/10.1109\/AINA.2012.29","DOI":"10.1109\/AINA.2012.29"},{"key":"2927_CR19","doi-asserted-by":"crossref","unstructured":"Kulis, B.K.G. (2012). Kernelized locality-sensitive hashing. IEEE Transactions on Pattern Analysis & Machine Intelligence, 34(6), 1092\u20131104.","DOI":"10.1109\/TPAMI.2011.219"},{"issue":"1","key":"2927_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TMM.2012.2199970","volume":"15","author":"P Li","year":"2013","unstructured":"Li, P., Wang, M., Cheng, J., Xu, C., & Lu, H. (2013). Spectral hashing with semantically consistent graph for image indexing. IEEE Transactions on Multimedia, 15(1), 141\u2013152. https:\/\/doi.org\/10.1109\/TMM.2012.2199970","journal-title":"IEEE Transactions on Multimedia"},{"issue":"8","key":"2927_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1088\/1674-1056\/23\/8\/080203","volume":"23","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Ma, T., Zhong, S., Cao, J., Wang, X., & Abdullah, A. (2014). Improved locality-sensitive hashing method for the approximate nearest neighbor problem. Chinese Physics B, 23(8), 80.","journal-title":"Chinese Physics B"},{"issue":"5","key":"2927_CR22","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1109\/TCYB.2019.2894283","volume":"50","author":"X Luo","year":"2020","unstructured":"Luo, X., Zhou, M., Li, S., Hu, L., & Shang, M. (2020). Non-negativity constrained missing data estimation for high-dimensional and sparse matrices from industrial applications. IEEE Transactions on Cybernetics, 50(5), 1844\u20131855.","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"5","key":"2927_CR23","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1109\/TII.2017.2766528","volume":"14","author":"X Luo","year":"2018","unstructured":"Luo, X., Zhou, M., Li, S., & Shang, M. (2018). An inherently nonnegative latent factor model for high-dimensional and sparse matrices from industrial applications. IEEE Transactions on Industrial Informatics, 14(5), 2011\u20132022.","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"11","key":"2927_CR24","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., & Lowe, D. G. (2014). Scalable nearest neighbor algorithms for high dimensional data. IEEE Transactions on Pattern Analysis & Machine Intelligence, 36(11), 2227\u20132240.","journal-title":"IEEE Transactions on Pattern Analysis & Machine Intelligence"},{"key":"2927_CR25","doi-asserted-by":"crossref","unstructured":"Panigrahy, R. (2005). Entropy based nearest neighbor search in high dimensions. In SODA 06: proceedings of the seventeenth annual acm-siam symposium on discrete algorithms, pp. 1186\u20131195.","DOI":"10.1145\/1109557.1109688"},{"key":"2927_CR26","unstructured":"Qin, L., Josephson, W., Zhe, W., Charikar, M., Kai, L. (2007). Multi-probe lsh: efficient indexing for high-dimensional similarity search. In International conference on very large data bases, pp. 950\u2013961."},{"key":"2927_CR27","doi-asserted-by":"crossref","unstructured":"Shakhnarovich, G., Darrell, T., & Indyk, P. (2006). Locality-sensitive hashing using stable distributions, pp. 61\u201372.","DOI":"10.7551\/mitpress\/4908.003.0006"},{"issue":"9","key":"2927_CR28","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1109\/JPROC.2012.2193849","volume":"100","author":"M Slaney","year":"2012","unstructured":"Slaney, M., Lifshits, Y., & He, J. (2012). Optimal parameters for locality-sensitive hashing. Proceedings of the IEEE, 100(9), 2604\u20132623. https:\/\/doi.org\/10.1109\/JPROC.2012.2193849","journal-title":"Proceedings of the IEEE"},{"issue":"1\u20136","key":"2927_CR29","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"RF Sproull","year":"1991","unstructured":"Sproull, R. F. (1991). Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6(1\u20136), 579\u2013589.","journal-title":"Algorithmica"},{"issue":"12","key":"2927_CR30","doi-asserted-by":"publisher","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 Transactions on Pattern Analysis and Machine Intelligence, 34(12), 2393\u20132406. https:\/\/doi.org\/10.1109\/TPAMI.2012.48","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"2927_CR31","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.ins.2020.08.092","volume":"547","author":"W Wang","year":"2021","unstructured":"Wang, W., Zhang, H., Zhang, Z., Liu, L., & Shao, L. (2021). Sparse graph based self-supervised hashing for scalable image retrieval. Information Sciences, 547, 622\u2013640.","journal-title":"Information Sciences"},{"key":"2927_CR32","doi-asserted-by":"publisher","unstructured":"Wang, X. (2011). A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality. In The 2011 international joint conference on neural networks, pp. 1293\u20131299 . https:\/\/doi.org\/10.1109\/IJCNN.2011.6033373","DOI":"10.1109\/IJCNN.2011.6033373"},{"key":"2927_CR33","unstructured":"Weber, R., & Blott, S. (1998). A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In 1998 the 24th international conference on very large data bases (VLDB), pp. 194\u2013205."},{"issue":"3","key":"2927_CR34","first-page":"1753","volume":"282","author":"Y Weiss","year":"2009","unstructured":"Weiss, Y., Torralba, A., & Fergus, R. (2009). Spectral hashing. Advances in Neural Information Processing Systems, 282(3), 1753\u20131760.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2927_CR35","doi-asserted-by":"publisher","first-page":"183","DOI":"10.26599\/BDMA.2021.9020001","volume":"3","author":"Z Xue","year":"2021","unstructured":"Xue, Z., & Wang, H. (2021). Effective density-based clustering algorithms for incomplete data. Big Data Mining and Analysis, 3, 183\u2013194.","journal-title":"Big Data Mining and Analysis"},{"key":"2927_CR36","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.neucom.2016.12.040","volume":"230","author":"L Yang","year":"2017","unstructured":"Yang, L., Zhu, Q., Huang, J., & Cheng, D. (2017). Adaptive edited natural neighbor algorithm. Neurocomputing, 230, 427\u2013433.","journal-title":"Neurocomputing"},{"key":"2927_CR37","doi-asserted-by":"publisher","unstructured":"Zhu, P., Zhan, X., & Qiu, W. (2015). Efficient k-nearest neighbors search in high dimensions using mapreduce. In 2015 IEEE fifth international conference on big data and cloud computing, pp. 23\u201330 . https:\/\/doi.org\/10.1109\/BDCloud.2015.51","DOI":"10.1109\/BDCloud.2015.51"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-02927-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-022-02927-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-02927-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T15:53:08Z","timestamp":1720021988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-022-02927-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,12]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2927"],"URL":"https:\/\/doi.org\/10.1007\/s11276-022-02927-9","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,12]]},"assertion":[{"value":"14 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}