{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:28:33Z","timestamp":1763202513138,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T00:00:00Z","timestamp":1630627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006360","name":"Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["01MK20008F"],"award-info":[{"award-number":["01MK20008F"]}],"id":[{"id":"10.13039\/501100006360","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Dealing with relational learning generally relies on tools modeling relational data. An undirected graph can represent these data with vertices depicting entities and edges describing the relationships between the entities. These relationships can be well represented by multiple undirected graphs over the same set of vertices with edges arising from different graphs catching heterogeneous relations. The vertices of those networks are often structured in unknown clusters with varying properties of connectivity. These multiple graphs can be structured as a three-way tensor, where each slice of tensor depicts a graph which is represented by a count data matrix. To extract relevant clusters, we propose an appropriate model-based co-clustering capable of dealing with multiple graphs. The proposed model can be seen as a suitable tensor extension of mixture models of graphs, while the obtained co-clustering can be treated as a consensus clustering of nodes from multiple graphs. Applications on real datasets and comparisons with multi-view clustering and tensor decomposition methods show the interest of our contribution.<\/jats:p>","DOI":"10.1007\/s10618-021-00788-y","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T19:38:54Z","timestamp":1630697934000},"page":"2313-2340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Implicit consensus clustering from multiple graphs"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5884-2898","authenticated-orcid":false,"given":"Rafika","family":"Boutalbi","sequence":"first","affiliation":[]},{"given":"Lazhar","family":"Labiod","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Nadif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"788_CR1","doi-asserted-by":"crossref","unstructured":"Affeldt S, Labiod L, Nadif M (2020a) Ensemble block co-clustering: a unified framework for text data. In: Proceedings of the 29th ACM international conference on information and knowledge management, pp 5\u201314","DOI":"10.1145\/3340531.3412058"},{"key":"788_CR2","doi-asserted-by":"publisher","first-page":"107522","DOI":"10.1016\/j.patcog.2020.107522","volume":"108","author":"S Affeldt","year":"2020","unstructured":"Affeldt S, Labiod L, Nadif M (2020b) Spectral clustering via ensemble deep autoencoder learning (SC-EDAE). Pattern Recognit 108:107522","journal-title":"Pattern Recognit"},{"issue":"3","key":"788_CR3","first-page":"32","volume":"31","author":"S Affeldt","year":"2021","unstructured":"Affeldt S, Labiod L, Nadif M (2021) Regularized bi-directional co-clustering. Stat Comput 31(3):32","journal-title":"Regularized bi-directional co-clustering. Stat Comput"},{"key":"788_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.patcog.2017.06.005","volume":"72","author":"M Ailem","year":"2017","unstructured":"Ailem M, Role F, Nadif M (2017a) Model-based co-clustering for the effective handling of sparse data. Pattern Recognit 72:108\u2013122","journal-title":"Pattern Recognit"},{"issue":"7","key":"788_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1109\/TKDE.2017.2681669","volume":"29","author":"M Ailem","year":"2017","unstructured":"Ailem M, Role F, Nadif M (2017b) Sparse Poisson latent block model for document clustering. IEEE Trans Knowl Data Eng 29(7):1563\u20131576","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"788_CR6","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s13042-017-0756-7","volume":"10","author":"T Alqurashi","year":"2019","unstructured":"Alqurashi T, Wang W (2019) Clustering ensemble method. Int J Mach Learn Cybern 10(6):1227\u20131246","journal-title":"Int J Mach Learn Cybern"},{"key":"788_CR7","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, USA, SODA \u201907, pp 1027\u20131035"},{"key":"788_CR8","doi-asserted-by":"crossref","unstructured":"Banerjee A, Basu S, Merugu S (2007) Multi-way clustering on relation graphs. In: SIAM international conference on data mining, pp 145\u2013156","DOI":"10.1137\/1.9781611972771.14"},{"issue":"1\u20132","key":"788_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E Bauer","year":"1999","unstructured":"Bauer E, Kohavi R (1999) An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach Learn 36(1\u20132):105\u2013139","journal-title":"Mach Learn"},{"key":"788_CR10","unstructured":"Benzecri JP (1973) L\u2019analyse des donn\u00e9es, tome 2: l\u2019analyse des correspondances. Dunod, Paris"},{"key":"788_CR11","first-page":"19","volume":"4","author":"S Bickel","year":"2004","unstructured":"Bickel S, Scheffer T (2004) Multi-view clustering. ICDM 4:19\u201326","journal-title":"ICDM"},{"issue":"3","key":"788_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0167-9473(92)90042-E","volume":"14","author":"G Celeux","year":"1992","unstructured":"Celeux G, Govaert G (1992) A classification EM algorithm for clustering and two stochastic versions. Comput Stat Data Anal 14(3):315\u2013332","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"788_CR13","doi-asserted-by":"publisher","first-page":"e2075","DOI":"10.1002\/nla.2075","volume":"24","author":"C Chen","year":"2017","unstructured":"Chen C, Ng MK, Zhang S (2017) Block spectral clustering methods for multiple graphs. Numer Linear Algebra Appl 24(1):e2075","journal-title":"Numer Linear Algebra Appl"},{"key":"788_CR14","first-page":"1757","volume":"9","author":"K Crammer","year":"2008","unstructured":"Crammer K, Kearns M, Wortman J (2008) Learning from multiple sources. J Mach Learn Res 9:1757\u20131774","journal-title":"J Mach Learn Res"},{"issue":"2","key":"788_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11222-007-9046-7","volume":"18","author":"JJ Daudin","year":"2008","unstructured":"Daudin JJ, Picard F, Robin S (2008) A mixture model for random graphs. Stat Comput 18(2):173\u2013183","journal-title":"Stat Comput"},{"key":"788_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc B 39:1\u201338","journal-title":"J R Stat Soc B"},{"key":"788_CR17","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering. In: Proceedings of the Ninth ACM SIGKDD, pp 89\u201398","DOI":"10.1145\/956750.956764"},{"key":"788_CR18","doi-asserted-by":"crossref","unstructured":"Dietterich TG (2000) Ensemble methods in machine learning. In: International workshop on multiple classifier systems. Springer, pp 1\u201315","DOI":"10.1007\/3-540-45014-9_1"},{"key":"788_CR19","volume-title":"The geometry of physics: an introduction","author":"T Frankel","year":"2012","unstructured":"Frankel T (2012) The geometry of physics: an introduction. Cambridge University Press, Cambridge"},{"key":"788_CR20","unstructured":"Gao J, Liang F, Fan W, Sun Y, Han J (2009) Graph-based consensus maximization among multiple supervised and unsupervised models. In: Advances in neural information processing systems, pp 585\u2013593"},{"key":"788_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0031-3203(02)00074-2","volume":"36","author":"G Govaert","year":"2003","unstructured":"Govaert G, Nadif M (2003) Clustering with block mixture models. Pattern Recogn 36:463\u2013473","journal-title":"Pattern Recogn"},{"issue":"4","key":"788_CR22","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TPAMI.2005.69","volume":"27","author":"G Govaert","year":"2005","unstructured":"Govaert G, Nadif M (2005) An EM algorithm for the block mixture model. IEEE Trans Pattern Anal Mach Intell 27(4):643\u2013647","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"788_CR23","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00500-005-0502-z","volume":"10","author":"G Govaert","year":"2006","unstructured":"Govaert G, Nadif M (2006) Fuzzy clustering to estimate the parameters of block mixture models. Soft Comput 10(5):415\u2013422","journal-title":"Soft Comput"},{"key":"788_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9781118649480","volume-title":"Co-clustering: models, algorithms and applications","author":"G Govaert","year":"2013","unstructured":"Govaert G, Nadif M (2013) Co-clustering: models, algorithms and applications. Wiley, Hoboken"},{"issue":"3","key":"788_CR25","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s11634-016-0274-6","volume":"12","author":"G Govaert","year":"2018","unstructured":"Govaert G, Nadif M (2018) Mutual information, phi-squared and model-based co-clustering for contingency tables. Adv Data Anal Classif 12(3):455\u2013488","journal-title":"Adv Data Anal Classif"},{"issue":"11","key":"788_CR26","doi-asserted-by":"publisher","first-page":"3938","DOI":"10.1016\/j.patcog.2012.04.010","volume":"45","author":"B Hanczar","year":"2012","unstructured":"Hanczar B, Nadif M (2012) Ensemble methods for biclustering tasks. Pattern Recogn 45(11):3938\u20133949","journal-title":"Pattern Recogn"},{"key":"788_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0167-9473(94)90132-5","volume":"18","author":"RA Harshman","year":"1994","unstructured":"Harshman RA, Lundy ME (1994) Parafac: parallel factor analysis. Comput Stat Data Anal 18:39\u201372","journal-title":"Comput Stat Data Anal"},{"key":"788_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-4149(87)90048-2","volume":"26","author":"S Janson","year":"1987","unstructured":"Janson S (1987) Poisson convergence and Poisson processes with applications to random graphs. Stoch Process Appl 26:1\u201330","journal-title":"Stoch Process Appl"},{"issue":"1","key":"788_CR29","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83(1):016107","journal-title":"Phys Rev E"},{"key":"788_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I","volume":"14","author":"HA Kiers","year":"2000","unstructured":"Kiers HA (2000) Towards a standardized notation and terminology in multiway analysis. J Chemom 14:105\u2013122","journal-title":"J Chemom"},{"issue":"3","key":"788_CR31","first-page":"455","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. J Math Psychol 51(3):455\u2013500","journal-title":"J Math Psychol"},{"issue":"9","key":"788_CR32","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1109\/TNNLS.2014.2359918","volume":"26","author":"L Labiod","year":"2014","unstructured":"Labiod L, Nadif M (2014) A unified framework for data visualization and coclustering. IEEE Trans Neural Netw Learn Syst 26(9):2194\u20132199","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"788_CR33","doi-asserted-by":"crossref","unstructured":"Li X, Zhang Y, Zhang R (2021) Semisupervised feature selection via generalized uncorrelated constraint and manifold embedding. In: IEEE transactions on neural networks and learning systems","DOI":"10.1109\/TNNLS.2021.3069038"},{"key":"788_CR34","doi-asserted-by":"crossref","unstructured":"Liu J, Wang C, Gao J, Han J (2013) Multi-view clustering via joint nonnegative matrix factorization. In: Proceedings of the 2013 SIAM international conference on data mining. SIAM, pp 252\u2013260","DOI":"10.1137\/1.9781611972832.28"},{"key":"788_CR35","first-page":"546","volume":"1997","author":"R Maclin","year":"1997","unstructured":"Maclin R, Opitz D (1997) An empirical evaluation of bagging and boosting. AAAI\/IAAI 1997:546\u2013551","journal-title":"AAAI\/IAAI"},{"key":"788_CR36","doi-asserted-by":"publisher","DOI":"10.1002\/0471721182","volume-title":"Finite mixture models","author":"GJ McLachlan","year":"2000","unstructured":"McLachlan GJ, Peel D (2000) Finite mixture models. Wiley, New York"},{"key":"788_CR37","doi-asserted-by":"crossref","unstructured":"Nadif M, Govaert G (2005) Block clustering of contingency table and mixture model. In: International symposium on intelligent data analysis. Springer, pp 249\u2013259","DOI":"10.1007\/11552253_23"},{"key":"788_CR38","doi-asserted-by":"crossref","unstructured":"Neal RM, Hinton GE (1998) A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Learning in graphical models. Springer, pp 355\u2013368","DOI":"10.1007\/978-94-011-5014-9_12"},{"key":"788_CR39","doi-asserted-by":"crossref","unstructured":"Nenadic O, Greenacre M (2007) Correspondence analysis in R, with two-and three-dimensional graphics: the CA package. J Stat Softw 20(3)","DOI":"10.18637\/jss.v020.i03"},{"key":"788_CR40","first-page":"849","volume":"14","author":"A Ng","year":"2001","unstructured":"Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. Adv Neural Inf Process Syst 14:849\u2013856","journal-title":"Adv Neural Inf Process Syst"},{"key":"788_CR41","doi-asserted-by":"crossref","unstructured":"Nie F, Li J, Li X et\u00a0al (2017) Self-weighted multiview clustering with multiple graphs. In: IJCAI, pp 2564\u20132570","DOI":"10.24963\/ijcai.2017\/357"},{"issue":"455","key":"788_CR42","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1198\/016214501753208735","volume":"96","author":"K Nowicki","year":"2001","unstructured":"Nowicki K, Snijders TAB (2001) Estimation and prediction for stochastic blockstructures. J Am Stat Assoc 96(455):1077\u20131087","journal-title":"J Am Stat Assoc"},{"key":"788_CR43","doi-asserted-by":"crossref","unstructured":"Qiao M, Yu J, Bian W, Li Q, Tao D (2017) Improving stochastic block models by incorporating power-law degree characteristic. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI-17), pp 2620\u20132626","DOI":"10.24963\/ijcai.2017\/365"},{"issue":"7","key":"788_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v088.i07","volume":"88","author":"F Role","year":"2019","unstructured":"Role F, Morbieu S, Nadif M (2019) Coclust: a python package for co-clustering. J Stat Softw 88(7):1\u201329","journal-title":"J Stat Softw"},{"issue":"3","key":"788_CR45","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11634-018-0323-4","volume":"13","author":"A Salah","year":"2019","unstructured":"Salah A, Nadif M (2019) Directional co-clustering. Adv Data Anal Classif 13(3):591\u2013620","journal-title":"Adv Data Anal Classif"},{"key":"788_CR46","doi-asserted-by":"crossref","unstructured":"Schapire RE (2003) The boosting approach to machine learning: An overview. In: Nonlinear estimation and classification, Springer, pp 149\u2013171","DOI":"10.1007\/978-0-387-21579-2_9"},{"key":"788_CR47","doi-asserted-by":"crossref","unstructured":"Shan H, Banerjee A (2008) Bayesian co-clustering. In: Eighth IEEE international conference on data mining. IEEE, pp 530\u2013539","DOI":"10.1109\/ICDM.2008.91"},{"issue":"3","key":"788_CR48","first-page":"343","volume":"2","author":"SC Sripada","year":"2011","unstructured":"Sripada SC, Rao MS (2011) Comparison of purity and entropy of k-means clustering and fuzzy c means clustering. Indian J Comput Sci Eng 2(3):343\u2013346","journal-title":"Indian J Comput Sci Eng"},{"key":"788_CR49","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles: a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"issue":"8","key":"788_CR50","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1109\/TPAMI.2016.2608882","volume":"39","author":"J Tang","year":"2017","unstructured":"Tang J, Shu X, Qi G, Li Z, Wang M, Yan S, Jain R (2017) Tri-clustered tensor completion for social-aware image tag refinement. IEEE Trans Pattern Anal Mach Intell 39(8):1662\u20131674","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"788_CR51","doi-asserted-by":"crossref","unstructured":"Tang W, Lu Z, Dhillon IS (2009) Clustering with multiple graphs. In: Ninth IEEE international conference on data mining. IEEE, pp 1016\u20131021","DOI":"10.1109\/ICDM.2009.125"},{"issue":"3","key":"788_CR52","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279\u2013311","journal-title":"Psychometrika"},{"issue":"03","key":"788_CR53","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons S, Ruiz-Shulcloper J (2011) A survey of clustering ensemble algorithms. Int J Pattern Recognit Artif Intell 25(03):337\u2013372","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"788_CR54","doi-asserted-by":"crossref","unstructured":"Veit A, Nickel M, Belongie S, Maaten L (2017) Separating self-expression and visual content in hashtag supervision. In: IEEE\/CVF conference on computer vision and pattern recognition (CVPR)","DOI":"10.1109\/CVPR.2018.00620"},{"issue":"6","key":"788_CR55","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/TKDE.2019.2903810","volume":"32","author":"H Wang","year":"2020","unstructured":"Wang H, Yang Y, Liu B (2020) GMC: graph-based multi-view clustering. IEEE Trans Knowl Data Eng 32(6):1116\u20131129","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"788_CR56","doi-asserted-by":"crossref","unstructured":"Wang Z, Kong X, Fu H, Li M, Zhang Y (2015) Feature extraction via multi-view non-negative matrix factorization with local graph regularization. In: IEEE international conference on image processing (ICIP), pp 3500\u20133504","DOI":"10.1109\/ICIP.2015.7351455"},{"key":"788_CR57","doi-asserted-by":"crossref","unstructured":"Wu T, Zhang R, Jiao Z, Wei X, Li X (2021) Adaptive spectral rotation via joint cluster and pairwise structure. In: IEEE transactions on knowledge and data engineering","DOI":"10.1109\/TKDE.2021.3076521"},{"key":"788_CR58","doi-asserted-by":"publisher","unstructured":"Yu X, Yu G, Wang J, Domeniconi C (2019) Co-clustering ensembles based on multiple relevance measures. In: IEEE transactions on knowledge and data engineering pp 1\u20131 https:\/\/doi.org\/10.1109\/TKDE.2019.2942029","DOI":"10.1109\/TKDE.2019.2942029"},{"key":"788_CR59","doi-asserted-by":"crossref","unstructured":"Zhang R, Zhang H, Li X (2021) Maximum joint probability with multiple representations for clustering. In: IEEE transactions on neural networks and learning systems","DOI":"10.1109\/TNNLS.2021.3056420"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00788-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00788-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00788-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:14:04Z","timestamp":1725736444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00788-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,3]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00788-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2021,9,3]]},"assertion":[{"value":"24 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}