{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:16:10Z","timestamp":1743221770543,"version":"3.40.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-025-00479-x","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T15:14:25Z","timestamp":1738682065000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving LSH via tensorized random projection"],"prefix":"10.1007","volume":"62","author":[{"given":"Bhisham Dev","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rameshwar","family":"Pratap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"key":"479_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-299-3","volume-title":"Tensors in Image Processing and Computer Vision","author":"S Aja-Fern\u00e1ndez","year":"2009","unstructured":"Aja-Fern\u00e1ndez, S., Luis Garcia, R., Tao, D., Li, X.: Tensors in Image Processing and Computer Vision. Springer, Berlin (2009)"},{"key":"479_CR2","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal LSH for angular distance. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"479_CR3","doi-asserted-by":"publisher","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 459\u2013468. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.49","DOI":"10.1109\/FOCS.2006.49"},{"key":"479_CR4","doi-asserted-by":"publisher","first-page":"101372","DOI":"10.1016\/j.jocs.2021.101372","volume":"53","author":"G Brandi","year":"2021","unstructured":"Brandi, G., Di Matteo, T.: Predicting multidimensional data via tensor learning. J. Comput. Sci. 53, 101372 (2021)","journal-title":"J. Comput. Sci."},{"key":"479_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"key":"479_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388 (2002)","DOI":"10.1145\/509907.509965"},{"key":"479_CR7","doi-asserted-by":"crossref","unstructured":"Cochez, M., Mou, H.: Twister tries: approximate hierarchical agglomerative clustering for average distance in linear time. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 505\u2013517 (2015)","DOI":"10.1145\/2723372.2751521"},{"key":"479_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jneumeth.2015.03.018","volume":"248","author":"F Cong","year":"2015","unstructured":"Cong, F., Lin, Q.-H., Kuang, L.-D., Gong, X.-F., Astikainen, P., Ristaniemi, T.: Tensor decomposition of EEG signals: a brief review. J. Neurosci. Methods 248, 59\u201369 (2015)","journal-title":"J. Neurosci. Methods"},{"key":"479_CR9","doi-asserted-by":"crossref","unstructured":"Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: Proceedings of the 16th International Conference on World Wide Web, pp. 271\u2013280 (2007)","DOI":"10.1145\/1242572.1242610"},{"key":"479_CR10","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarl\u00f3s, T.: Fast locality-sensitive hashing. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1073\u20131081 (2011)","DOI":"10.1145\/2020408.2020578"},{"key":"479_CR11","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"479_CR12","unstructured":"Dubey, P.P., Verma, B.D., Pratap, R., Kang, K.: Improving sign-random-projection via count sketch. In: The 38th Conference on Uncertainty in Artificial Intelligence (2022)"},{"key":"479_CR13","unstructured":"Gionis, A., Indyk, P., Motwani, R., : Similarity search in high dimensions via hashing. In: Vldb, vol. 99, pp. 518\u2013529 (1999)"},{"issue":"6","key":"479_CR14","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"4","key":"479_CR15","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is np-complete. J. Algorithms 11(4), 644\u2013654 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"479_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are np-hard. J. ACM 60(6), 1\u201339 (2013)","journal-title":"J. ACM"},{"issue":"1\u20134","key":"479_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6(1\u20134), 164\u2013189 (1927)","journal-title":"J. Math. Phys."},{"key":"479_CR18","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"479_CR19","doi-asserted-by":"crossref","unstructured":"Janson, S.: Normal convergence by higher semiinvariants with applications to sums of dependent random variables and random graphs. Ann. Probab. 305\u2013312 (1988)","DOI":"10.1214\/aop\/1176991903"},{"key":"479_CR20","unstructured":"Ji, J., Li, J., Yan, S., Zhang, B., Tian, Q.: Super-bit locality-sensitive hashing. Adv. Neural Inf. Process. Syst. 25 (2012)"},{"key":"479_CR21","unstructured":"Kang, K., Wong, W.: Improving sign random projections with additional information. In: International Conference on Machine Learning, pp. 2479\u20132487. PMLR (2018)"},{"issue":"1","key":"479_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga, H., Ishibashi, T., Watanabe, T.: Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing. Knowl. Inf. Syst. 12(1), 25\u201353 (2007)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"479_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"3","key":"479_CR24","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev."},{"key":"479_CR25","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 2130\u20132137. IEEE (2009)","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"479_CR26","doi-asserted-by":"crossref","unstructured":"Li, P., Hastie, T.J., Church, K.W.: Very sparse random projections. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 287\u2013296 (2006)","DOI":"10.1145\/1150402.1150436"},{"key":"479_CR27","unstructured":"Li, P., Owen, A., Zhang, C.-H.: One permutation hashing. Adv. Neural Inf. Process. Syst. 25 (2012)"},{"issue":"1","key":"479_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1503\/jpn.110180","volume":"38","author":"Y Liao","year":"2013","unstructured":"Liao, Y., Huang, X., Wu, Q., Yang, C., Kuang, W., Du, M., Lui, S., Yue, Q., Chan, R.C., Kemp, G.J.: Is depression a disconnection syndrome? Meta-analysis of diffusion tensor imaging studies in patients with MDD. J. Psychiatry Neurosci. 38(1), 49\u201356 (2013)","journal-title":"J. Psychiatry Neurosci."},{"issue":"8","key":"479_CR29","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1978542.1978566","volume":"54","author":"P Li","year":"2011","unstructured":"Li, P., K\u00f6nig, A.C.: Theory and applications of b-bit minwise hashing. Commun. ACM 54(8), 101\u2013109 (2011). https:\/\/doi.org\/10.1145\/1978542.1978566","journal-title":"Commun. ACM"},{"issue":"5","key":"479_CR30","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.neuron.2006.08.012","volume":"51","author":"S Mori","year":"2006","unstructured":"Mori, S., Zhang, J.: Principles of diffusion tensor imaging and its applications to basic neuroscience research. Neuron 51(5), 527\u2013539 (2006)","journal-title":"Neuron"},{"issue":"5","key":"479_CR31","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"479_CR32","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/JPROC.2021.3074329","volume":"109","author":"Y Panagakis","year":"2021","unstructured":"Panagakis, Y., Kossaifi, J., Chrysos, G.G., Oldfield, J., Nicolaou, M.A., Anandkumar, A., Zafeiriou, S.: Tensor methods in computer vision and deep learning. Proc. IEEE 109(5), 863\u2013890 (2021)","journal-title":"Proc. IEEE"},{"key":"479_CR33","unstructured":"Rabanser, S., Shchur, O., G\u00fcnnemann, S.: Introduction to tensor decompositions and their applications in machine learning. arXiv preprint arXiv:1711.10781 (2017)"},{"key":"479_CR34","unstructured":"Rakhshan, B.T., Rabusseau, G.: Rademacher random projections with tensor networks. arXiv preprint arXiv:2110.13970 (2021)"},{"key":"479_CR35","unstructured":"Rakhshan, B., Rabusseau, G.: Tensorized random projections. In: International Conference on Artificial Intelligence and Statistics, pp. 3306\u20133316. PMLR (2020)"},{"key":"479_CR36","doi-asserted-by":"crossref","unstructured":"Ryynanen, M., Klapuri, A.: Query by humming of midi and audio using locality sensitive hashing. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2249\u20132252. IEEE (2008)","DOI":"10.1109\/ICASSP.2008.4518093"},{"key":"479_CR37","unstructured":"Shrivastava, A., Li, P.: In defense of minhash over simhash. In: Artificial Intelligence and Statistics, pp. 886\u2013894. PMLR (2014)"},{"key":"479_CR38","unstructured":"Shrivastava, A.: Optimal densification for fast and accurate minwise hashing. In: International Conference on Machine Learning, pp. 3154\u20133163. PMLR (2017)"},{"issue":"13","key":"479_CR39","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","unstructured":"Sidiropoulos, N.D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E.E., Faloutsos, C.: Tensor decomposition for signal processing and machine learning. IEEE Trans. Signal Process. 65(13), 3551\u20133582 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"479_CR40","unstructured":"Tao, D., Li, X., Hu, W., Maybank, S., Wu, X.: Supervised tensor learning. In: Fifth IEEE International Conference on Data Mining (ICDM\u201905), p. 8. IEEE (2005)"},{"key":"479_CR41","unstructured":"Wang, H., Ahuja, N.: Compact representation of multidimensional data using tensor rank-one decomposition. Vectors 1(5) (2004)"},{"issue":"11","key":"479_CR42","doi-asserted-by":"publisher","first-page":"2594","DOI":"10.1109\/TIFS.2016.2590944","volume":"11","author":"Z Xia","year":"2016","unstructured":"Xia, Z., Wang, X., Zhang, L., Qin, Z., Sun, X., Ren, K.: A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing. IEEE Trans. Inf. Forensics Secur. 11(11), 2594\u20132608 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"479_CR43","doi-asserted-by":"crossref","unstructured":"Yu, Y., Crucianu, M., Oria, V., Damiani, E.: Combining multi-probe histogram and order-statistics based LSH for scalable audio content retrieval. In: Proceedings of the 18th ACM International Conference on Multimedia, pp. 381\u2013390 (2010)","DOI":"10.1145\/1873951.1874004"},{"key":"479_CR44","unstructured":"Yu, F., Kumar, S., Gong, Y., Chang, S.-F.: Circulant binary embedding. In: International Conference on Machine Learning, pp. 946\u2013954. PMLR (2014)"},{"issue":"8","key":"479_CR45","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/JPROC.2018.2848209","volume":"106","author":"A Zare","year":"2018","unstructured":"Zare, A., Ozdemir, A., Iwen, M.A., Aviyente, S.: Extension of PCA to higher order data structures: an introduction to tensors, tensor decompositions, and tensor PCA. Proc. IEEE 106(8), 1341\u20131358 (2018)","journal-title":"Proc. IEEE"},{"key":"479_CR46","unstructured":"Zhuvikin, A.: A blockchain of image copyrights using robust image features and locality-sensitive hashing. Int. J. Comput. Sci. Appl. 15(1) (2018)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00479-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00479-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:25:25Z","timestamp":1743200725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00479-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00479-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2025,2,4]]},"assertion":[{"value":"28 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors participated in this study give the publisher the permission to publish this work.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"13"}}