{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:46Z","timestamp":1781086426799,"version":"3.54.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T00:00:00Z","timestamp":1532563200000},"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":["Appl Intell"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10489-018-1238-7","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T04:05:32Z","timestamp":1532577932000},"page":"4743-4759","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":402,"title":["K-means properties on six clustering benchmark datasets"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9554-2827","authenticated-orcid":false,"given":"Pasi","family":"Fr\u00e4nti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sami","family":"Sieranoja","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"1238_CR1","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy E (1965) Cluster analysis of multivariate data: efficiency vs. interpretability of classification. Biometrics 21:768","journal-title":"Biometrics"},{"key":"1238_CR2","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Berkeley symposium on mathematical statistics and probability, volume 1: statistics. University of California Press, Berkeley, pp 281\u2013297"},{"issue":"2","key":"1238_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"key":"1238_CR4","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:651\u2013666","journal-title":"Pattern Recogn Lett"},{"issue":"3","key":"1238_CR5","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/3477.764879","volume":"29","author":"K Krishna","year":"1999","unstructured":"Krishna K, Murty MN (1999) Genetic k-means algorithm. IEEE Trans Syst Man Cybern Part B 29 (3):433\u2013439","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"1","key":"1238_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0167-8655(99)00133-6","volume":"21","author":"P Fr\u00e4nti","year":"2000","unstructured":"Fr\u00e4nti P (2000) Genetic algorithm with deterministic crossover for vector quantization. Pattern Recogn Lett 21(1):61\u201368","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"1238_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s100440070007","volume":"3","author":"P Fr\u00e4nti","year":"2000","unstructured":"Fr\u00e4nti P, Kivij\u00e4rvi J (2000) Randomized local search algorithm for the clustering problem. Pattern Anal Applic 3(4):358\u2013369","journal-title":"Pattern Anal Applic"},{"key":"1238_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D Steinley","year":"2007","unstructured":"Steinley D, Brusco MJ (2007) Initializing k-means batch clustering: a critical evaluation of several techniques. J Classif 24:99\u2013121","journal-title":"J Classif"},{"key":"1238_CR9","doi-asserted-by":"crossref","unstructured":"Steinbach M, Ert\u00f6z L, Kumar V (2003) The challenges of clustering high dimensional data. New Vistas in statistical physics \u2013 applications in econophysics, bioinformatics, and pattern recognition. Springer","DOI":"10.1007\/978-3-662-08968-2_16"},{"issue":"1","key":"1238_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.20982\/tqmp.09.1.p015","volume":"9","author":"L Morissette","year":"2013","unstructured":"Morissette L, Chartier S (2013) The k-means clustering technique: general considerations and implementation in Mathematica. Tutor Quantitative Methods Psychol 9(1):15\u201324","journal-title":"Tutor Quantitative Methods Psychol"},{"issue":"4","key":"1238_CR11","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/TFUZZ.2011.2182354","volume":"20","author":"J Liang","year":"2012","unstructured":"Liang J, Bai L, Dang C, Cao F (2012) The k-means-type algorithms versus imbalanced data distributions. IEEE Trans Fuzzy Syst 20(4):728\u2013745","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1238_CR12","first-page":"65","volume":"27","author":"U Luxburg","year":"2012","unstructured":"Luxburg U, Williamson RC, Guyon I (2012) Clustering: science or art. J Mach Learn Res 27:65\u201379","journal-title":"J Mach Learn Res"},{"key":"1238_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.datak.2014.07.008","volume":"92","author":"Q Zhao","year":"2014","unstructured":"Zhao Q, Fr\u00e4nti P (2014) WB-index: a sum-of-squares based index for cluster validity. Data Knowl Eng 92:77\u201389","journal-title":"Data Knowl Eng"},{"issue":"3","key":"1238_CR14","doi-asserted-by":"publisher","first-page":"252","DOI":"10.3844\/jcssp.2008.252.255","volume":"4","author":"M Zoubi","year":"2008","unstructured":"Zoubi M, Rawi M (2008) An efficient approach for computing silhouette coefficients. J Comput Sci 4 (3):252\u2013255","journal-title":"J Comput Sci"},{"issue":"11","key":"1238_CR15","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti P, Virmajoki O, Hautam\u00e4ki V (2006) Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans Pattern Anal Mach Intell 28(11):1875\u20131881","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1238_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"RR Zhang","year":"1997","unstructured":"Zhang RR, Livny M (1997) BIRCH: a new data clustering algorithm and its applications. Data Min Knowl Disc 1(2):141\u2013182","journal-title":"Data Min Knowl Disc"},{"key":"1238_CR17","unstructured":"K\u00e4rkk\u00e4inen I, Fr\u00e4nti P Dynamic local search algorithm for the clustering problem, Research Report A-2002-6"},{"issue":"5","key":"1238_CR18","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti P, Virmajoki O (2006) Iterative shrinking method for clustering problems. Pattern Recogn 39 (5):761\u2013765","journal-title":"Pattern Recogn"},{"key":"1238_CR19","first-page":"207","volume-title":"Lecture Notes in Computer Science","author":"Pasi Fr\u00e4nti","year":"2016","unstructured":"Fr\u00e4nti P, Mariescu-Istodor R, Zhong C (2016) XNN graph. In: IAPR Joint int. workshop on structural, syntactic, and statistical pattern recognition merida, Mexico, LNCS 10029, pp 207\u2013 217"},{"issue":"8","key":"1238_CR20","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","volume":"28","author":"M Rezaei","year":"2016","unstructured":"Rezaei M, Fr\u00e4nti P (2016) Set-matching methods for external cluster validity. IEEE Trans Knowl Data Eng 28(8):2173\u2013 2186","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1238_CR21","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1198\/jcgs.2009.08054","volume":"19","author":"R Maitra","year":"2010","unstructured":"Maitra R, Melnykov V (2010) Simulating data to study performance of finite mixture modeling and clustering algorithms. J Comput Graph Stat 19(2):354\u2013376","journal-title":"J Comput Graph Stat"},{"key":"1238_CR22","first-page":"217","volume-title":"Lecture Notes in Computer Science","author":"Kevin Beyer","year":"1999","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful. In: Int Conf on database theory, pp 217\u2013235"},{"key":"1238_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume":"2153","author":"E Chavez","year":"2001","unstructured":"Chavez E, Navarro G (2001) A probabilistic spell for the curse of dimensionality. Workshop on Algorithm Engineering and Experimentation LNCS 2153:147\u2013160","journal-title":"Workshop on Algorithm Engineering and Experimentation LNCS"},{"issue":"3","key":"1238_CR24","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/TKDE.2013.25","volume":"26","author":"N Tomasev","year":"2014","unstructured":"Tomasev N, Radovanovi M, Mladeni D, Ivanovi M (2014) The role of hubness in clustering high-dimensional data. IEEE Trans Knowl Data Eng 26(3):739\u2013751","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1238_CR25","first-page":"2487","volume":"11","author":"M Radovanovic","year":"2010","unstructured":"Radovanovic M, Nanopoulos A, Ivanovic M (2010) Hubs in space: popular nearest neighbors in high-dimensional data. J Mach Learn Res 11:2487\u20132531","journal-title":"J Mach Learn Res"},{"key":"1238_CR26","volume-title":"The hardness of k-means clustering, Technical Report CS2007-0890","author":"S Dasgupta","year":"2007","unstructured":"Dasgupta S (2007) The hardness of k-means clustering, Technical Report CS2007-0890. University of California, San Diego"},{"key":"1238_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan M, Nimbhorkar P, Varadarajan K (2012) The planar k-means problem is NP-hard. Theor Comput Sci 442:13\u201321","journal-title":"Theor Comput Sci"},{"issue":"9","key":"1238_CR28","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.patcog.2014.03.017","volume":"47","author":"P Fr\u00e4nti","year":"2014","unstructured":"Fr\u00e4nti P, Rezaei M, Zhao Q (2014) Centroid index: cluster level similarity measure. Pattern Recogn 47(9):3034\u20133045","journal-title":"Pattern Recogn"},{"issue":"2","key":"1238_CR29","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1037\/met0000049","volume":"21","author":"D Steinley","year":"2016","unstructured":"Steinley D, Brusco MJ, Hubert L (2016) The variance of the adjusted rand index. Psychol Methods 21 (2):261\u2013272","journal-title":"Psychol Methods"},{"key":"1238_CR30","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T Kanungo","year":"2004","unstructured":"Kanungo T, Mount DM, Netanyahu N, Piatko C, Silverman R, Wu AY (2004) A local search approximation algorithm for k-means clustering. Comput Geom Theory Appl 28:89\u2013112","journal-title":"Comput Geom Theory Appl"},{"issue":"2","key":"1238_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3390\/a1020043","volume":"1","author":"SC Li","year":"2008","unstructured":"Li SC, Ng YK, Zhang L (2008) A PTAS for the k-consensus structures problem under squared euclidean distance. Algorithms 1(2):43\u201351","journal-title":"Algorithms"},{"key":"1238_CR32","unstructured":"Awasthi P, Charikar M, Krishnaswamy R, Sinop AK (2015) The hardness of approximation of euclidean k-means. In: Int. Symp. on computational geometry (SoCG). Eindhoven"},{"key":"1238_CR33","unstructured":"Arthur D, Vassilvitskii S (2007) K-means+ +: the advantages of careful seeding. In: ACM-SIAM Symp. on discrete algorithms (SODA), New Orleans, 1027-1035 January"},{"issue":"2","key":"1238_CR34","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/bs.3830120210","volume":"12","author":"GH Ball","year":"1967","unstructured":"Ball GH, Hall DJ (1967) A clustering technique for summarizing multivariate data. Syst Res Behav Sci 12 (2):153\u2013155","journal-title":"Syst Res Behav Sci"},{"key":"1238_CR35","unstructured":"Bradley P, Fayyad U (1998) Refining initial points for k-means clustering. In: Int. Conf. on machine learning. San Francisco, pp 91-99"},{"key":"1238_CR36","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1037\/1082-989X.8.3.294","volume":"8","author":"D Steinley","year":"2003","unstructured":"Steinley D (2003) Local optima in k-means clustering: what you don\u2019t know may hurt you. Psychol Methods 8:294\u2013304","journal-title":"Psychol Methods"},{"issue":"2\u20133","key":"1238_CR37","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"Gonzalez T (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38 (2\u20133):293\u2013306","journal-title":"Theor Comput Sci"},{"key":"1238_CR38","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/116890.116892","volume":"1","author":"S Tezuka","year":"1991","unstructured":"Tezuka S, Equyer P (1991) Efficient portable combined Tausworthe random number generators. ACM Trans Model Comput Simul 1:99\u2013112","journal-title":"ACM Trans Model Comput Simul"},{"issue":"10","key":"1238_CR39","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"J Pe\u00f1a","year":"1999","unstructured":"Pe\u00f1a J, Lozano JA, Larra\u00f1aga P (1999) An empirical comparision of four initialization methods for the k-means algorithm. Pattern Recogn Lett 20(10):1027\u20131040","journal-title":"Pattern Recogn Lett"},{"key":"1238_CR40","doi-asserted-by":"crossref","unstructured":"Mallah C, Cope J, Orwell J (2013) Plant leaf classification using probabilistic integration of shape, texture and margin features. Signal Process Pattern Recogn Appl","DOI":"10.2316\/P.2013.798-098"},{"issue":"2","key":"1238_CR41","first-page":"161","volume":"6","author":"PW Frey","year":"1991","unstructured":"Frey PW, Slate DJ (1991) Letter recognition using Holland-style adaptive classifiers. Mach Learn 6 (2):161\u2013182","journal-title":"Mach Learn"},{"key":"1238_CR42","doi-asserted-by":"crossref","unstructured":"Yan D, Huang L, Jordan MI (2009) Fast approximate spectral clustering. ACM SIGKDD Int Conf on knowledge discovery and data mining, 907\u2013916","DOI":"10.1145\/1557019.1557118"},{"issue":"2","key":"1238_CR43","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/TSMCB.2008.2004559","volume":"39","author":"H Xiong","year":"2009","unstructured":"Xiong H, Wu J, Chen J (2009) K-means clustering versus validation measures: a data distribution perspective. IEEE Trans Syst Man Cybern Part B 39(2):318\u2013331","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"1238_CR44","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.knosys.2016.01.001","volume":"96","author":"K Zhou","year":"2016","unstructured":"Zhou K, Yang S (2016) Exploring the uniform effect of FCM clustering: a data distribution perspective. Knowl-based Syst 96:76\u201383","journal-title":"Knowl-based Syst"},{"issue":"46","key":"1238_CR45","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch JE (2005) An index to quantify an individual\u2019s scientific research output. PNAS 102(46):16569\u201372","journal-title":"PNAS"},{"key":"1238_CR46","first-page":"125","volume":"2","author":"A Ben-Hur","year":"2001","unstructured":"Ben-Hur A, Horn D, Siegelmann HT, Vapnik V (2001) Support vector clustering. J Mach Learn Res 2:125\u2013137","journal-title":"J Mach Learn Res"},{"key":"1238_CR47","unstructured":"Balcan M-F, Blum A, Vempala S (2008) A discriminative framework for clustering via similarity functions. ACM Symposium on theory of computing, 671\u2013680"},{"key":"1238_CR48","unstructured":"Ackerman M, Ben-David S, Br\u00e2nzei S, Loker D (2012) Weighted clustering. AAAI Conf on artificial intelligence, 858\u2013863"},{"key":"1238_CR49","doi-asserted-by":"crossref","unstructured":"Bi\u00e7ici E, Yuret D (2007) Locally scaled density based clustering. In: Int. Conf. on adaptive and natural computing algorithms. Springer, pp 739\u2013748","DOI":"10.1007\/978-3-540-71618-1_82"},{"key":"1238_CR50","unstructured":"Pelleg D, Moore AW (2000) X-means: extending k-means with efficient estimation of the number of clusters. Int Conf on machine learning, 1"},{"key":"1238_CR51","unstructured":"Hinneburg A, Keim DA (1999) Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering. Int Conf on very large databases, 506\u2013517"},{"issue":"1","key":"1238_CR52","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10618-006-0060-8","volume":"14","author":"C Domeniconi","year":"2007","unstructured":"Domeniconi C, Gunopulos D, Ma S, Yan B, Al-Razgan M, Papadopoulos D (2007) Locally adaptive metrics for clustering high dimensional data. Data Min Knowl Disc 14(1):63\u201397","journal-title":"Data Min Knowl Disc"},{"key":"1238_CR53","doi-asserted-by":"crossref","unstructured":"Bellman R (1961) Adaptive control processes: a guided tour. Princeton University Press","DOI":"10.1515\/9781400874668"},{"key":"1238_CR54","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional spaces. In: Int. conf. on database theory, LNCS vol 1973. Springer, pp 420\u2013 434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"1238_CR55","doi-asserted-by":"crossref","unstructured":"Sieranoja S, Fr\u00e4nti P (2018) Random projection for k-means clustering. In: Int. Conf. artificial intelligence and soft computing (ICAISC). Zakopane","DOI":"10.1007\/978-3-319-91253-0_63"},{"issue":"1","key":"1238_CR56","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 Statist Soc C 28 (1):100\u2013108","journal-title":"J R Statist Soc C"},{"issue":"14","key":"1238_CR57","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1016\/j.patrec.2011.07.011","volume":"32","author":"M Erisoglu","year":"2011","unstructured":"Erisoglu M, Calis N, Sakallioglu S (2011) A new algorithm for initial cluster centers in k-means algorithm. Pattern Recogn Lett 32(14):1701\u20131705","journal-title":"Pattern Recogn Lett"},{"key":"1238_CR58","first-page":"1","volume":"5:13","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti P (2018) Efficiency of random swap clustering. J Big Data 5:13:1\u201329","journal-title":"J Big Data"},{"key":"1238_CR59","volume-title":"Pattern classification and scene analysis","author":"RO Duda","year":"1973","unstructured":"Duda RO, Hart PE (1973) Pattern classification and scene analysis. Wiley, New York"},{"issue":"13","key":"1238_CR60","doi-asserted-by":"publisher","first-page":"1604","DOI":"10.1016\/j.patrec.2011.06.023","volume":"32","author":"T Kinnunen","year":"2011","unstructured":"Kinnunen T, Sidoroff I, Tuononen M, Fr\u00e4nti P (2011) Comparison of clustering methods: a case study of text-independent speaker modeling. Pattern Recogn Lett 32(13):1604\u20131617","journal-title":"Pattern Recogn Lett"},{"key":"1238_CR61","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s10489-017-0992-2","volume":"48","author":"X Huang","year":"2018","unstructured":"Huang X, Zhang L, Wang B, Li F, Zhang Z (2018) Feature clustering based support vector machine recursive feature elimination for gene selection. Appl Intell 48:594\u2013607","journal-title":"Appl Intell"},{"key":"1238_CR62","unstructured":"Ultsch A (2005) Clustering with SOM: U*C, workshop on self-organizing maps. Paris, pp 75\u201382"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1238-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1238-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1238-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T19:13:02Z","timestamp":1564081982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1238-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,26]]},"references-count":62,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1238"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1238-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,26]]},"assertion":[{"value":"26 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}