{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:43:35Z","timestamp":1777941815755,"version":"3.51.4"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","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,3]]},"DOI":"10.1007\/s10489-017-0987-z","type":"journal-article","created":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T01:31:30Z","timestamp":1500600690000},"page":"570-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["Minimum positive influence dominating set and its application in influence maximization: a learning automata approach"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6882-5784","authenticated-orcid":false,"given":"Mohammad Mehdi","family":"Daliri Khomami","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Rezvanian","sequence":"additional","affiliation":[]},{"given":"Negin","family":"Bagherpour","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Meybodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"987_CR1","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"987_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486:75\u2013174","journal-title":"Phys Rep"},{"key":"987_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"987_CR4","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"987_CR5","doi-asserted-by":"crossref","unstructured":"Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. In: Combinatorial optimization and applications, pp 313\u2013321","DOI":"10.1007\/978-3-642-02026-1_29"},{"key":"987_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"Wang F, Du H, Camacho E et al (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412:265\u2013269","journal-title":"Theor Comput Sci"},{"key":"987_CR7","doi-asserted-by":"crossref","unstructured":"Raei H, Yazdani N, Asadpour M (2012) A new algorithm for positive influence dominating set in social networks. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012). IEEE, pp 253257","DOI":"10.1109\/ASONAM.2012.51"},{"key":"987_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s13278-011-0033-9","volume":"2","author":"W Zhang","year":"2012","unstructured":"Zhang W, Wu W, Wang F, Xu K (2012) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2:31\u201337","journal-title":"Soc Netw Anal Min"},{"key":"987_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27:487\u2013503","journal-title":"J Comb Optim"},{"key":"987_CR10","doi-asserted-by":"crossref","unstructured":"Wang G, Wang H, Tao X, Zhang J (2014) Finding weighted positive influence dominating set to make impact to negatives: a study on online social networks in the new millennium. In: ICTs and the millennium development goals. Springer, pp 67\u201380","DOI":"10.1007\/978-1-4899-7439-6_5"},{"key":"987_CR11","unstructured":"Java A, Kolari P, Finin T, Oates T (2006) Modeling the spread of influence on the blogosphere. In: Proceedings of the 15th international world wide web conference, pp 22\u201326"},{"key":"987_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/s10618-009-0150-5","volume":"20","author":"M Kimura","year":"2010","unstructured":"Kimura M, Saito K, Nakano R, Motoda H (2010) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Disc 20:70\u201397","journal-title":"Data Min Knowl Disc"},{"key":"987_CR13","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"987_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"987_CR15","doi-asserted-by":"crossref","first-page":"1904","DOI":"10.1109\/TKDE.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu B, Cong G, Zeng Y et al (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26:1904\u20131917","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"987_CR16","first-page":"1","volume":"4","author":"W Xu","year":"2014","unstructured":"Xu W, Lu Z, Wu W, Chen Z (2014) A novel approach to online social influence maximization. Soc Netw Anal Min 4:1\u201313","journal-title":"Soc Netw Anal Min"},{"key":"987_CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"J-R Lee","year":"2015","unstructured":"Lee J-R, Chung C-W (2015) A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27:340\u2013353","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"987_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30:107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"987_CR19","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46:604\u2013632","journal-title":"J ACM (JACM)"},{"key":"987_CR20","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","volume":"7","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Zhou T, Zhang Q-M, Stanley HE (2016) The H-index of a network node and its relation to degree and coreness. Nat Commun 7:10168","journal-title":"Nat Commun"},{"key":"987_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C et al (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"987_CR22","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf + +: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"987_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0165-4896(88)90041-8","volume":"16","author":"LL Kelleher","year":"1988","unstructured":"Kelleher LL, Cozzens MB (1988) Dominating sets in social network graphs. Math Soc Sci 16:267\u2013279","journal-title":"Math Soc Sci"},{"key":"987_CR24","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1038\/srep01736","volume":"3","author":"F Moln\u00e1r","year":"2013","unstructured":"Moln\u00e1r F, Sreenivasan S, Szymanski BK, Korniss G (2013) Minimum dominating sets in scale-free network ensembles. Sci Rep 3:1736","journal-title":"Sci Rep"},{"key":"987_CR25","doi-asserted-by":"crossref","unstructured":"Basuchowdhuri P, Majumder S (2014) Finding influential nodes in social networks using minimum k-hop dominating set. In: International conference on applied algorithms. Springer, pp 137\u2013 151","DOI":"10.1007\/978-3-319-04126-1_12"},{"key":"987_CR26","doi-asserted-by":"crossref","unstructured":"Kim D, Li D, Asgari O et al (2013) A dominating set based approach to identify effective leader group of social network. In: International computing and combinatorics conference. Springer, pp 841\u2013848","DOI":"10.1007\/978-3-642-38768-5_77"},{"key":"987_CR27","doi-asserted-by":"crossref","unstructured":"Kant\u00e9 MM, Limouzy V, Mary A, Nourine L (2011) Enumeration of minimal dominating sets and variants. In: International symposium on fundamentals of computation theory. Springer, pp 298\u2013309","DOI":"10.1007\/978-3-642-22953-4_26"},{"key":"987_CR28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2012.02.057","volume":"200","author":"JA Torkestani","year":"2012","unstructured":"Torkestani JA, Meybodi MR (2012) Finding minimum weight connected dominating set in stochastic graph based on learning automata. Inform Sci 200:57\u201377","journal-title":"Inform Sci"},{"key":"987_CR29","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233\u2013235","journal-title":"Math Oper Res"},{"key":"987_CR30","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"987_CR31","doi-asserted-by":"crossref","unstructured":"Slav\u00edk P (1996) A tight analysis of the greedy algorithm for set cover. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing. ACM, pp 435\u2013441","DOI":"10.1145\/237814.237991"},{"key":"987_CR32","unstructured":"Nieberg T, Hurink J (2005) A PTAS for the minimum dominating set problem in unit disk graphs. In: International workshop on approximation and online algorithms. Springer, pp 296\u2013306"},{"key":"987_CR33","doi-asserted-by":"crossref","unstructured":"Nacher JC, Akutsu T (2013) Analysis on critical nodes in controlling complex networks using dominating sets. In: 2013 International conference on signal-image technology & internet-based systems (SITIS). IEEE, pp 649\u2013654","DOI":"10.1109\/SITIS.2013.106"},{"key":"987_CR34","unstructured":"Narendra KS, Thathachar MA (1989) Learning automata: an introduction. Prentice-Hall"},{"key":"987_CR35","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1007\/s00138-016-0788-0","volume":"27","author":"B Damerchilu","year":"2016","unstructured":"Damerchilu B, Norouzzadeh MS, Meybodi MR (2016) Motion estimation using learning automata. Mach Vis Appl 27:1047\u20131061","journal-title":"Mach Vis Appl"},{"key":"987_CR36","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1016\/j.aeue.2015.05.010","volume":"69","author":"MH Mofrad","year":"2015","unstructured":"Mofrad MH, Sadeghi S, Rezvanian A, Meybodi MR (2015) Cellular edge detection: combining cellular automata and cellular learning automata. AEU-Int J Electron Commun 69:1282\u20131290","journal-title":"AEU-Int J Electron Commun"},{"key":"987_CR37","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1080\/01969722.2015.1082407","volume":"46","author":"A Rezvanian","year":"2015","unstructured":"Rezvanian A, Meybodi MR (2015) Finding minimum vertex covering in stochastic graphs: a learning automata approach. Cybern Syst 46:698\u2013727","journal-title":"Cybern Syst"},{"key":"987_CR38","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1007\/s10489-014-0585-2","volume":"41","author":"JK Kordestani","year":"2014","unstructured":"Kordestani JK, Ahmadi A, Meybodi MR (2014) An improved differential evolution algorithm using learning automata and population topologies. Appl Intell 41:1150\u20131169","journal-title":"Appl Intell"},{"key":"987_CR39","doi-asserted-by":"crossref","first-page":"1550023","DOI":"10.1142\/S0218213015500232","volume":"24","author":"M Mahdaviani","year":"2015","unstructured":"Mahdaviani M, Kordestani JK, Rezvanian A, Meybodi MR (2015) LADE: learning automata based differential evolution. Int J Artif Intell Tools 24:1550023","journal-title":"Int J Artif Intell Tools"},{"key":"987_CR40","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1007\/s10489-014-0577-2","volume":"41","author":"MRM Meybodi","year":"2014","unstructured":"Meybodi MRM, Meybodi MR (2014) Extended distributed learning automata. Appl Intell 41:923\u2013940","journal-title":"Appl Intell"},{"key":"987_CR41","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.chb.2016.07.032","volume":"64","author":"A Rezvanian","year":"2016","unstructured":"Rezvanian A, Meybodi MR (2016) Stochastic graph as a model for social networks. Comput Hum Behav 64:621\u2013640","journal-title":"Comput Hum Behav"},{"key":"987_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218488515500014","volume":"23","author":"A Rezvanian","year":"2015","unstructured":"Rezvanian A, Meybodi MR (2015) Finding maximum clique in stochastic graphs using distributed learning automata. Int J Uncerty Fuzz Knowl-Based Syst 23:1\u201331","journal-title":"Int J Uncerty Fuzz Knowl-Based Syst"},{"key":"987_CR43","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1007\/s11276-012-0511-7","volume":"19","author":"M Esnaashari","year":"2013","unstructured":"Esnaashari M, Meybodi MR (2013) Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach. Wirel Netw 19:945\u2013968","journal-title":"Wirel Netw"},{"key":"987_CR44","doi-asserted-by":"crossref","unstructured":"Elyasi M, Meybodi M, Rezvanian A, Haeri MA (2016) A fast algorithm for overlapping community detection. In: 2016 Eighth International conference on information and knowledge technology (IKT), pp 221\u2013226","DOI":"10.1109\/IKT.2016.7777771"},{"key":"987_CR45","doi-asserted-by":"crossref","first-page":"1650042","DOI":"10.1142\/S0217979216500429","volume":"30","author":"MMD Khomami","year":"2016","unstructured":"Khomami MMD, Rezvanian A, Meybodi MR (2016) Distributed learning automata-based algorithm for community detection in complex networks. Int J Modern Phys B 30:1650042","journal-title":"Int J Modern Phys B"},{"key":"987_CR46","doi-asserted-by":"crossref","first-page":"e3091","DOI":"10.1002\/dac.3091","volume":"30","author":"A Rezvanian","year":"2017","unstructured":"Rezvanian A, Meybodi MR (2017) A new learning automata-based sampling algorithm for social networks. Int J Commun Syst 30:e3091","journal-title":"Int J Commun Syst"},{"key":"987_CR47","doi-asserted-by":"crossref","unstructured":"Rezvanian A, Meybodi MR (2017) Sampling algorithms for stochastic graphs: a learning automata approach. Knowl-Based Syst in-press:1\u201319","DOI":"10.1016\/j.knosys.2017.04.012"},{"key":"987_CR48","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.future.2015.08.012","volume":"55","author":"MH Mofrad","year":"2016","unstructured":"Mofrad MH, Jalilian O, Rezvanian A, Meybodi MR (2016) Service level agreement based adaptive grid superscheduling. Futur Gener Comput Syst 55:62\u201373","journal-title":"Futur Gener Comput Syst"},{"key":"987_CR49","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TCC.2014.2305151","volume":"2","author":"H Morshedlou","year":"2014","unstructured":"Morshedlou H, Meybodi MR (2014) Decreasing impact of SLA violations: a proactive resource allocation approach for cloud computing environments. IEEE Trans Cloud Comput 2:156\u2013167","journal-title":"IEEE Trans Cloud Comput"},{"key":"987_CR50","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/s10489-016-0831-x","volume":"46","author":"SM Vahidipour","year":"2017","unstructured":"Vahidipour SM, Meybodi MR, Esnaashari M (2017) Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem. Appl Intell 46:272\u2013284","journal-title":"Appl Intell"},{"key":"987_CR51","doi-asserted-by":"crossref","first-page":"8105","DOI":"10.1016\/j.eswa.2010.12.152","volume":"38","author":"B Masoumi","year":"2011","unstructured":"Masoumi B, Meybodi MR (2011) Speeding up learning automata based multi agent systems using the concepts of stigmergy and entropy. Expert Syst Appl 38:8105\u20138118","journal-title":"Expert Syst Appl"},{"key":"987_CR52","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25:163\u2013177","journal-title":"J Math Sociol"},{"key":"987_CR53","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman LC (1979) Centrality in social networks conceptual clarification. Soc Netw 1:215\u2013239","journal-title":"Soc Netw"},{"key":"987_CR54","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.jnca.2011.03.026","volume":"34","author":"JA Torkestani","year":"2011","unstructured":"Torkestani JA, Meybodi MR (2011) A link stability-based multicast routing protocol for wireless mobile ad hoc networks. J Netw Comput Appl 34:1429\u20131440","journal-title":"J Netw Comput Appl"},{"key":"987_CR55","first-page":"756","volume":"6","author":"S Lakshmivarahan","year":"1976","unstructured":"Lakshmivarahan S, Thathachar MAL (1976) Bounds on the convergence probabilities of learning automata. IEEE Trans Syst Man Cybern-Part A: Syst Humans 6:756\u2013763","journal-title":"IEEE Trans Syst Man Cybern-Part A: Syst Humans"},{"key":"987_CR56","doi-asserted-by":"crossref","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 452\u2013473","DOI":"10.1086\/jar.33.4.3629752"},{"key":"987_CR57","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"987_CR58","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, et al. (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"987_CR59","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6:565\u2013573","journal-title":"Adv Complex Syst"},{"key":"987_CR60","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.physleta.2013.02.039","volume":"377","author":"A Zeng","year":"2013","unstructured":"Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377:1031\u20131035","journal-title":"Phys Lett A"},{"key":"987_CR61","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.physa.2016.02.053","volume":"452","author":"S Yeruva","year":"2016","unstructured":"Yeruva S, Devi T, Reddy YS (2016) Selection of influential spreaders in complex networks using Pareto Shell decomposition. Physica A: Stat Mech Appl 452:133\u2013144","journal-title":"Physica A: Stat Mech Appl"},{"key":"987_CR62","doi-asserted-by":"crossref","unstructured":"Toothaker LE (1993) Multiple comparison procedures. Sage","DOI":"10.4135\/9781412985178"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0987-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0987-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0987-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T02:36:47Z","timestamp":1569897407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0987-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["987"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0987-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}