{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:28:01Z","timestamp":1765974481649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031354441"},{"type":"electronic","value":"9783031354458"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-35445-8_10","type":"book-chapter","created":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T10:01:36Z","timestamp":1686391296000},"page":"126-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximising Influence Spread in\u00a0Complex Networks by\u00a0Utilising Community-Based Driver Nodes as\u00a0Seeds"],"prefix":"10.1007","author":[{"given":"Abida","family":"Sadaf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Mathieson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Br\u00f3dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katarzyna","family":"Musial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)","DOI":"10.1137\/1.9781611973402.70"},{"issue":"1\u20137","key":"10_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chen, D.B., Gao, H., L\u00fc, L., Zhou, T.: Identifying influential nodes in large-scale directed networks: the role of clustering. PLoS ONE 8(10), e77455 (2013)","DOI":"10.1371\/journal.pone.0077455"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532549","volume":"5","author":"YC 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)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: StaticGreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 509\u2013518 (2013)","DOI":"10.1145\/2505515.2505541"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"10_CR7","unstructured":"D\u2019Angelo, G., Severini, L., Velaj, Y.: Influence maximization in the independent cascade model. In: ICTCS, pp. 269\u2013274 (2016)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Duan, W., Gu, B., Whinston, A.B.: Informational cascades and software adoption on the internet: an empirical investigation. MIS Q. 23\u201348 (2009)","DOI":"10.2307\/20650277"},{"issue":"12","key":"10_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: CELF++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"issue":"6","key":"10_CR11","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":"10_CR12","doi-asserted-by":"crossref","unstructured":"Kazemzadeh, F., Safaei, A.A., Mirzarezaee, M.: Influence maximization in social networks using effective community detection. Phys. A 598, 127314 (2022)","DOI":"10.1016\/j.physa.2022.127314"},{"key":"10_CR13","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":"10_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: 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 (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"10_CR15","first-page":"1","volume":"5","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Tang, M., Zhou, T., Do, Y.: Improving the accuracy of the k-shell method by removing redundant links: from a perspective of spreading dynamics. Sci. Rep. 5(1), 1\u201311 (2015)","journal-title":"Sci. Rep."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., Zhang, Y.C., Yeung, C.H., Zhou, T.: Leaders in social networks, the delicious case. PLoS ONE 6(6), e21202 (2011)","DOI":"10.1371\/journal.pone.0021202"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Nacher, J.C., Akutsu, T.: Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control. New J. Phys. 14(7), 073005 (2012)","DOI":"10.1088\/1367-2630\/14\/7\/073005"},{"key":"10_CR18","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. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans. Netw. 25(4), 2419\u20132429 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J. Sel. Areas Commun. 31(6), 1084\u20131094 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Sadaf, A., Mathieson, L., Musial, K.: An insight into network structure measures and number of driver nodes. In: Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 471\u2013478 (2021)","DOI":"10.1145\/3487351.3488557"},{"key":"10_CR22","unstructured":"Sadaf, Mathieson, B., Musial: A bridge between influence models and control methods [manuscript submitted for publication]. IEEE Trans. Netw. Sci. Eng. (2022)"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-001-0101-z","volume":"33","author":"LA Sanchis","year":"2002","unstructured":"Sanchis, L.A.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33(1), 3\u201318 (2002)","journal-title":"Algorithmica"},{"key":"10_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-981-10-3274-5_18","volume-title":"Digital Connectivity \u2013 Social Impact","author":"K Sathiyakumari","year":"2016","unstructured":"Sathiyakumari, K., Vijaya, M.S.: Community detection based on Girvan Newman algorithm and link analysis of social media. In: Subramanian, S., Nadarajan, R., Rao, S., Sheen, S. (eds.) CSI 2016. CCIS, vol. 679, pp. 223\u2013234. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-981-10-3274-5_18"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, X., Lv, T., Yang, X., Zhang, B.: Structural controllability of complex networks based on preferential matching. PLoS ONE 9(11), e112039 (2014)","DOI":"10.1371\/journal.pone.0112039"},{"issue":"10","key":"10_CR28","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1587\/transinf.2016EDP7473","volume":"100","author":"J Zhu","year":"2017","unstructured":"Zhu, J., Wang, B., Wu, B., Zhang, W.: Emotional community detection in social network. IEICE Trans. Inf. Syst. 100(10), 2515\u20132525 (2017)","journal-title":"IEICE Trans. Inf. Syst."}],"container-title":["Communications in Computer and Information Science","Information Management and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35445-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T10:07:04Z","timestamp":1686391624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35445-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031354441","9783031354458"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35445-8_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIMBig","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on Information Management and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","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":"simbig2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/simbig.org\/SIMBig2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"50","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":"18","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":"1","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":"36% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}