{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T07:26:36Z","timestamp":1782545196472,"version":"3.54.5"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NWO EDIC project"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Major complications arise from the recent increase in the amount of high-dimensional data, including high computational costs and memory requirements. Feature selection, which identifies the most relevant and informative attributes of a dataset, has been introduced as a solution to this problem. Most of the existing feature selection methods are computationally inefficient; inefficient algorithms lead to high energy consumption, which is not desirable for devices with limited computational and energy resources. In this paper, a novel and flexible method for unsupervised feature selection is proposed. This method, named QuickSelection (The code is available at: https:\/\/github.com\/zahraatashgahi\/QuickSelection), introduces the strength of the neuron in sparse neural networks as a criterion to measure the feature importance. This criterion, blended with sparsely connected denoising autoencoders trained with the sparse evolutionary training procedure, derives the importance of all input features simultaneously. We implement QuickSelection in a purely sparse manner as opposed to the typical approach of using a binary mask over connections to simulate sparsity. It results in a considerable speed increase and memory reduction. When tested on several benchmark datasets, including five low-dimensional and three high-dimensional datasets, the proposed method is able to achieve the best trade-off of classification and clustering accuracy, running time, and maximum memory usage, among widely used approaches for feature selection. Besides, our proposed method requires the least amount of energy among the state-of-the-art autoencoder-based feature selection methods.<\/jats:p>","DOI":"10.1007\/s10994-021-06063-x","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T21:02:42Z","timestamp":1635368562000},"page":"377-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Quick and robust feature selection: the strength of energy-efficient sparse training for autoencoders"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8183-5541","authenticated-orcid":false,"given":"Zahra","family":"Atashgahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ghada","family":"Sokar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"van der Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elena","family":"Mocanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Decebal Constantin","family":"Mocanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raymond","family":"Veldhuis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"6063_CR1","unstructured":"Aghazadeh, A., Spring, R., Lejeune, D., Dasarathy, G., & Shrivastava, A., et\u00a0al. (2018). Mission: Ultra large-scale feature selection using count-sketches. In International conference on machine learning (pp. 80\u201388)."},{"key":"6063_CR2","unstructured":"AI\u00a0High-Level\u00a0Expert Group (2020). Assessment list for trustworthy artificial intelligence (ALTAI) for self-assessment."},{"issue":"5","key":"6063_CR3","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1109\/TCBB.2015.2478454","volume":"13","author":"JC Ang","year":"2015","unstructured":"Ang, J. C., Mirzal, A., Haron, H., & Hamed, H. N. A. (2015). Supervised, unsupervised, and semi-supervised feature selection: A review on gene selection. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 13(5), 971\u2013989.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"6063_CR4","unstructured":"Anguita, D., Ghio, A., Oneto, L., Parra, X., & Reyes-Ortiz, J.Luis. (2013). A public domain dataset for human activity recognition using smartphones. In Esann."},{"key":"6063_CR5","unstructured":"Baldi, P. (2012). Autoencoders, unsupervised learning, and deep architectures. In Proceedings of ICML workshop on unsupervised and transfer learning, pp. 37\u201349."},{"key":"6063_CR6","unstructured":"Bal\u0131n, M.F., Abid, A., & Zou, J. (2019). Concrete autoencoders: Differentiable feature selection and reconstruction. In International conference on machine learning pp. 444\u2013453."},{"issue":"11","key":"6063_CR7","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747\u20133752.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"6063_CR8","unstructured":"Bellec, G., Kappel, D., Maass, W., & Legenstein, R. (2017). Deep rewiring: Training very sparse deep networks. arXiv preprint arXiv:1711.05136."},{"issue":"8","key":"6063_CR9","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","volume":"35","author":"Y Bengio","year":"2013","unstructured":"Bengio, Y., Courville, A., & Vincent, P. (2013). Representation learning: A review and new perspectives. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(8), 1798\u20131828.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6063_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21858-8","volume-title":"Feature selection for high-dimensional data","author":"V Bol\u00f3n-Canedo","year":"2015","unstructured":"Bol\u00f3n-Canedo, V., S\u00e1nchez-Maro\u00f1o, N., & Alonso-Betanzos, A. (2015). Feature selection for high-dimensional data. Springer."},{"key":"6063_CR11","unstructured":"Bourgin, D.D., Peterson, J.C., Reichman, D., Russell, S.J., & Griffiths, T.L. (2019). Cognitive model priors for predicting human decisions. In K. Chaudhuri and R. Salakhutdinov (Ed.) Proceedings of the 36th international conference on machine learning, volume\u00a097 of proceedings of machine learning research pp. 5133\u20135141, Long Beach, California, USA, 09\u201315. PMLR. URL http:\/\/proceedings.mlr.press\/v97\/peterson19a.html"},{"key":"6063_CR12","doi-asserted-by":"crossref","unstructured":"Cai, D., Zhang, C., & He, X. (2010). Unsupervised feature selection for multi-cluster data. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (pp 333\u2013342). ACM.","DOI":"10.1145\/1835804.1835848"},{"issue":"1","key":"6063_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"Girish Chandrashekar","year":"2014","unstructured":"Chandrashekar, Girish, & Sahin, Ferat. (2014). A survey on feature selection methods. Computers & Electrical Engineering, 40(1), 16\u201328.","journal-title":"Computers & Electrical Engineering"},{"key":"6063_CR14","unstructured":"Chollet, F., et\u00a0al. (2015). Keras. https:\/\/keras.io."},{"key":"6063_CR15","unstructured":"Dettmers, T., & Zettlemoyer, L. (2019) Sparse networks from scratch: Faster training without losing performance. arXiv preprint arXiv:1907.04840"},{"key":"6063_CR16","doi-asserted-by":"crossref","unstructured":"Doquet, G., & Sebag, M. (2019). Agnostic feature selection. In Joint european conference on machine learning and knowledge discovery in databases (pp. 343\u2013358). Springer.","DOI":"10.1007\/978-3-030-46150-8_21"},{"key":"6063_CR17","first-page":"845","volume":"5","author":"JG Dy","year":"2004","unstructured":"Dy, J. G., & Brodley, C. E. (2004). Feature selection for unsupervised learning. Journal of Machine Learning Research, 5, 845\u2013889.","journal-title":"Journal of Machine Learning Research"},{"key":"6063_CR18","unstructured":"Evci, U., Gale, T., Menick, J., Castro, P.S., & Elsen, E. (2019). Rigging the lottery: Making all tickets winners. arXiv preprint arXiv:1911.11134"},{"key":"6063_CR19","unstructured":"Fanty, M., & Cole, R. (1991). Spoken letter recognition. In Advances in neural information processing systems (pp. 220\u2013226)."},{"issue":"2","key":"6063_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10115-012-0538-1","volume":"35","author":"AK Farahat","year":"2013","unstructured":"Farahat, A. K., Ghodsi, A., & Kamel, M. S. (2013). Efficient greedy feature selection for unsupervised learning. Knowledge and Information Systems, 35(2), 285\u2013310.","journal-title":"Knowledge and Information Systems"},{"key":"6063_CR21","unstructured":"Frankle, J., & Carbin, M. (2018). The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635"},{"issue":"1","key":"6063_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"Pierre Geurts","year":"2006","unstructured":"Geurts, Pierre, Ernst, Damien, & Wehenkel, Louis. (2006). Extremely randomized trees. Machine Learning, 63(1), 3\u201342.","journal-title":"Machine Learning"},{"key":"6063_CR23","volume-title":"Feature extraction: Foundations and applications","author":"I Guyon","year":"2008","unstructured":"Guyon, I., Gunn, S., Nikravesh, M., & Zadeh, L. A. (2008). Feature extraction: Foundations and applications (Vol. 207). Springer."},{"key":"6063_CR24","unstructured":"Han, S., Pool, J., Tran, J., Dally, W. (2015). Learning both weights and connections for efficient neural network. In Advances in neural information processing systems (pp. 1135\u20131143)."},{"key":"6063_CR25","doi-asserted-by":"crossref","unstructured":"Han, K., Wang, Y., Zhang, C., Li, C., & Xu, C. (2018). Autoencoder inspired unsupervised feature selection. In 2018 IEEE international conference on acoustics, speech and signal processing (ICASSP) (pp. 2941\u20132945). IEEE.","DOI":"10.1109\/ICASSP.2018.8462261"},{"key":"6063_CR26","unstructured":"Hassibi, B., & Stork, D.G. (1993). Second order derivatives for network pruning: Optimal brain surgeon. In Advances in neural information processing systems (pp. 164\u2013171)."},{"key":"6063_CR27","unstructured":"He, X., Cai, D., & Niyogi, P. (2006). Laplacian score for feature selection. In Advances in neural information processing systems (pp. 507\u2013514)."},{"key":"6063_CR28","unstructured":"Jones, E., Oliphant, T., & Peterson, P. (2001). Scipy: Open source scientific tools for python."},{"key":"6063_CR29","unstructured":"Kavzoglu, T., & Mather, P.M. (1998). Assessing artificial neural network pruning algorithms. In Proceedings of the 24th annual conference and exhibition of the remote sensing society (pp. 9\u201311)."},{"issue":"1\u20132","key":"6063_CR30","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., & John, G. H. (1997). Wrappers for feature subset selection. Artificial Intelligence, 97(1\u20132), 273\u2013324.","journal-title":"Artificial Intelligence"},{"key":"6063_CR31","doi-asserted-by":"crossref","unstructured":"Lal, T.N., Chapelle, O., Weston, J., & Elisseeff, A. (2006). Embedded methods. In Feature extraction (pp. 137\u2013165). Springer.","DOI":"10.1007\/978-3-540-35488-8_6"},{"key":"6063_CR32","first-page":"331","volume-title":"Newsweeder: Learning to filter netnews","author":"K Lang","year":"1995","unstructured":"Lang, K. (1995). Newsweeder: Learning to filter netnews (pp. 331\u2013339). Elsevier."},{"issue":"4","key":"6063_CR33","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1109\/TCBB.2012.33","volume":"9","author":"C Lazar","year":"2012","unstructured":"Lazar, C., Taminau, J., Meganck, S., Steenhoff, D., Coletta, A., Molter, C., et al. (2012). A survey on filter techniques for feature selection in gene expression microarray analysis. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 9(4), 1106\u20131119.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"6063_CR34","unstructured":"LeCun, Y. (1998). The mnist database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"6063_CR35","unstructured":"LeCun, Y., Denker, J.S., & Solla, Sara\u00a0A. (1990). Optimal brain damage. In Advances in neural information processing systems (pp. 598\u2013605)."},{"key":"6063_CR36","unstructured":"Lee, N., Ajanthan, T., & Torr, P.H.S. (2018). Snip: Single-shot network pruning based on connection sensitivity. arXiv preprint arXiv:1810.02340"},{"issue":"3","key":"6063_CR37","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw, A., Wiener, M., et al. (2002). Classification and regression by randomforest. R News, 2(3), 18\u201322.","journal-title":"R News"},{"issue":"6","key":"6063_CR38","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2018","unstructured":"Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018). Feature selection: A data perspective. ACM Computing Surveys (CSUR), 50(6), 94.","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"5","key":"6063_CR39","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1089\/cmb.2015.0189","volume":"23","author":"Y Li","year":"2016","unstructured":"Li, Y., Chen, C. Y., & Wasserman, W. W. (2016). Deep feature selection: Theory and application to identify enhancers and promoters. Journal of Computational Biology, 23(5), 322\u2013336.","journal-title":"Journal of Computational Biology"},{"key":"6063_CR40","doi-asserted-by":"crossref","unstructured":"Liu, S., van der Lee, T., Yaman, A., Atashgahi, Z., Ferraro, D., Sokar, G., Pechenizkiy, M., & Mocanu, D. C. (2020). Topological insights into sparse neural networks. In proceedings of the european conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD) 2020.","DOI":"10.1007\/978-3-030-67664-3_17"},{"key":"6063_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5725-8","volume-title":"Feature extraction, construction and selection: A data mining perspective","author":"H Liu","year":"1998","unstructured":"Liu, H., & Motoda, H. (1998). Feature extraction, construction and selection: A data mining perspective (Vol. 453). Springer Science & Business Media."},{"key":"6063_CR42","unstructured":"Lu, Y., Fan, Y., Lv, J., & Noble, W.S. (2018). Deeppink: Reproducible feature selection in deep neural networks. In Advances in neural information processing systems (pp. 8676\u20138686)."},{"key":"6063_CR43","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.procs.2016.07.111","volume":"91","author":"J Miao","year":"2016","unstructured":"Miao, J., & Niu, L. (2016). A survey on feature selection. Procedia Computer Science, 91, 919\u2013926.","journal-title":"Procedia Computer Science"},{"issue":"2\u20133","key":"6063_CR44","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-016-5570-z","volume":"104","author":"DC Mocanu","year":"2016","unstructured":"Mocanu, D. C., Mocanu, E., Nguyen, P. H., Gibescu, M., & Liotta, A. (2016). A topological insight into restricted boltzmann machines. Machine Learning, 104(2\u20133), 243\u2013270.","journal-title":"Machine Learning"},{"issue":"1","key":"6063_CR45","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1038\/s41467-018-04316-3","volume":"9","author":"DC Mocanu","year":"2018","unstructured":"Mocanu, D. C., Mocanu, E., Stone, P., Nguyen, P. H., Gibescu, M., & Liotta, A. (2018). Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nature Communications, 9(1), 2383.","journal-title":"Nature Communications"},{"key":"6063_CR46","unstructured":"Mostafa, H., & Wang, X. (2019). Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization. In K. Chaudhuri and R. Salakhutdinov (Ed.), Proceedings of the 36th international conference on machine learning, volume\u00a097 of proceedings of machine learning research (pap. 4646\u20134655). Long Beach, California, USA, 09\u201315. PMLR. URL http:\/\/proceedings.mlr.press\/v97\/mostafa19a.html"},{"key":"6063_CR47","unstructured":"Nene, S.A., Nayar, S.K., & Murase, H., et\u00a0al. (1996). Columbia object image library (coil-20)."},{"key":"6063_CR48","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.patcog.2016.11.003","volume":"64","author":"R Sheikhpour","year":"2017","unstructured":"Sheikhpour, R., Sarram, M. A., Gharaghani, S., & Chahooki, M. A. (2017). A survey on semi-supervised feature selection methods. Pattern Recognition, 64, 141\u2013158.","journal-title":"Pattern Recognition"},{"key":"6063_CR49","unstructured":"Singh, D., & Yamada, M. (2020). Fsnet: Feature selection network on high-dimensional biological data. arXiv preprint arXiv:2001.08322"},{"issue":"3","key":"6063_CR50","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1038\/nm1556","volume":"13","author":"A Spira","year":"2007","unstructured":"Spira, A., Beane, J. E., Shah, V., Steiling, K., Liu, G., Schembri, F., et al. (2007). Airway epithelial gene expression in the diagnostic evaluation of smokers with suspect lung cancer. Nature Medicine, 13(3), 361\u2013366.","journal-title":"Nature Medicine"},{"issue":"4","key":"6063_CR51","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ccr.2006.03.003","volume":"9","author":"L Sun","year":"2006","unstructured":"Sun, L., Hui, A. M., Qin, S., Vortmeyer, A., Kotliarov, Y., Pastorino, Sandra, et al. (2006). Neuronal and glioma-derived stem cell factor induces angiogenesis within the brain. Cancer Cell, 9(4), 287\u2013300.","journal-title":"Cancer Cell"},{"key":"6063_CR52","unstructured":"Tan, M., Tsang, I.W., & Wang, L. (2014). Towards ultrahigh dimensional feature selection for big data. Journal of Machine Learning Research."},{"issue":"66\u201371","key":"6063_CR53","first-page":"13","volume":"10","author":"L Van Der Maaten","year":"2009","unstructured":"Van Der Maaten, L., Postma, E., & Van den Herik, J. (2009). Dimensionality reduction: A comparative. J Mach Learn Res, 10(66\u201371), 13.","journal-title":"J Mach Learn Res"},{"key":"6063_CR54","doi-asserted-by":"crossref","unstructured":"Vincent, P., Larochelle, H., Bengio, Y., & Manzagol, P.A. (2008). Extracting and composing robust features with denoising autoencoders. In Proceedings of the 25th international conference on Machine learning (pp. 1096\u20131103). ACM.","DOI":"10.1145\/1390156.1390294"},{"issue":"1\u20133","key":"6063_CR55","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold, S., Esbensen, K., & Geladi, P. (1987). Principal component analysis. Chemometrics and Intelligent Laboratory Systems, 2(1\u20133), 37\u201352.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"6063_CR56","unstructured":"Yang, Y., Shen, H.T., Ma, Z., Huang, Z., & Zhou, X. (2011). L2, 1-norm regularized discriminative feature selection for unsupervised. In Twenty-second international joint conference on artificial intelligence."},{"key":"6063_CR57","doi-asserted-by":"publisher","first-page":"4195","DOI":"10.1109\/ACCESS.2018.2888976","volume":"7","author":"J Yang","year":"2018","unstructured":"Yang, J., Xiao, W., Jiang, C., Hossain, M. S., Muhammad, G., & Amin, S. U. (2018). Ai-powered green cloud and data center. IEEE Access, 7, 4195\u20134203.","journal-title":"IEEE Access"},{"key":"6063_CR58","doi-asserted-by":"crossref","unstructured":"Zhao, Z., & Liu, H. (2007). Semi-supervised feature selection via spectral analysis. In Proceedings of the 2007 SIAM international conference on data mining (pp. 641\u2013646). SIAM.","DOI":"10.1137\/1.9781611972771.75"},{"key":"6063_CR59","doi-asserted-by":"crossref","unstructured":"Zhu, Hangyu, & Jin, Yaochu. (2019). Multi-objective evolutionary federated learning. IEEE transactions on neural networks and learning systems.","DOI":"10.1109\/TNNLS.2019.2919699"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06063-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06063-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06063-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T18:24:31Z","timestamp":1643912671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06063-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["6063"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06063-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,27]]},"assertion":[{"value":"22 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}