{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:02:18Z","timestamp":1743012138679,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_14","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"167-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Parameters for Balanced Index Influence Maximization"],"prefix":"10.1007","author":[{"given":"Manqing","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyorgy","family":"Korniss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boleslaw K.","family":"Szymanski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: 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 (2003)","DOI":"10.1145\/956750.956769"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u201397. IEEE (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos. , \u00c9.: Influential nodes in a diffusion model for social networks. In: International Colloquium on Automata, Languages, and Programming, pp. 1127\u20131138. Springer (2005)","DOI":"10.1007\/11523468_91"},{"issue":"11","key":"14_CR4","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"issue":"7563","key":"14_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 524(7563), 65\u201368 (2015)","journal-title":"Nature"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"45240","DOI":"10.1038\/srep45240","volume":"7","author":"S Pei","year":"2017","unstructured":"Pei, S., Teng, X., Shaman, J., Morone, F., Makse, H.A.: Efficient collective influence maximization in cascading processes with first-order transitions. Sci. Rep. 7, 45240 (2017)","journal-title":"Sci. Rep."},{"key":"14_CR7","unstructured":"Karsai, M., I\u00f1iguez, G., Kikas, R., Kaski, K., Kert\u00e9sz, J.: Local cascades induced global contagion: How heterogeneous thresholds, exogenous effects, and unconcerned behaviour govern online adoption spreading. Sci. Rep. 6(1), (2010)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Unicomb, S., I\u00f1iguez, G., Karsai, M.: Threshold driven contagion on weighted networks. Sci. Rep. 8(1), (2018)","DOI":"10.1038\/s41598-018-21261-9"},{"issue":"10","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"J Yuchen Li","year":"2018","unstructured":"Yuchen Li, J., Fan, Y.W., Tan, K.-L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41822-w","volume":"9","author":"PD Karampourniotis","year":"2019","unstructured":"Karampourniotis, P.D., Szymanski, B.K., Korniss, G.: Influence maximization for fixed heterogeneous thresholds. Sci. Rep. 9(1), 1\u201312 (2019)","journal-title":"Sci. Rep."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 635\u2013645 (2011)","DOI":"10.1145\/1935826.1935914"},{"key":"14_CR12","unstructured":"Abu-Mostafa, Y.Y., Magdon-Ismail, M., Lin, H.-T.: Learning From Data (2012). amlbook.com"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67(2), 026126 (2003)","journal-title":"Phys. Rev. E"}],"container-title":["Studies in Computational Intelligence","Complex Networks &amp; Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:36:17Z","timestamp":1609799777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_14","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}