{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:54:53Z","timestamp":1744217693368,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-91434-9_32","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"371-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Target Set Selection in Social Networks with Influence and Activation Thresholds"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6124-3047","authenticated-orcid":false,"given":"Zhecheng","family":"Qiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6403-6649","authenticated-orcid":false,"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4597-3426","authenticated-orcid":false,"given":"Qipeng P.","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"issue":"44\u201346","key":"32_CR1","doi-asserted-by":"publisher","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theoret. Comput. Sci. 411(44\u201346), 4017\u20134022 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1007\/978-3-642-10631-6_98","volume-title":"Algorithms and Computation","author":"E Anshelevich","year":"2009","unstructured":"Anshelevich, E., Chakrabarty, D., Hate, A., Swamy, C.: Approximation algorithms for the firefighter problem: cuts over time and submodularity. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 974\u2013983. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_98"},{"key":"32_CR3","doi-asserted-by":"publisher","unstructured":"Bourigault, S., Lamprier, S., Gallinari, P.: Representation learning for information diffusion through social networks: an embedded cascade model. In: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. WSDM 2016, pp. 573\u2013582. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2835776.2835817","DOI":"10.1145\/2835776.2835817"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 665\u2013674. ACM (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Cha, M., Mislove, A., Gummadi, K.P.: A measurement-driven analysis of information propagation in the Flickr social network. In: Proceedings of the 18th International Conference on World Wide Web, pp. 721\u2013730 (2009)","DOI":"10.1145\/1526709.1526806"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-66046-8_41","volume-title":"Computational Data and Social Networks","author":"C-L Chen","year":"2020","unstructured":"Chen, C.-L., Pasiliao, E.L., Boginski, V.: A cutting plane method for least cost influence maximization. In: Chellappan, S., Choo, K.-K.R., Phan, N.H. (eds.) CSoNet 2020. LNCS, vol. 12575, pp. 499\u2013511. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-66046-8_41"},{"key":"32_CR7","unstructured":"Chen, G.H., Nikolov, S., Shah, D.: A latent source model for nonparametric time series classification. In: Advances in Neural Information Processing Systems, pp. 1088\u20131096 (2013)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-34980-6_17","volume-title":"Computational Data and Social Networks","author":"M Chen","year":"2019","unstructured":"Chen, M., Zheng, Q.P., Boginski, V., Pasiliao, E.L.: Reinforcement learning in information cascades based on dynamic user behavior. In: Tagarelli, A., Tong, H. (eds.) CSoNet 2019. LNCS, vol. 11917, pp. 148\u2013154. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34980-6_17"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"32_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/MIS.2005.16","volume":"20","author":"P Domingos","year":"2005","unstructured":"Domingos, P.: Mining social networks for viral marketing. IEEE Intell. Syst. 20(1), 80\u201382 (2005)","journal-title":"IEEE Intell. Syst."},{"issue":"6","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420\u20131443 (1978)","journal-title":"Am. J. Sociol."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"G\u00fcnne\u00e7, D., Raghavan, S., Zhang, R.: Least-cost influence maximization on social networks. INFORMS J. Comput. 32(2), 289\u2013302 (2020)","DOI":"10.1287\/ijoc.2019.0886"},{"key":"32_CR14","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD 2003, pp. 137\u2013146. ACM, New York (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT - the Koblenz network collection. In: Proceedings of the International Conference on World Wide Web Companion, pp. 1343\u20131350 (2013). http:\/\/dl.acm.org\/citation.cfm?id=2488173","DOI":"10.1145\/2487788.2488173"},{"key":"32_CR16","unstructured":"Leskovec, J., Mcauley, J.J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, pp. 539\u2013547 (2012)"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s41109-019-0215-3","volume":"4","author":"Z Qiang","year":"2019","unstructured":"Qiang, Z., Pasiliao, E.L., Zheng, Q.P.: Model-based learning of information diffusion in social media networks. Appl. Netw. Sci. 4(1), 111 (2019)","journal-title":"Appl. Netw. Sci."},{"issue":"4","key":"32_CR18","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/ijoo.2019.0012","volume":"1","author":"S Raghavan","year":"2019","unstructured":"Raghavan, S., Zhang, R.: A branch-and-cut approach for the weighted target set selection problem on social networks. INFORMS J. Optim. 1(4), 304\u2013322 (2019)","journal-title":"INFORMS J. Optim."},{"key":"32_CR19","unstructured":"Rodriguez, M.G., Balduzzi, D., Sch\u00f6lkopf, B.: Uncovering the temporal dynamics of diffusion networks. arXiv preprint arXiv:1105.0697 (2011)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models (2020)","DOI":"10.1145\/3340531.3411866"},{"issue":"1","key":"32_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/1811099.1811063","volume":"38","author":"D Shah","year":"2010","unstructured":"Shah, D., Zaman, T.: Detecting sources of computer viruses in networks: theory and experiment. SIGMETRICS Perform. Eval. Rev. 38(1), 203\u2013214 (2010). https:\/\/doi.org\/10.1145\/1811099.1811063","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"4","key":"32_CR22","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s13278-013-0135-7","volume":"3","author":"P Shakarian","year":"2013","unstructured":"Shakarian, P., Eyre, S., Paulo, D.: A scalable heuristic for viral marketing under the tipping model. Soc. Netw. Anal. Min. 3(4), 1225\u20131248 (2013). https:\/\/doi.org\/10.1007\/s13278-013-0135-7","journal-title":"Soc. Netw. Anal. Min."},{"key":"32_CR23","unstructured":"Spencer, G., Howarth, R.: Maximizing the spread of stable influence: leveraging norm-driven moral-motivation for green behavior change in networks. arXiv preprint arXiv:1309.6455 (2013)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Tsur, O., Rappoport, A.: What\u2019s in a hashtag?: content based prediction of the spread of ideas in microblogging communities. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 643\u2013652. ACM (2012)","DOI":"10.1145\/2124295.2124320"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-16567-2_16","volume-title":"Social Informatics","author":"S Ye","year":"2010","unstructured":"Ye, S., Wu, S.F.: Measuring message propagation and social influence on Twitter.com. In: Bolc, L., Makowski, M., Wierzbicki, A. (eds.) SocInfo 2010. LNCS, vol. 6430, pp. 216\u2013231. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16567-2_16"},{"key":"32_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-030-34980-6_37","volume-title":"Computational Data and Social Networks","author":"G Yun","year":"2019","unstructured":"Yun, G., Zheng, Q.P., Boginski, V., Pasiliao, E.L.: Information network cascading and network re-construction with bounded rational user behaviors. In: Tagarelli, A., Tong, H. (eds.) CSoNet 2019. LNCS, vol. 11917, pp. 351\u2013362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34980-6_37"},{"issue":"4","key":"32_CR27","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:44:42Z","timestamp":1710233082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}