{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T08:26:53Z","timestamp":1717057613125},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s13278-021-00836-x","type":"journal-article","created":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T03:02:31Z","timestamp":1636426951000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["CS- and GA-based hybrid evolutionary sampling algorithm for large-scale social networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Seyed Mohsen","family":"Ebadi Jokandan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peyman","family":"Bayat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Farrokhbakht Foumani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"836_CR1","doi-asserted-by":"publisher","first-page":"120966","DOI":"10.1016\/j.physa.2019.04.202","volume":"526","author":"J Yuan","year":"2019","unstructured":"Yuan J, Zhang R, Tang J, Hu R, Wang Z, Li H (2019) Efficient and effective influence maximization in large-scale social networks via two frameworks. Physica A Stat Mech Appl 526:120966","journal-title":"Physica A Stat Mech Appl"},{"key":"836_CR2","unstructured":"Twitter: Fiscal Year 2019 Annual Report. https:\/\/www.annualreports.com\/HostedData\/AnnualReportArchive\/t\/NYSE_TWTR_2019.pdf. Accessed 13 Oct 2021"},{"key":"836_CR3","unstructured":"Facebook Q4 2018 Results. https:\/\/s21.q4cdn.com\/399680738\/files\/doc_financials\/2018\/Q4\/Q4-2018-Earnings-Presentation.pdf. Accessed 13 Oct 2021"},{"key":"836_CR4","unstructured":"Sina Weibo: Q4 and Annual Financial Report. https:\/\/weibocorporation.gcs-web.com\/news-releases\/news-release-details\/weibo-reports-fourth-quarter-and-fiscal-year-2019-unaudited. Accessed 13 Oct 2021"},{"key":"836_CR5","doi-asserted-by":"crossref","unstructured":"Wang T, Chen Y, Zhang Z, Xu T, Jin L, Hui P, Li X (2011) Understanding graph sampling algorithms for social network analysis. In: 2011 31st international conference on distributed computing systems workshops, pp 123\u2013128. IEEE.","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"836_CR6","doi-asserted-by":"crossref","unstructured":"Eirinaki M, Gao J, Varlamis I, Tserpes K (2018) Recommender systems for large-scale social networks: a review of challenges and solutions","DOI":"10.1016\/j.future.2017.09.015"},{"issue":"3","key":"836_CR7","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TKDE.2011.254","volume":"25","author":"M Papagelis","year":"2011","unstructured":"Papagelis M, Das G, Koudas N (2011) Sampling online social networks. IEEE Trans Knowl Data Eng 25(3):662\u2013676","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"836_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1109\/JSAC.2013.130604","volume":"31","author":"F Murai","year":"2013","unstructured":"Murai F, Ribeiro B, Towsley D, Wang P (2013) On set size distribution estimation and the characterization of large networks via sampling. IEEE J Sel Areas Commun 31(6):1017\u20131025","journal-title":"IEEE J Sel Areas Commun"},{"key":"836_CR9","doi-asserted-by":"crossref","unstructured":"Jalali ZS, Rezvanian A, Meybodi MR (2015) A two-phase sampling algorithm for social networks. In: 2015 2nd international conference on knowledge-based engineering and innovation (KBEI), pp 1165\u20131169. IEEE.","DOI":"10.1109\/KBEI.2015.7436212"},{"issue":"5","key":"836_CR10","doi-asserted-by":"publisher","first-page":"e3091","DOI":"10.1002\/dac.3091","volume":"30","author":"A Rezvanian","year":"2017","unstructured":"Rezvanian A, Meybodi MR (2017a) A new learning automata-based sampling algorithm for social networks. Int J Commun Syst 30(5):e3091","journal-title":"Int J Commun Syst"},{"key":"836_CR11","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"issue":"12","key":"836_CR12","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"836_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ins.2019.10.076","volume":"513","author":"J Zhu","year":"2020","unstructured":"Zhu J, Chen B, Zeng Y (2020) Community detection based on modularity and k-plexes. Inf Sci 513:127\u2013142","journal-title":"Inf Sci"},{"key":"836_CR14","doi-asserted-by":"publisher","first-page":"124100","DOI":"10.1016\/j.physa.2019.124100","volume":"551","author":"MA Nedioui","year":"2020","unstructured":"Nedioui MA, Moussaoui A, Saoud B, Babahenini MC (2020) Detecting communities in social networks based on cliques. Physica A Stat Mech Appl 551:124100","journal-title":"Physica A Stat Mech Appl"},{"issue":"20","key":"836_CR15","doi-asserted-by":"publisher","first-page":"5231","DOI":"10.1016\/j.physa.2013.06.056","volume":"392","author":"R Badie","year":"2013","unstructured":"Badie R, Aleahmad A, Asadpour M, Rahgozar M (2013) An efficient agent-based algorithm for overlapping community detection using nodes\u2019 closeness. Physica A 392(20):5231\u20135247","journal-title":"Physica A"},{"key":"836_CR16","doi-asserted-by":"crossref","unstructured":"Bhatia V, Rani R (2017) An efficient algorithm for sampling of a single large graph. In: 2017 tenth international conference on contemporary computing (IC3), pp 1\u20136. IEEE","DOI":"10.1109\/IC3.2017.8284290"},{"issue":"3","key":"836_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"issue":"1","key":"836_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"key":"836_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.knosys.2017.04.012","volume":"127","author":"A Rezvanian","year":"2017","unstructured":"Rezvanian A, Meybodi MR (2017b) Sampling algorithms for stochastic graphs: a learning automata approach. Knowl-Based Syst 127:126\u2013144","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"836_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0441-6","volume":"7","author":"N Salamanos","year":"2017","unstructured":"Salamanos N, Voudigari E, Yannakoudakis EJ (2017) Deterministic graph exploration for efficient graph sampling. Soc Netw Anal Min 7(1):1\u201314","journal-title":"Soc Netw Anal Min"},{"key":"836_CR21","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Berchmans F, Neville J, Kompella R (2010) Time-based sampling of social network activity graphs. In: Proceedings of the eighth workshop on mining and learning with graphs, pp 1\u20139","DOI":"10.1145\/1830252.1830253"},{"key":"836_CR22","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Neville J, Kompella R (2012) Space-efficient sampling from social activity streams. In: Proceedings of the 1st international workshop on big data, streams and heterogeneous source mining: algorithms, systems, programming models and applications, pp 53\u201360","DOI":"10.1145\/2351316.2351324"},{"key":"836_CR23","doi-asserted-by":"crossref","unstructured":"Kurant M, Gjoka M, Butts CT, Markopoulou A (2011) Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. In: Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, pp 281\u2013292","DOI":"10.1145\/1993744.1993773"},{"issue":"12","key":"836_CR24","doi-asserted-by":"publisher","first-page":"4221","DOI":"10.1073\/pnas.0501179102","volume":"102","author":"MP Stumpf","year":"2005","unstructured":"Stumpf MP, Wiuf C, May RM (2005) Subnets of scale-free networks are not scale-free: sampling properties of networks. Proc Natl Acad Sci 102(12):4221\u20134224","journal-title":"Proc Natl Acad Sci"},{"key":"836_CR25","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Stanford InfoLab"},{"key":"836_CR26","doi-asserted-by":"crossref","unstructured":"Kurant M, Markopoulou A, Thiran P (2010) On the bias of bfs (breadth first search). In: 2010 22nd international teletraffic congress (lTC 22), pp 1\u20138. IEEE.","DOI":"10.1109\/ITC.2010.5608727"},{"key":"836_CR27","doi-asserted-by":"publisher","first-page":"77106","DOI":"10.1109\/ACCESS.2020.2989504","volume":"8","author":"G Cai","year":"2020","unstructured":"Cai G, Lu G, Guo J, Ling C, Li R (2020) Fast representative sampling in large-scale online social networks. IEEE Access 8:77106\u201377119","journal-title":"IEEE Access"},{"issue":"1\u201346","key":"836_CR28","first-page":"4","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Random walks on graphs. Combinatorics, Paul Erdos is Eighty 2(1\u201346):4","journal-title":"Combinatorics, Paul Erdos is Eighty"},{"key":"836_CR29","unstructured":"Gjoka M, Kurant M, Butts CT, Markopoulou A (2009) A walk in facebook: uniform sampling of users in online social networks. arXiv preprint arXiv:0906.0060."},{"issue":"3","key":"836_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.peva.2005.01.002","volume":"63","author":"C Gkantsidis","year":"2006","unstructured":"Gkantsidis C, Mihail M, Saberi A (2006) Random walks in peer-to-peer networks: algorithms and evaluation. Perform Eval 63(3):241\u2013263","journal-title":"Perform Eval"},{"issue":"2","key":"836_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TNET.2008.2001730","volume":"17","author":"D Stutzbach","year":"2008","unstructured":"Stutzbach D, Rejaie R, Duffield N, Sen S, Willinger W (2008) On unbiased sampling for unstructured peer-to-peer networks. IEEE\/ACM Trans Networking 17(2):377\u2013390","journal-title":"IEEE\/ACM Trans Networking"},{"key":"836_CR32","unstructured":"Rasti AH, Torkjazi M, Rejaie R, Stutzbach D, Duffield N, Willinger W (2008) Evaluating sampling techniques for large dynamic graphs. University Oregon, Technical Report CIS-TR-08, p 1"},{"issue":"1\u20136","key":"836_CR33","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S1389-1286(00)00055-4","volume":"33","author":"MR Henzinger","year":"2000","unstructured":"Henzinger MR, Heydon A, Mitzenmacher M, Najork M (2000) On near-uniform URL sampling. Comput Netw 33(1\u20136):295\u2013308","journal-title":"Comput Netw"},{"key":"836_CR34","doi-asserted-by":"crossref","unstructured":"Li RH, Yu JX, Qin L, Mao R, Jin T (2015) On random walk based graph sampling. In: 2015 IEEE 31st international conference on data engineering, pp 927\u2013938. IEEE","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"836_CR35","doi-asserted-by":"crossref","unstructured":"Rasti AH, Torkjazi M, Rejaie R, Duffield N, Willinger W, Stutzbach D (2009) Respondent-driven sampling for characterizing unstructured overlays. In: IEEE INFOCOM 2009, pp 2701\u20132705. IEEE","DOI":"10.1109\/INFCOM.2009.5062215"},{"issue":"6","key":"836_CR36","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"key":"836_CR37","doi-asserted-by":"crossref","unstructured":"Gilks WR, Richardson S, Spiegelhalter D (Eds.) (1995) Markov chain Monte Carlo in practice. CRC press","DOI":"10.1201\/b14835"},{"issue":"1","key":"836_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0487-0","volume":"8","author":"P Wijegunawardana","year":"2018","unstructured":"Wijegunawardana P, Ojha V, Gera R, Soundarajan S (2018) Sampling dark networks to locate people of interest. Soc Netw Anal Min 8(1):1\u201327","journal-title":"Soc Netw Anal Min"},{"key":"836_CR39","doi-asserted-by":"crossref","unstructured":"Krishnamurthy B, Gill P, Arlitt M (2008) A few chirps about twitter. In: Proceedings of the first workshop on Online social networks, pp 19\u201324","DOI":"10.1145\/1397735.1397741"},{"issue":"1","key":"836_CR40","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/2318857.2254795","volume":"40","author":"CH Lee","year":"2012","unstructured":"Lee CH, Xu X, Eun DY (2012) Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. ACM Sigmetr Performance Eval Rev 40(1):319\u2013330","journal-title":"ACM Sigmetr Performance Eval Rev"},{"key":"836_CR41","doi-asserted-by":"crossref","unstructured":"Lu J, Li D (2012) Sampling online social networks by random walk. In: Proceedings of the First ACM international workshop on hot topics on interdisciplinary social networks research, pp 33\u201340","DOI":"10.1145\/2392622.2392628"},{"issue":"9","key":"836_CR42","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/JSAC.2011.111005","volume":"29","author":"M Kurant","year":"2011","unstructured":"Kurant M, Markopoulou A, Thiran P (2011b) Towards unbiased BFS sampling. IEEE J Sel Areas Commun 29(9):1799\u20131809","journal-title":"IEEE J Sel Areas Commun"},{"key":"836_CR43","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"836_CR44","unstructured":"Aggarwal CC (2006) On biased reservoir sampling in the presence of stream evolution. In: Proceedings of the 32nd international conference on Very large data bases, pp 607\u2013618"},{"key":"836_CR45","doi-asserted-by":"crossref","unstructured":"Frank O (2011) Survey sampling in networks. The Sage handbook of social network analysis, pp 389\u2013403","DOI":"10.4135\/9781446294413.n26"},{"key":"836_CR46","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"key":"836_CR47","doi-asserted-by":"crossref","unstructured":"Ahn YY, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on World Wide Web, pp 835\u2013844","DOI":"10.1145\/1242572.1242685"},{"key":"836_CR48","doi-asserted-by":"crossref","unstructured":"Wilson C, Boe B, Sala A, Puttaswamy KP, Zhao BY (2009) User interactions in social networks and their implications. In: Proceedings of the 4th ACM European conference on computer systems, pp 205\u2013218","DOI":"10.1145\/1519065.1519089"},{"issue":"4","key":"836_CR49","doi-asserted-by":"publisher","first-page":"046114","DOI":"10.1103\/PhysRevE.75.046114","volume":"75","author":"S Yoon","year":"2007","unstructured":"Yoon S, Lee S, Yook SH, Kim Y (2007) Statistical properties of sampled networks by random walks. Phys Rev E 75(4):046114","journal-title":"Phys Rev E"},{"key":"836_CR50","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.knosys.2017.06.034","volume":"143","author":"M Ghavipour","year":"2018","unstructured":"Ghavipour M, Meybodi MR (2018) Trust propagation algorithm based on learning automata for inferring local trust in online social networks. Knowl-Based Syst 143:307\u2013316","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"836_CR51","doi-asserted-by":"publisher","first-page":"016102","DOI":"10.1103\/PhysRevE.73.016102","volume":"73","author":"SH Lee","year":"2006","unstructured":"Lee SH, Kim PJ, Jeong H (2006) Statistical properties of sampled networks. Phys Rev E 73(1):016102","journal-title":"Phys Rev E"},{"key":"836_CR52","unstructured":"Becchetti L, Castillo C, Donato D, Fazzone A, Rome I (2006) A comparison of sampling techniques for web graph characterization. In: Proceedings of the workshop on link analysis (LinkKDD\u201906), Philadelphia, PA"},{"issue":"5","key":"836_CR53","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/41.538609","volume":"43","author":"KF Man","year":"1996","unstructured":"Man KF, Tang KS, Kwong S (1996) Genetic algorithms: concepts and applications [in engineering design]. IEEE Trans Industr Electron 43(5):519\u2013534","journal-title":"IEEE Trans Industr Electron"},{"key":"836_CR54","doi-asserted-by":"crossref","unstructured":"Ghodrati A, Lotfi S (2012) A hybrid CS\/GA algorithm for global optimization. In: Proceedings of the international conference on soft computing for problem solving (SocProS 2011) December 20\u201322, 2011, pp 397\u2013404. Springer, India","DOI":"10.1007\/978-81-322-0487-9_38"},{"issue":"1","key":"836_CR55","doi-asserted-by":"publisher","first-page":"5-es","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web 1(1):5-es","journal-title":"ACM Trans Web"},{"key":"836_CR56","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World wide web, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"836_CR57","unstructured":"McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS, Vol 2012, pp 548\u201356"},{"issue":"2","key":"836_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2013","unstructured":"Ahmed NK, Neville J, Kompella R (2013) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data 8(2):1\u201356","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"05","key":"836_CR59","doi-asserted-by":"publisher","first-page":"1650052","DOI":"10.1142\/S0129183116500522","volume":"27","author":"ZS Jalali","year":"2016","unstructured":"Jalali ZS, Rezvanian A, Meybodi MR (2016) Social network sampling using spanning trees. Int J Mod Phys C 27(05):1650052","journal-title":"Int J Mod Phys C"},{"issue":"1","key":"836_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0371-8","volume":"6","author":"A Rezvanian","year":"2016","unstructured":"Rezvanian A, Meybodi MR (2016) Sampling algorithms for weighted networks. Soc Netw Anal Min 6(1):1\u201322","journal-title":"Soc Netw Anal Min"},{"issue":"5","key":"836_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411514","volume":"55","author":"Z Bar-Yossef","year":"2008","unstructured":"Bar-Yossef Z, Gurevich M (2008) Random sampling from a search engine\u2019s index. Journal of the ACM (JACM) 55(5):1\u201374","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"836_CR62","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392","journal-title":"Ann Math Stat"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00836-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00836-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00836-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T14:41:53Z","timestamp":1637419313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00836-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,9]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["836"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00836-x","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,9]]},"assertion":[{"value":"12 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"120"}}