{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T03:41:59Z","timestamp":1778125319105,"version":"3.51.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:00:00Z","timestamp":1557187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11042-019-7663-8","type":"journal-article","created":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T21:16:43Z","timestamp":1557263803000},"page":"33279-33296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Initialization-similarity clustering algorithm"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3047-1148","authenticated-orcid":false,"given":"Tong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingting","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jukai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YongXin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"issue":"6","key":"7663_CR1","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1049\/iet-ipr.2017.0550","volume":"12","author":"T Ahmed","year":"2018","unstructured":"Ahmed T, Sarma M (2018) Locality sensitive hashing based space partitioning approach for indexing multidimensional feature vectors of fingerprint image data. IET Image Process 12(6):1056\u20131064","journal-title":"IET Image Process"},{"key":"7663_CR2","doi-asserted-by":"crossref","unstructured":"Ankerst M, et al (1999) OPTICS: ordering points to identify the clustering structure. in ACM Sigmod record. p. 49\u201360","DOI":"10.1145\/304181.304187"},{"key":"7663_CR3","unstructured":"Barron JT (2017) A more general robust loss function. arXiv preprint arXiv:1701.03077"},{"issue":"1","key":"7663_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TFUZZ.2018.2856081","volume":"27","author":"Z Bian","year":"2019","unstructured":"Bian Z, Ishibuchi H, Wang S (2019) Joint learning of spectral clustering structure and fuzzy similarity matrix of data. IEEE Trans Fuzzy Syst 27(1):31\u201344","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"7","key":"7663_CR5","doi-asserted-by":"publisher","first-page":"2631","DOI":"10.1109\/TCYB.2018.2831447","volume":"49","author":"Yi Bin","year":"2019","unstructured":"Bin Y et al (2018) Describing video with attention-based bidirectional LSTM. IEEE transactions on cybernetics. \nhttps:\/\/doi.org\/10.1109\/TCYB.2018.2831447","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"7663_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00131148","volume":"19","author":"MJ Black","year":"1996","unstructured":"Black MJ, Rangarajan A (1996) On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. Int J Comput Vis 19(1):57\u201391","journal-title":"Int J Comput Vis"},{"issue":"3","key":"7663_CR7","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10115-017-1105-6","volume":"55","author":"Z Bu","year":"2018","unstructured":"Bu Z et al (2018) GLEAM: a graph clustering framework based on potential game optimization for large-scale social networks. Knowl Inf Syst 55(3):741\u2013770","journal-title":"Knowl Inf Syst"},{"key":"7663_CR8","unstructured":"Cherng JS, Lo MJ (2001) A hypergraph based clustering algorithm for spatial data sets. in ICDM, p. 83\u201390"},{"issue":"5","key":"7663_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D Comaniciu","year":"2002","unstructured":"Comaniciu D, Meer P (2002) Mean shift: a robust approach toward feature space analysis. IEEE Trans Pattern Anal Mach Intell 24(5):603\u2013619","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"7663_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.akcej.2017.10.006","volume":"15","author":"A Das","year":"2018","unstructured":"Das A, Panigrahi P (2018) Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs. AKCE International Journal of Graphs and Combinatorics 15(3):261\u2013270","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"issue":"4","key":"7663_CR11","first-page":"247","volume":"2","author":"S Deelers","year":"2007","unstructured":"Deelers S, Auwatanamongkol S (2007) Enhancing K-means algorithm with initial cluster centers derived from data partitioning along the data axis with the highest variance. Int J Comput Sci 2(4):247\u2013252","journal-title":"Int J Comput Sci"},{"key":"7663_CR12","unstructured":"Doad PK, Mahip MB (2013) Survey on Clustering Algorithm & Diagnosing Unsupervised Anomalies for Network Security. International Journal of Current Engineering and Technology ISSN, p. 2277\u2013410"},{"issue":"4","key":"7663_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1460797.1460800","volume":"2","author":"C Domeniconi","year":"2009","unstructured":"Domeniconi C, Al-Razgan M (2009) Weighted cluster ensembles: methods and analysis. ACM Transactions on Knowledge Discovery from Data (TKDD) 2(4):17","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"key":"7663_CR14","unstructured":"Duan Y, Liu Q, Xia S (2018) An improved initialization center k-means clustering algorithm based on distance and density in AIP: 1955(1), p. 040\u2013046"},{"key":"7663_CR15","unstructured":"Estivill-Castro V, Lee I (2000) Amoeba: Hierarchical clustering based on spatial proximity using delaunay diagram. in ISSDH, p. 1\u201316"},{"issue":"4","key":"7663_CR16","first-page":"5","volume":"52","author":"S Geman","year":"1987","unstructured":"Geman S, McClure DE (1987) Statistical methods for tomographic image reconstruction. Bulletin of the International statistical Institute 52(4):5\u201321","journal-title":"Bulletin of the International statistical Institute"},{"issue":"5","key":"7663_CR17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha S, Rastogi R, Shim K (2000) ROCK: a robust clustering algorithm for categorical attributes. Inf Syst 25(5):345\u2013366","journal-title":"Inf Syst"},{"issue":"1","key":"7663_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","volume":"26","author":"S Guha","year":"2001","unstructured":"Guha S, Rastogi R, Shim K (2001) Cure: an efficient clustering algorithm for large databases. Inf Syst 26(1):35\u201358","journal-title":"Inf Syst"},{"issue":"1","key":"7663_CR19","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm AS 136: a k-means clustering algorithm. J R Stat Soc: Ser C: Appl Stat 28(1):100\u2013108","journal-title":"J R Stat Soc: Ser C: Appl Stat"},{"key":"7663_CR20","doi-asserted-by":"crossref","unstructured":"Hu H, et al (2014) Smooth representation clustering. in CV PR. p. 3834\u20133841","DOI":"10.1109\/CVPR.2014.484"},{"issue":"8","key":"7663_CR21","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"key":"7663_CR22","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.knosys.2018.09.009","volume":"163","author":"Z Kang","year":"2019","unstructured":"Kang Z et al (2019) Low-rank kernel learning for graph-based clustering. Knowl-Based Syst 163:510\u2013517","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"7663_CR23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han E-H, Kumar V (1999) Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8):68\u201375","journal-title":"Computer"},{"issue":"11","key":"7663_CR24","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/TPAMI.2006.226","volume":"28","author":"LI Kuncheva","year":"2006","unstructured":"Kuncheva LI, Vetrov DP (2006) Evaluation of stability of k-means cluster ensembles with respect to random initialization. IEEE Trans Pattern Anal Mach Intell 28(11):1798\u20131808","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"7663_CR25","unstructured":"Lakshmi MA, Daniel GV, Rao DS (2019) Initial Centroids for K-Means Using Nearest Neighbors and Feature Means, in SCSP, p. 27\u201334"},{"issue":"22","key":"7663_CR26","doi-asserted-by":"crossref","first-page":"29605","DOI":"10.1007\/s11042-017-5381-7","volume":"77","author":"C Lei","year":"2018","unstructured":"Lei C, Zhu X (2018) Unsupervised feature selection via local structure learning and sparse learning. Multimed Tools Appl 77(22):29605\u201329622","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"7663_CR27","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas A, Vlassis N, Verbeek JJ (2003) The global k-means clustering algorithm. Pattern Recogn 36(2):451\u2013461","journal-title":"Pattern Recogn"},{"key":"7663_CR28","doi-asserted-by":"crossref","unstructured":"Lindsten F, Ohlsson H, Ljung L (2011) Clustering using sum-of-norms regularization: With application to particle filter output computation. in SSP, p. 201\u2013201","DOI":"10.1109\/SSP.2011.5967659"},{"issue":"1","key":"7663_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu G et al (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell 35(1):171\u2013184","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"7663_CR30","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"key":"7663_CR31","first-page":"347","volume-title":"Computer Vision \u2013 ECCV 2012","author":"Can-Yi Lu","year":"2012","unstructured":"Lu CY, et al (2012) Robust and efficient subspace segmentation via least squares regression. in ECCV. p. 347\u2013360"},{"issue":"7\u20138","key":"7663_CR32","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1007\/s00521-013-1437-4","volume":"24","author":"HM Moftah","year":"2014","unstructured":"Moftah HM et al (2014) Adaptive k-means clustering algorithm for MR breast image segmentation. Neural Comput & Applic 24(7\u20138):1917\u20131928","journal-title":"Neural Comput & Applic"},{"key":"7663_CR33","first-page":"211","volume-title":"Advances in Intelligent Systems and Computing","author":"Mahesh Motwani","year":"2018","unstructured":"Motwani M, Arora N, Gupta A (2019) A Study on Initial Centroids Selection for Partitional Clustering Algorithms, in Software Engineering. p. 211\u2013220"},{"key":"7663_CR34","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Huang H (2014) Clustering and projected clustering with adaptive neighbors. in SIGKDD, p. 977\u2013986","DOI":"10.1145\/2623330.2623726"},{"issue":"12","key":"7663_CR35","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1093\/bioinformatics\/bty050","volume":"34","author":"S Park","year":"2018","unstructured":"Park S, Zhao H (2018) Spectral clustering based on learning similarity matrix. Bioinformatics 34(12):2069\u20132076","journal-title":"Bioinformatics"},{"issue":"1","key":"7663_CR36","doi-asserted-by":"crossref","first-page":"60","DOI":"10.3844\/jcssp.2010.60.66","volume":"6","author":"KK Pavan","year":"2010","unstructured":"Pavan KK, Rao AD, Sridhar G (2010) Single pass seed selection algorithm for k-means. J Comput Sci 6(1):60\u201366","journal-title":"J Comput Sci"},{"key":"7663_CR37","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.future.2017.03.016","volume":"83","author":"V Radhakrishna","year":"2018","unstructured":"Radhakrishna V et al (2018) A novel fuzzy similarity measure and prevalence estimation approach for similarity profiled temporal association pattern mining. Futur Gener Comput Syst 83:582\u2013595","journal-title":"Futur Gener Comput Syst"},{"key":"7663_CR38","unstructured":"Rasmussen CE (2000) The infinite Gaussian mixture model. in NIPS, p.554\u2013560"},{"issue":"8","key":"7663_CR39","doi-asserted-by":"crossref","first-page":"2583","DOI":"10.1007\/s00500-017-2513-y","volume":"22","author":"H Rong","year":"2018","unstructured":"Rong H et al (2018) A novel subgraph K+-isomorphism method in social network based on graph similarity detection. Soft Comput 22(8):2583\u20132601","journal-title":"Soft Comput"},{"key":"7663_CR40","unstructured":"Satsiou A, Vrochidis S, Kompatsiaris I (2018) A Hybrid Recommendation System Based on Density-Based Clustering. in INSCI 2018"},{"key":"7663_CR41","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/j.neucom.2017.06.053","volume":"267","author":"A Saxena","year":"2017","unstructured":"Saxena A et al (2017) A review of clustering techniques and developments. Neurocomputing 267:664\u2013681","journal-title":"Neurocomputing"},{"issue":"37","key":"7663_CR42","doi-asserted-by":"crossref","first-page":"9814","DOI":"10.1073\/pnas.1700770114","volume":"114","author":"SA Shah","year":"2017","unstructured":"Shah SA, Koltun V (2017) Robust continuous clustering. Proc Natl Acad Sci 114(37):9814\u20139819","journal-title":"Proc Natl Acad Sci"},{"key":"7663_CR43","unstructured":"Sharan R, Shamir R (2000) CLICK: a clustering algorithm with applications to gene expression analysis. in ICISMB. 8(307), p. 307\u2013316"},{"key":"7663_CR44","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.patcog.2017.09.018","volume":"74","author":"FB Silva","year":"2018","unstructured":"Silva FB et al (2018) Graph-based bag-of-words for classification. Pattern Recogn 74:266\u2013285","journal-title":"Pattern Recogn"},{"issue":"10","key":"7663_CR45","doi-asserted-by":"crossref","first-page":"13","DOI":"10.5120\/11430-6785","volume":"67","author":"Archana Singh","year":"2013","unstructured":"Singh A, A Yadav, Rana A (2013) K-means with Three different Distance Metrics. International Journal of Computer Applications, 67(10)","journal-title":"International Journal of Computer Applications"},{"issue":"10","key":"7663_CR46","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1109\/TNNLS.2018.2851077","volume":"30","author":"Jingkuan Song","year":"2019","unstructured":"Song J et al (2018) From deterministic to generative: multimodal stochastic RNNs for video captioning. IEEE transactions on neural networks and learning systems. \nhttps:\/\/doi.org\/10.1109\/TNNLS.2018.2851077","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"3","key":"7663_CR47","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1134\/S0965542518030132","volume":"58","author":"VV Voloshinov","year":"2018","unstructured":"Voloshinov VV (2018) A generalization of the Karush\u2013Kuhn\u2013Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation. Comput Math Math Phys 58(3):364\u2013377","journal-title":"Comput Math Math Phys"},{"key":"7663_CR48","unstructured":"Wang J, et al (2015) Fast Approximate K-Means via Cluster Closures, in MDMA. p. 373\u2013395"},{"key":"7663_CR49","doi-asserted-by":"crossref","first-page":"77911","DOI":"10.1109\/ACCESS.2018.2884441","volume":"6","author":"C Wang","year":"2018","unstructured":"Wang C et al (2018) Multiple kernel clustering with global and local structure alignment. IEEE Access 6:77911\u201377920","journal-title":"IEEE Access"},{"key":"7663_CR50","doi-asserted-by":"crossref","unstructured":"Wong KC (2015) A short survey on data clustering algorithms. in ISCMI","DOI":"10.1109\/ISCMI.2015.10"},{"key":"7663_CR51","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.neucom.2013.12.027","volume":"135","author":"S Wu","year":"2014","unstructured":"Wu S, Feng X, Zhou W (2014) Spectral clustering of high-dimensional data exploiting sparse representation vectors. Neurocomputing 135:229\u2013239","journal-title":"Neurocomputing"},{"issue":"2","key":"7663_CR52","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","volume":"2","author":"D Xu","year":"2015","unstructured":"Xu D, Tian Y (2015) A comprehensive survey of clustering algorithms. Annals of Data Science 2(2):165\u2013193","journal-title":"Annals of Data Science"},{"key":"7663_CR53","unstructured":"Xu X, et al. (1998) A distribution-based clustering algorithm for mining in large spatial databases. in ICDE, p. 324\u2013331"},{"key":"7663_CR54","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.cogsys.2018.01.003","volume":"53","author":"Q Yan","year":"2019","unstructured":"Yan Q et al (2019) A discriminated similarity matrix construction based on sparse subspace clustering algorithm for hyperspectral imagery. Cogn Syst Res 53:98\u2013110","journal-title":"Cogn Syst Res"},{"key":"7663_CR55","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.ins.2015.03.062","volume":"320","author":"S Zahra","year":"2015","unstructured":"Zahra S et al (2015) Novel centroid selection approaches for KMeans-clustering based recommender systems. Inf Sci 320:156\u2013189","journal-title":"Inf Sci"},{"key":"7663_CR56","doi-asserted-by":"publisher","unstructured":"Zheng W et al (2018) Unsupervised feature selection by self-paced learning regularization. Pattern Recogn Lett. \nhttps:\/\/doi.org\/10.1016\/j.patrec.2018.06.029","DOI":"10.1016\/j.patrec.2018.06.029"},{"issue":"22","key":"7663_CR57","doi-asserted-by":"crossref","first-page":"29739","DOI":"10.1007\/s11042-017-5272-y","volume":"77","author":"W Zheng","year":"2018","unstructured":"Zheng W et al (2018) Dynamic graph learning for spectral feature selection. Multimed Tools Appl 77(22):29739\u201329755","journal-title":"Multimed Tools Appl"},{"key":"7663_CR58","doi-asserted-by":"publisher","unstructured":"Zhou X et al (2018) Graph convolutional network hashing. IEEE transactions on cybernetics. \nhttps:\/\/doi.org\/10.1109\/TCYB.2018.2883970","DOI":"10.1109\/TCYB.2018.2883970"},{"issue":"9","key":"7663_CR59","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1109\/TMM.2017.2703636","volume":"19","author":"X Zhu","year":"2017","unstructured":"Zhu X et al (2017) Graph PCA hashing for similarity search. IEEE Transactions on Multimedia 19(9):2033\u20132044","journal-title":"IEEE Transactions on Multimedia"},{"issue":"8","key":"7663_CR60","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1109\/TKDE.2018.2858782","volume":"31","author":"Xiaofeng Zhu","year":"2019","unstructured":"Zhu X et al (2018) Low-rank sparse subspace for spectral clustering. IEEE Trans Knowl Data Eng. \nhttps:\/\/doi.org\/10.1109\/TKDE.2018.2858782","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"10","key":"7663_CR61","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TKDE.2018.2873378","volume":"31","author":"Xiaofeng Zhu","year":"2019","unstructured":"Zhu X et al (2018) One-step multi-view spectral clustering. IEEE Trans Knowl Data Eng. \nhttps:\/\/doi.org\/10.1109\/TKDE.2018.2873378","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-7663-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-019-7663-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-7663-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T23:20:52Z","timestamp":1588720852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-019-7663-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,7]]},"references-count":61,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["7663"],"URL":"https:\/\/doi.org\/10.1007\/s11042-019-7663-8","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,7]]},"assertion":[{"value":"6 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}