{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:43Z","timestamp":1740176743075,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s41060-019-00188-y","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T06:02:35Z","timestamp":1560232955000},"page":"339-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel SLINK for big data"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-9905","authenticated-orcid":false,"given":"Poonam","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Sonal","family":"Kumari","sequence":"additional","affiliation":[]},{"given":"Sumit","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Sundar","family":"Balasubramaniam","sequence":"additional","affiliation":[]},{"given":"Navneet","family":"Goyal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"188_CR1","unstructured":"(2013) Uci Machine Learning Repository. \nhttp:\/\/archive.ics.uci.edu\/ml\n\n. Accessed on 13 Oct 2013"},{"key":"188_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications, 1st edn. CRC Press, Boca Raton (2013)","edition":"1"},{"issue":"9","key":"188_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"188_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","volume":"1","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L.: A parallel algorithm for constructing minimum spanning trees. J. Algorithms 1(1), 51\u201359 (1980)","journal-title":"J. Algorithms"},{"issue":"3","key":"188_CR5","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1111\/j.1365-2966.2007.11997.x","volume":"379","author":"S Bertone","year":"2007","unstructured":"Bertone, S., De Lucia, G., Thomas, P.A.: The recycling of gas and metals in galaxy formation: predictions of a dynamical feedback model. Mon. Not. R. Astron. Soc. 379(3), 1143\u20131154 (2007)","journal-title":"Mon. Not. R. Astron. Soc."},{"issue":"2","key":"188_CR6","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1111\/j.1365-2966.2006.10519.x","volume":"370","author":"RG Bower","year":"2006","unstructured":"Bower, R.G., Benson, A.J., Malbon, R.K., Helly, J.C., Frenk, C.S., Baugh, C.M., Cole, S., Lacey, C.G.: Breaking the hierarchy of galaxy formation. Mon. Not. R. Astron. Soc. 370(2), 645\u2013655 (2006)","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"188_CR7","first-page":"17","volume-title":"Tools for High Performance Computing","author":"H Brunst","year":"2010","unstructured":"Brunst, H., Hackenberg, D., Juckeland, G., Rohling, H.: Comprehensive performance tracking with vampir 7. Tools for High Performance Computing, pp. 17\u201329. Springer, Berlin (2010)"},{"key":"188_CR8","doi-asserted-by":"crossref","unstructured":"Challa, J.S., Goyal, P., Nikhil, S., Mangla, A., Balasubramaniam, S.S., Goyal, N.: Dd-rtree: a dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms. In: 2016 IEEE International Conference on Big Data (Big Data), IEEE Computer Society, Washington DC, USA, pp. 27\u201336 (2016)","DOI":"10.1109\/BigData.2016.7840586"},{"key":"188_CR9","volume-title":"Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)","author":"B Chapman","year":"2007","unstructured":"Chapman, B., Jost, G., Rvd, P.: Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation). The MIT Press, Cambridge (2007)"},{"key":"188_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"2","key":"188_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"188_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0169-023X(02)00138-6","volume":"44","author":"M Dash","year":"2003","unstructured":"Dash, M., Liu, H., Scheuermann, P., Tan, K.L.: Fast hierarchical clustering and its validation. Data Knowl. Eng. 44(1), 109\u2013138 (2003)","journal-title":"Data Knowl. Eng."},{"issue":"3","key":"188_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.datak.2006.07.004","volume":"61","author":"M Dash","year":"2007","unstructured":"Dash, M., Petrutiu, S., Scheuermann, P.: ppop: fast yet accurate parallel hierarchical clustering using partitioning. Data Knowl. Eng. 61(3), 563\u2013578 (2007)","journal-title":"Data Knowl. Eng."},{"key":"188_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1111\/j.1365-2966.2006.11287.x","volume":"375","author":"G De Lucia","year":"2007","unstructured":"De Lucia, G., Blaizot, J.: The hierarchical formation of the brightest cluster galaxies. Mon. Not. R. Astron. Soc. 375, 2\u201314 (2007)","journal-title":"Mon. Not. R. Astron. Soc."},{"issue":"5","key":"188_CR15","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.parco.2005.01.001","volume":"31","author":"Z Du","year":"2005","unstructured":"Du, Z., Lin, F.: A novel parallelization approach for hierarchical clustering. Parallel Comput. 31(5), 523\u2013527 (2005)","journal-title":"Parallel Comput."},{"key":"188_CR16","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, AAAI Press, KDD\u201996, pp. 226\u2013231 (1996)"},{"key":"188_CR17","unstructured":"Fatta, G.D., Pettinger, D.: Dynamic load balancing in parallel kd-tree k-means. In: 2010 10th IEEE International Conference on Computer and Information Technology, IEEE Computer Society, Washington DC, USA, pp. 2478\u20132485 (2010)"},{"key":"188_CR18","unstructured":"Forum, M.P.: Mpi: A Message-passing Interface Standard. University of Tennessee, Knoxville, TN, USA, Technical Report (1994)"},{"issue":"4","key":"188_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s41060-017-0069-7","volume":"4","author":"F Fouedjio","year":"2017","unstructured":"Fouedjio, F.: A spectral clustering approach for multivariate geostatistical data. Int. J. Data Sci. Anal. 4(4), 301\u2013312 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"key":"188_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ins.2016.05.003","volume":"363","author":"M Gagolewski","year":"2016","unstructured":"Gagolewski, M., Bartoszuk, M., Cena, A.: Genie: a new, fast, and outlier-resistant hierarchical clustering algorithm. Inf. Sci. 363, 8\u201323 (2016)","journal-title":"Inf. Sci."},{"key":"188_CR21","unstructured":"Goil, S., Nagesh, H., Choudhary, A.: Efficient and scalable subspace clustering for very large data sets. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, USA, pp. 443\u2013452 (1999)"},{"key":"188_CR22","doi-asserted-by":"crossref","unstructured":"Goyal, P., Kumari, S., Sharma, S., Kishore, V., Goyal, N., Balasubramaniam, S.S.: Spatial locality aware, fast, and scalable slink algorithm for commodity clusters. In: 2016 IEEE International Conference on Cluster Computing (CLUSTER), IEEE Computer Society, Washington DC, USA, pp. 158\u2013159 (2016)","DOI":"10.1109\/CLUSTER.2016.84"},{"key":"188_CR23","doi-asserted-by":"crossref","unstructured":"Goyal, P., Kumari, S., Sharma, S., Kumar, D., Kishore, V., Balasubramaniam, S., Goyal, N.: A fast, scalable slink algorithm for commodity cluster computing exploiting spatial locality. In: 2016 IEEE 18th International Conference on High Performance Computing and Communications, IEEE Computer Society, Washington DC, USA, pp. 268\u2013275 (2016)","DOI":"10.1109\/CLUSTER.2016.84"},{"issue":"2","key":"188_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"key":"188_CR25","unstructured":"Hendrix, W., Ali\u00a0Patwary, M., Agrawal, A., Liao, W.K., Choudhary, A.: Parallel Hierarchical Clustering Code (2012). \nhttp:\/\/cucis.ece.northwestern.edu\/projects\/Clustering\/\n\n. Accessed 10 Aug 2017"},{"key":"188_CR26","doi-asserted-by":"crossref","unstructured":"Hendrix, W., Patwary, M.M.A., Agrawal, A., Liao, W., Choudhary, A.: Parallel hierarchical clustering on shared memory platforms. In: 2012 19th International Conference on High Performance Computing, IEEE Computer Society, Washington DC, USA, pp. 1\u20139 (2012)","DOI":"10.1109\/HiPC.2012.6507511"},{"key":"188_CR27","doi-asserted-by":"crossref","unstructured":"Hendrix, W., Palsetia, D., Patwary, M.M.A., Agrawal, A., Liao, W., Choudhary, A.: A scalable algorithm for single-linkage hierarchical clustering on distributed-memory architectures. In: 2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV), IEEE Computer Society, Washington DC, USA, pp. 7\u201313 (2013)","DOI":"10.1109\/LDAV.2013.6675153"},{"issue":"9","key":"188_CR28","doi-asserted-by":"publisher","first-page":"2534","DOI":"10.1109\/TPDS.2014.2355205","volume":"26","author":"Y Jeon","year":"2015","unstructured":"Jeon, Y., Yoon, S.: Multi-threaded hierarchical clustering by parallel nearest-neighbor chaining. IEEE Trans. Parallel Distrib. Syst. 26(9), 2534\u20132548 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"188_CR29","unstructured":"Jin, C., Patwary, M., Agarwal, A., Hendrix, W., Liao, W., Choudhary, A.: A distributed single-linkage hierarchical clustering algorithm using mapreduce. In: Proceedings of the 4th International SC Workshop on Data Intensive Computing in the Clouds, ACM, New York, USA, pp. 418\u2013426 (2013)"},{"key":"188_CR30","doi-asserted-by":"crossref","unstructured":"Jin, C., Chen, Z., Hendrix, W., Agrawal, A., Choudhary, A.: Incremental, distributed single-linkage hierarchical clustering algorithm using mapreduce. In: Proceedings of the Symposium on High Performance Computing, Society for Computer Simulation International, San Diego, CA, USA, HPC \u201915, pp. 83\u201392 (2015)","DOI":"10.1109\/BigDataService.2015.67"},{"key":"188_CR31","doi-asserted-by":"crossref","unstructured":"Jin, C., Liu, R., Chen, Z., Hendrix, W., Agrawal, A., Choudhary, A.: A scalable hierarchical clustering algorithm using spark. In: 2015 IEEE First International Conference on Big Data Computing Service and Applications, IEEE Computer Society, Washington DC, USA, pp. 418\u2013426 (2015)","DOI":"10.1109\/BigDataService.2015.67"},{"key":"188_CR32","doi-asserted-by":"crossref","unstructured":"Johnson, E.L., Kargupta, H.: Collective, hierarchical clustering from distributed, heterogeneous data. In: Revised Papers from Large-Scale Parallel Data Mining, SIGKDD, Springer-Verlag, Berlin, Heidelberg, Workshop on Large-Scale Parallel KDD Systems, pp. 221\u2013244 (2000)","DOI":"10.1007\/3-540-46502-2_12"},{"key":"188_CR33","doi-asserted-by":"crossref","unstructured":"Kaul, M., Yang, B., Jensen, C.S.: Building accurate 3d spatial networks to enable next generation intelligent transportation systems. In: 2013 IEEE 14th International Conference on Mobile Data Management, vol.\u00a01, pp. 137\u2013146 (2013)","DOI":"10.1109\/MDM.2013.24"},{"issue":"1","key":"188_CR34","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J Kruskal","year":"1956","unstructured":"Kruskal, J.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"188_CR35","doi-asserted-by":"crossref","unstructured":"Kumari, S., Maurya, S., Goyal, P., Balasubramaniam, S.S., Goyal, N.: Scalable parallel algorithms for shared nearest neighbor clustering. In: 2016 IEEE 23rd International Conference on High Performance Computing (HiPC), pp. 72\u201381 (2016)","DOI":"10.1109\/HiPC.2016.018"},{"issue":"2","key":"188_CR36","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s41060-017-0062-1","volume":"4","author":"H Kurban","year":"2017","unstructured":"Kurban, H., Jenne, M., Dalkilic, M.M.: Using data to build a better em: Em* for big data. Int. J. Data Sci. Anal. 4(2), 83\u201397 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"11","key":"188_CR37","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/34.61708","volume":"12","author":"X Li","year":"1990","unstructured":"Li, X.: Parallel algorithms for hierarchical clustering and cluster validity. IEEE Trans. Pattern Anal. Mach. Intell. 12(11), 1088\u20131092 (1990)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"188_CR38","unstructured":"Liao, W.K., Ying, L., Choudhary, A.: A grid-based clustering algorithm using adaptive mesh refinement. In: Proceedings of the 7th Workshop on Mining Scientific and Engineering Data Sets, pp. 1\u20139 (2004)"},{"key":"188_CR39","unstructured":"Mazzeo, G.M., Zaniolo, C.: The parallelization of a complex hierarchical clustering algorithm: faster unsupervised learning on larger data sets. University of California, Los Angeles, Technical Report (2016)"},{"key":"188_CR40","volume-title":"Multidimensional Clustering Algorithms","author":"F Murt\u00e1gh","year":"1985","unstructured":"Murt\u00e1gh, F.: Multidimensional Clustering Algorithms. Physica-Verlag, Heidelberg (1985)"},{"issue":"2","key":"188_CR41","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TCBB.2007.70272","volume":"6","author":"V Olman","year":"2009","unstructured":"Olman, V., Mao, F., Wu, H., Xu, Y.: Parallel clustering algorithm for large data sets with applications in bioinformatics. IEEE\/ACM Trans. Comput. Biol. Bioinform. 6(2), 344\u2013352 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"8","key":"188_CR42","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"CF Olson","year":"1995","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. 21(8), 1313\u20131325 (1995)","journal-title":"Parallel Comput."},{"key":"188_CR43","doi-asserted-by":"crossref","unstructured":"Patwary, M.A., Palsetia, D., Agrawal, A., Liao, W.k., Manne, F., Choudhary, A.: A new scalable parallel dbscan algorithm using the disjoint-set data structure. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, IEEE Computer Society Press, Los Alamitos, CA, USA, SC \u201912, pp. 62:1\u201362:11 (2012)","DOI":"10.1109\/SC.2012.9"},{"key":"188_CR44","doi-asserted-by":"crossref","unstructured":"Patwary, M.M.A., Blair, J., Manne, F.: Experiments on union-find algorithms for the disjoint-set data structure. In: Proceedings of the 9th International Conference on Experimental Algorithms, Springer, Berlin, Heidelberg, SEA\u201910, pp. 411\u2013423 (2010)","DOI":"10.1007\/978-3-642-13193-6_35"},{"key":"188_CR45","doi-asserted-by":"crossref","unstructured":"Patwary, M.M.A., Byna, S., Satish, N.R., Sundaram, N., Luki\u0107, Z., Roytershteyn, V., Anderson, M.J., Yao, Y., Prabhat, Dubey P.: Bd-cats: big data clustering at trillion particle scale. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ACM, New York, NY, USA, SC \u201915, pp. 6:1\u20136:12 (2015)","DOI":"10.1145\/2807591.2807616"},{"issue":"6","key":"188_CR46","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"6","key":"188_CR47","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TPDS.2005.72","volume":"16","author":"S Rajasekaran","year":"2005","unstructured":"Rajasekaran, S.: Efficient parallel hierarchical clustering algorithms. IEEE Trans. Parallel Distrib. Syst. 16(6), 497\u2013502 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"188_CR48","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: Slink: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"key":"188_CR49","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1038\/nature03597","volume":"435","author":"V Springel","year":"2005","unstructured":"Springel, V., White, S.D.M., Jenkins, A., Frenk, C.S., Yoshida, N., Gao, L., Navarro, J., Thacker, R., Croton, D., Helly, J., Peacock, J.A., Cole, S., Thomas, P., Couchman, H., Evrard, A., Colberg, J., Pearce, F.: Simulations of the formation, evolution and clustering of galaxies and quasars. Nature 435, 629\u2013636 (2005)","journal-title":"Nature"},{"key":"188_CR50","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2005)","edition":"1"},{"key":"188_CR51","first-page":"1","volume":"2018","author":"D Teffer","year":"2018","unstructured":"Teffer, D., Srinivasan, R., Ghosh, J.: Adahash: hashing-based scalable, adaptive hierarchical clustering of streaming data on mapreduce frameworks. Int. J. Data Sci. Anal. 2018, 1\u201311 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"9","key":"188_CR52","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1006\/jpdc.2000.1644","volume":"60","author":"CH Wu","year":"2000","unstructured":"Wu, C.H., Horng, S.J., Tsai, H.R.: Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses. J. Parallel Distrib. Comput. 60(9), 1137\u20131153 (2000)","journal-title":"J. Parallel Distrib. Comput."},{"key":"188_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810114","volume-title":"Data Mining and Analysis: Fundamental Concepts and Algorithms","author":"MJ Zaki Jr","year":"2014","unstructured":"Zaki Jr., M.J., Meira, W., Meira, W.: Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press, New York (2014)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-019-00188-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00188-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T23:11:49Z","timestamp":1591744309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-019-00188-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["188"],"URL":"https:\/\/doi.org\/10.1007\/s41060-019-00188-y","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"29 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}