{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:20:17Z","timestamp":1771046417855,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T00:00:00Z","timestamp":1627603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T00:00:00Z","timestamp":1627603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Random Projection is one of the most popular and successful dimensionality reduction algorithms for large volumes of data. However, given its stochastic nature, different initializations of the projection matrix can lead to very different levels of performance. This paper presents a guided random search algorithm to mitigate this problem. The proposed method uses a small number of training data samples to iteratively adjust a projection matrix, improving its performance on similarly distributed data. Experimental results show that projection matrices generated with the proposed method result in a better preservation of distances between data samples. Conveniently, this is achieved while preserving the database-friendliness of the projection matrix, as it remains sparse and comprised exclusively of integers after being tuned with our algorithm. Moreover, running the proposed algorithm on a consumer-grade CPU requires only a few seconds.<\/jats:p>","DOI":"10.1007\/s10489-021-02626-6","type":"journal-article","created":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T01:51:09Z","timestamp":1627696269000},"page":"4927-4939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tuning Database-Friendly Random Projection Matrices for Improved Distance Preservation on Specific Data"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2224-4957","authenticated-orcid":false,"given":"Daniel","family":"L\u00f3pez-S\u00e1nchez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"de Bodt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John A.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ang\u00e9lica Gonz\u00e1lez","family":"Arrieta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan M.","family":"Corchado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,30]]},"reference":[{"key":"2626_CR1","doi-asserted-by":"crossref","unstructured":"Vempala SS (2005) The random projection method, vol 65. American Mathematical Society","DOI":"10.1090\/dimacs\/065"},{"issue":"4","key":"2626_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas D (2003) Database-friendly random projections: Johnson-lindenstrauss with binary coins. J Comput Syst Sci 66(4):671\u2013687","journal-title":"J Comput Syst Sci"},{"key":"2626_CR3","doi-asserted-by":"crossref","unstructured":"Li P, Hastie TJ, Church KW (2006) Very sparse random projections. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 287\u2013296","DOI":"10.1145\/1150402.1150436"},{"key":"2626_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.3389\/fgene.2016.00102","volume":"7","author":"C Grellmann","year":"2016","unstructured":"Grellmann C, Neumann J, Bitzer S, Kovacs P, T\u00f6njes A, Westlye LT, Andreassen OA, Stumvoll M, Villringer A, Horstmann A (2016) Random projection for fast and efficient multivariate correlation analysis of high-dimensional data: A new approach. Front Genet 7:102","journal-title":"Front Genet"},{"key":"2626_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.patcog.2015.09.017","volume":"51","author":"K Zhao","year":"2016","unstructured":"Zhao K, Alavi A, Wiliem A, Lovell BC (2016) Efficient clustering on riemannian manifolds: A kernelised random projection approach. Pattern Recogn 51:333\u2013345","journal-title":"Pattern Recogn"},{"key":"2626_CR6","doi-asserted-by":"crossref","unstructured":"Ye M, Liu W, Wei J, Hu X (2016) Fuzzy-means and cluster ensemble with random projection for big data clustering. Math Probl Eng 2016","DOI":"10.1155\/2016\/6529794"},{"issue":"4","key":"2626_CR7","first-page":"911","volume":"23","author":"A Alzu\u2019bi","year":"2020","unstructured":"Alzu\u2019bi A, Abuarqoub A (2020) Deep learning model with low-dimensional random projection for large-scale image search. Eng Sci Technol Int J 23(4):911\u2013920","journal-title":"Eng Sci Technol Int J"},{"issue":"3","key":"2626_CR8","first-page":"534","volume":"6","author":"Y Qiao","year":"2015","unstructured":"Qiao Y, Zhao Y (2015) Rotation invariant texture classification using principal direction estimation and random projection. J Inf Hiding Multimed Sig Process 6(3):534\u2013543","journal-title":"J Inf Hiding Multimed Sig Process"},{"key":"2626_CR9","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-S\u00e1nchez D (2017) Improving random projection with genetic algorithms: student research abstract. In: Proceedings of the Symposium on Applied Computing. ACM, pp 828\u2013829","DOI":"10.1145\/3019612.3019942"},{"issue":"189-206","key":"2626_CR10","first-page":"1","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson WB, Lindenstrauss J (1984) Extensions of lipschitz mappings into a hilbert space. Contemp Math 26(189-206):1","journal-title":"Contemp Math"},{"issue":"1","key":"2626_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta S, Gupta A (2003) An elementary proof of a theorem of johnson and lindenstrauss. Random Struct Algorithm 22(1):60\u201365","journal-title":"Random Struct Algorithm"},{"issue":"3","key":"2626_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0095-8956(88)90043-3","volume":"44","author":"P Frankl","year":"1988","unstructured":"Frankl P, Maehara H (1988) The johnson-lindenstrauss lemma and the sphericity of some graphs. J Comb Theory Ser B 44(3):355\u2013362","journal-title":"J Comb Theory Ser B"},{"key":"2626_CR13","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, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"2626_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matou\u0161ek","year":"2008","unstructured":"Matou\u0161ek J (2008) On variants of the johnson\u2013lindenstrauss lemma. Random Struct Algorithm 33(2):142\u2013156","journal-title":"Random Struct Algorithm"},{"key":"2626_CR15","doi-asserted-by":"crossref","unstructured":"Achlioptas D (2001) Database-friendly random projections. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM, pp 274\u2013281","DOI":"10.1145\/375551.375608"},{"key":"2626_CR16","unstructured":"Li P, Mitzenmacher M, Slawski M (2016) Quantized random projections and non-linear estimation of cosine similarity. In: Advances in Neural Information Processing Systems, pp 2756\u20132764"},{"issue":"7","key":"2626_CR17","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/TIFS.2015.2415461","volume":"10","author":"D Valsesia","year":"2015","unstructured":"Valsesia D, Coluccia G, Bianchi T, Magli E (2015) Compressed fingerprint matching and camera identification via random projections. IEEE Trans Inf Forensic Secur 10(7):1472\u20131485","journal-title":"IEEE Trans Inf Forensic Secur"},{"issue":"9","key":"2626_CR18","first-page":"5477","volume":"63","author":"L Jacques","year":"2017","unstructured":"Jacques L (2017) Small width, low distortions: quantized random embeddings of low-complexity sets. IEEE Trans Inf Theory 63(9):5477\u20135495","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"2626_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s10559-012-9384-0","volume":"48","author":"DA Rachkovskij","year":"2012","unstructured":"Rachkovskij DA, Misuno IS, Slipchenko SV (2012) Randomized projective methods for the construction of binary sparse vector representations. Cybern Syst Anal 48(1):146\u2013156","journal-title":"Cybern Syst Anal"},{"issue":"1","key":"2626_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TSIPN.2015.2442156","volume":"1","author":"T Wimalajeewa","year":"2015","unstructured":"Wimalajeewa T, Varshney PK (2015) Wireless compressive sensing over fading channels with distributed sparse random projections. IEEE Trans Signal Inf Process Over Netw 1 (1): 33\u201344","journal-title":"IEEE Trans Signal Inf Process Over Netw"},{"issue":"2","key":"2626_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10559-015-9723-z","volume":"51","author":"DA Rachkovskij","year":"2015","unstructured":"Rachkovskij DA (2015) Formation of similarity-reflecting binary vectors with random binary projections. Cybern Syst Anal 51(2):313\u2013323","journal-title":"Cybern Syst Anal"},{"issue":"4","key":"2626_CR22","doi-asserted-by":"publisher","first-page":"220","DOI":"10.18178\/ijmlc.2016.6.4.601","volume":"6","author":"L Cheng","year":"2016","unstructured":"Cheng L, You C, Guan Y (2016) Random projections for non-linear dimensionality reduction. Int J Mach Learn Comput 6(4):220\u2013225","journal-title":"Int J Mach Learn Comput"},{"key":"2626_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.patcog.2018.05.003","volume":"82","author":"D L\u00f3pez-S\u00e1nchez","year":"2018","unstructured":"L\u00f3pez-S\u00e1nchez D, Arrieta AG, Corchado JM (2018) Data-independent random projections from the feature-space of the homogeneous polynomial kernel. Pattern Recogn 82:130\u2013146","journal-title":"Pattern Recogn"},{"issue":"1","key":"2626_CR24","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon N, Chazelle B (2009) The fast johnson\u2013lindenstrauss transform and approximate nearest neighbors. SIAM J Comput 39(1):302\u2013322","journal-title":"SIAM J Comput"},{"issue":"3","key":"2626_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2483699.2483701","volume":"9","author":"N Ailon","year":"2013","unstructured":"Ailon N, Liberty E (2013) An almost optimal unrestricted fast johnson-lindenstrauss transform. ACM Trans Algorithm (TALG) 9(3):1\u201312","journal-title":"ACM Trans Algorithm (TALG)"},{"issue":"1","key":"2626_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43670-021-00002-6","volume":"19","author":"S Bamberger","year":"2021","unstructured":"Bamberger S, Krahmer F (2021) Optimal fast johnson\u2013lindenstrauss embeddings for large data sets. Sampling Theory Signal Process Data Anal 19(1):1\u201323","journal-title":"Sampling Theory Signal Process Data Anal"},{"key":"2626_CR27","doi-asserted-by":"publisher","first-page":"20067","DOI":"10.1109\/ACCESS.2019.2962368","volume":"8","author":"M Binjubeir","year":"2019","unstructured":"Binjubeir M, Ahmed AA, Ismail MAB, Sadiq AS, Khan MK (2019) Comprehensive survey on big data privacy protection. IEEE Access 8:20067\u201320079","journal-title":"IEEE Access"},{"issue":"2","key":"2626_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s40745-018-0172-1","volume":"6","author":"RF Soliman","year":"2019","unstructured":"Soliman RF, Amin M, Abd El-Samie FE (2019) A modified cancelable biometrics scheme using random projection. Ann Data Sci 6(2):223\u2013236","journal-title":"Ann Data Sci"},{"key":"2626_CR29","doi-asserted-by":"crossref","unstructured":"Tasoulis S, Cheng L, V\u00e4lim\u00e4ki N, Croucher NJ, Harris SR, Hanage WP, Roos T, Corander J (2014) Random projection based clustering for population genomics. In: 2014 IEEE international conference on big data (big data). IEEE, pp 675\u2013682","DOI":"10.1109\/BigData.2014.7004291"},{"issue":"2","key":"2626_CR30","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1101\/gr.254557.119","volume":"30","author":"S Wan","year":"2020","unstructured":"Wan S, Kim J, Won KJ (2020) Sharp: hyperfast and accurate processing of single-cell rna-seq data via ensemble random projection. Genome Res 30(2):205\u2013213","journal-title":"Genome Res"},{"key":"2626_CR31","doi-asserted-by":"crossref","unstructured":"Carraher LA, Wilsey PA, Moitra A, Dey S (2016) Random projection clustering on streaming data. In: 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW). IEEE, pp 708\u2013715","DOI":"10.1109\/ICDMW.2016.0105"},{"key":"2626_CR32","volume-title":"Simulated annealing: From basics to applications","author":"D Delahaye","year":"2019","unstructured":"Delahaye D, Chaimatanan S, Mongeau M (2019) Simulated annealing: From basics to applications. Springer"},{"issue":"6","key":"2626_CR33","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE Signal Proc Mag 29(6):141\u2013142","journal-title":"IEEE Signal Proc Mag"},{"key":"2626_CR34","unstructured":"Fanty M, Cole R (1991) Spoken letter recognition. In: Advances in Neural Information Processing Systems, pp 220\u2013226"},{"key":"2626_CR35","unstructured":"Krizhevsky A, Hinton G (2009) Learning multiple layers of features from tiny images. Technical Report. Citeseer"},{"issue":"1","key":"2626_CR36","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2626_CR37","doi-asserted-by":"crossref","unstructured":"Winder SAJ, Brown M (2007) Learning local image descriptors. In: Computer Vision and Pattern Recognition, 2007. CVPR\u201907. IEEE Conference on. IEEE, pp 1\u20138","DOI":"10.1109\/CVPR.2007.382971"},{"key":"2626_CR38","doi-asserted-by":"crossref","unstructured":"Defferrard M, Mohanty SP, Carroll SF, Salath\u00e9 M (2018) Learning to recognize musical genre from audio: Challenge overview. In: The 2018 Web Conference Companion. ACM Press","DOI":"10.1145\/3184558.3192310"},{"key":"2626_CR39","doi-asserted-by":"crossref","unstructured":"McFee B, Raffel C, Liang D, Ellis Daniel PW, McVicar M, Battenberg E, Nieto O (2015) librosa: Audio and music signal analysis in python. In: Proceedings of the 14th python in science conference, pp 18\u201325","DOI":"10.25080\/Majora-7b98e3ed-003"},{"key":"2626_CR40","doi-asserted-by":"crossref","unstructured":"Hyv\u00f6nen V, Pitk\u00e4nen T, Tasoulis S, J\u00e4\u00e4saari E, Tuomainen R, Wang L, Corander J, Roos T (2016) Fast nearest neighbor search through sparse random projections and voting. In: Big Data (Big Data), 2016 IEEE International Conference on. IEEE, pp 881\u2013888","DOI":"10.1109\/BigData.2016.7840682"},{"issue":"2","key":"2626_CR41","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1093\/biomet\/58.2.341","volume":"58","author":"RB d\u2019Agostino","year":"1971","unstructured":"d\u2019Agostino RB (1971) An omnibus test of normality for moderate and large size samples. Biometrika 58(2):341\u2013348","journal-title":"Biometrika"},{"issue":"1","key":"2626_CR42","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1146\/annurev.ps.46.020195.003021","volume":"46","author":"JP Shaffer","year":"1995","unstructured":"Shaffer JP (1995) Multiple hypothesis testing. Ann Rev Psychol 46(1):561\u2013584","journal-title":"Ann Rev Psychol"},{"issue":"7","key":"2626_CR43","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1016\/j.neucom.2008.12.017","volume":"72","author":"JA Lee","year":"2009","unstructured":"Lee JA, Verleysen M (2009) Quality assessment of dimensionality reduction: Rank-based criteria. Neurocomputing 72(7):1431\u20131443","journal-title":"Neurocomputing"},{"issue":"4","key":"2626_CR44","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/TNNLS.2018.2861891","volume":"30","author":"C de Bodt","year":"2019","unstructured":"de Bodt C, Mulders D, Verleysen M, Lee JA (2019) Nonlinear dimensionality reduction with missing data using parametric multiple imputations. IEEE Trans Neural Netw Learn Syst 30(4):1166\u20131179","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2626_CR45","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.neucom.2012.11.046","volume":"112","author":"B Mokbel","year":"2013","unstructured":"Mokbel B, Lueks W, Gisbrecht A, Hammer B (2013) Visualizing the quality of dimensionality reduction. Neurocomputing 112:109\u2013123","journal-title":"Neurocomputing"},{"key":"2626_CR46","doi-asserted-by":"crossref","unstructured":"de Bodt C, Mulders D, Verleysen M, Lee JA (2020) Fast multiscale neighbor embedding. IEEE Trans Neural Netw Learn Syst:1\u201315","DOI":"10.1109\/TNNLS.2020.3042807"},{"key":"2626_CR47","first-page":"451","volume":"11","author":"J Venna","year":"2010","unstructured":"Venna J, Peltonen J, Nybo K, Aidos H, Kaski S (2010) Information retrieval perspective to nonlinear dimensionality reduction for data visualization. J Mach Learn Res 11:451\u2013490","journal-title":"J Mach Learn Res"},{"key":"2626_CR48","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.neucom.2012.12.036","volume":"112","author":"JA Lee","year":"2013","unstructured":"Lee JA, Renard E, Bernard G, Dupont P, Verleysen M (2013) Type 1 and 2 mixtures of kullback\u2013leibler divergences as cost functions in dimensionality reduction based on similarity preservation. Neurocomputing 112:92\u2013108","journal-title":"Neurocomputing"},{"key":"2626_CR49","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.neucom.2014.12.095","volume":"169","author":"JA Lee","year":"2015","unstructured":"Lee JA, Peluffo-Ord\u00f3\u00f1ez DH, Verleysen M (2015) Multi-scale similarities in stochastic neighbour embedding: Reducing dimensionality while preserving both local and global structure. Neurocomputing 169:246\u2013261","journal-title":"Neurocomputing"},{"key":"2626_CR50","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.patcog.2019.05.006","volume":"93","author":"B Tran","year":"2019","unstructured":"Tran B, Xue B, Zhang M (2019) Genetic programming for multiple-feature construction on high-dimensional classification. Pattern Recogn 93:404\u2013417","journal-title":"Pattern Recogn"},{"key":"2626_CR51","doi-asserted-by":"crossref","unstructured":"Bhatt G, Jha P, Raman B (2019) Representation learning using step-based deep multi-modal autoencoders. Pattern Recogn","DOI":"10.1016\/j.patcog.2019.05.032"},{"key":"2626_CR52","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.patcog.2019.05.011","volume":"93","author":"B Chen","year":"2019","unstructured":"Chen B, Deng W (2019) Deep embedding learning with adaptive large margin n-pair loss for image retrieval and clustering. Pattern Recogn 93:353\u2013364","journal-title":"Pattern Recogn"},{"key":"2626_CR53","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.patcog.2019.04.005","volume":"93","author":"X Zhe","year":"2019","unstructured":"Zhe X, Chen S, Yan H (2019) Directional statistics-based deep metric learning for image classification and retrieval. Pattern Recogn 93:113\u2013123","journal-title":"Pattern Recogn"},{"key":"2626_CR54","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-S\u00e1nchez D, Arrieta AG, Corchado JM (2019) Compact bilinear pooling via kernelized random projection for fine-grained image categorization on low computational power devices. Neurocomputing","DOI":"10.1016\/j.neucom.2019.05.104"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02626-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T05:11:54Z","timestamp":1646457114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02626-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,30]]},"references-count":54,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["2626"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02626-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,30]]},"assertion":[{"value":"17 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}