{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:05:06Z","timestamp":1762445106390,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030660451"},{"type":"electronic","value":"9783030660468"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-66046-8_13","type":"book-chapter","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T15:02:32Z","timestamp":1609686152000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Group Influence Maximization in Social Networks"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Zhong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"13_CR1","unstructured":"Mary, M., Wu, L.: Internet trends 2018 (2018)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.: Cost-effective outbreak detection in networks, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: Celf++: optimizing the greedy algorithm for influence maximization in social networks, pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Social Network Analysis in the Social and Behavioral Sciences. Cambridge University Press, Cambridge (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Estevez, P.A., Vera, P.A., Saito, K.: Selecting the most influential nodes in social networks, pp. 2397\u20132402 (2007)","DOI":"10.1109\/IJCNN.2007.4371333"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Cao, T., Wu, X., Wang, S., Hu, X.: Oasnet: an optimal allocation approach to influence maximization in modular social networks, pp. 1088\u20131094 (2010)","DOI":"10.1145\/1774088.1774314"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks, pp. 1039\u20131048 (2010)","DOI":"10.1145\/1835804.1835935"},{"key":"13_CR15","unstructured":"Ji, J., Huang, L., Wang, Z., Li, H., Li, S.: A new approach to maximizing the spread of influence based on community structure. J. Jilin Univ. (Science Edition) 1, 23 (2011)"},{"issue":"19","key":"13_CR16","first-page":"8","volume":"2016","author":"WANG Shuang","year":"2016","unstructured":"Shuang, W.A.N.G., Bin, L.I., Xuejun, L.I.U., Ping, H.U.: Division of community-based influence maximization algorithm. Computer Engineering and Applications 2016(19), 8 (2016)","journal-title":"Computer Engineering and Applications"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang, J., Zhou, S., Li, X., Liu, L., Hongchun, W.: Cofim: a community-based framework for influence maximization on large-scale networks. Knowl. Based Syst. 117, 88\u2013100 (2017)","journal-title":"Knowl. Based Syst."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 344\u2013349. IEEE (2011)","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"7","key":"13_CR19","first-page":"94","volume":"3","author":"L Qiu","year":"2019","unstructured":"Qiu, L., Jia, W., Fan, X.: Influence maximization algorithm based on overlapping community. Data Anal. Knowl. Disc. 3(7), 94\u2013102 (2019)","journal-title":"Data Anal. Knowl. Disc."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532549","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen, Y.-C., Zhu, W.-Y., Peng, W.-C., Lee, W.-C., Lee, S.-Y.: CIM: community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol. (TIST) 5(2), 1\u201331 (2014)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"6","key":"13_CR21","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang, H., Shen, H., Meng, Z., Chang, H., He, H.: Community-based influence maximization for viral marketing. Appl. Intell. 49(6), 2137\u20132150 (2019). https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl. Intell."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowl. Based Syst. 134, 149\u2013158 (2017)","journal-title":"Knowl. Based Syst."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","volume":"6","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Zhu, J., Ghosh, S., Weili, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng. 6(4), 801\u2013811 (2018)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"6","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSS.2019.2938575","volume":"6","author":"J Zhu","year":"2019","unstructured":"Zhu, J., Ghosh, S., Weili, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. 6(6), 1156\u20131164 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models (2020). arXiv preprint arXiv:2005.07959","DOI":"10.1145\/3340531.3411866"}],"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-66046-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T03:49:01Z","timestamp":1748836141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66046-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030660451","9783030660468"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66046-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 January 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":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","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":"20","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":"0","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":"24% - 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,4","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":"3","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)"}}]}}