{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T19:25:56Z","timestamp":1770492356258,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031478420","type":"print"},{"value":"9783031478437","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_25","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"356-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Influence Maximization Revisited"],"prefix":"10.1007","author":[{"given":"Yihan","family":"Geng","sequence":"first","affiliation":[]},{"given":"Kunyu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ziqi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"issue":"9","key":"25_CR1","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62(9), 3417\u20133455 (2020)","journal-title":"Knowl. Inf. Syst."},{"issue":"9","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.14778\/3397230.3397244","volume":"13","author":"S Bian","year":"2020","unstructured":"Bian, S., Guo, Q., Wang, S., Yu, J.X.: Efficient algorithms for budgeted influence maximization on massive social networks. Proc. VLDB Endow. 13(9), 1498\u20131510 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen, S., Fan, J., Li, G., Feng, J., Tan, K., Tang, J.: Online topic-aware influence maximization. Proc. VLDB Endow. 8(6), 666\u2013677 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-25280-8_13","volume-title":"Decision and Game Theory for Security","author":"A Clark","year":"2011","unstructured":"Clark, A., Poovendran, R.: Maximizing influence in competitive environments: a game-theoretic approach. In: Baras, J.S., Katz, J., Altman, E. (eds.) GameSec 2011. LNCS, vol. 7037, pp. 151\u2013162. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25280-8_13"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/btv557","volume":"32","author":"M Franz","year":"2016","unstructured":"Franz, M., Lopes, C.T., Huck, G., Dong, Y., S\u00fcmer, S.O., Bader, G.D.: Cytoscape.js: a graph theory library for visualisation and analysis. Bioinformatics 32(2), 309\u2013311 (2016)","journal-title":"Bioinformatics"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gask\u00f3, N., Suciu, M.A., K\u00e9pes, T., Lung, R.I.: Shapley value and extremal optimization for the network influence maximization problem. In: 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 182\u2013189. IEEE (2019)","DOI":"10.1109\/SYNASC49474.2019.00033"},{"key":"25_CR7","first-page":"01","volume":"9","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B.: Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. Market. Sci. Rev 9, 01 (2001)","journal-title":"Acad. Market. Sci. Rev"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12, 211\u2013223 (2001)","journal-title":"Mark. Lett."},{"key":"25_CR9","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, WWW 2011, New York, NY, USA, pp. 47\u201348. Association for Computing Machinery (2011)","DOI":"10.1145\/1963192.1963217"},{"issue":"6","key":"25_CR10","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":"25_CR11","doi-asserted-by":"crossref","unstructured":"Guo, Q., Wang, S., Wei, Z., Chen, M.: Influence maximization revisited: efficient reverse reachable set generation with bound tightened. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2167\u20132181 (2020)","DOI":"10.1145\/3318464.3389740"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Guo, Q., Wang, S., Wei, Z., Lin, W., Tang, J.: Influence maximization revisited: efficient sampling with bound tightened. ACM Trans. Database Syst. 47(3), 12:1\u201312:45 (2022)","DOI":"10.1145\/3533817"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"He, X., Kempe, D.: Robust influence maximization. In: Krishnapuram, B., Shah, M., Smola, A.J., Aggarwal, C.C., Shen, D., Rastogi, R. (eds.) Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13\u201317 August 2016, pp. 885\u2013894. ACM (2016)","DOI":"10.1145\/2939672.2939760"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.14778\/3565816.3565821","volume":"16","author":"S Huang","year":"2022","unstructured":"Huang, S., Lin, W., Bao, Z., Sun, J.: Influence maximization in real-world closed social networks. Proc. VLDB Endow. 16(2), 180\u2013192 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"25_CR15","doi-asserted-by":"publisher","first-page":"e98679","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy, M., Venturini, T., Heymann, S., Bastian, M.: ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE 9(6), e98679 (2014)","journal-title":"PLoS ONE"},{"key":"25_CR16","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":"25_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: Dyreson, C.E., Li, F., \u00d6zsu, M.T. (eds.) International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, 22\u201327 June 2014, pp. 87\u201398. ACM (2014)","DOI":"10.1145\/2588555.2588561"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Li, J., Cai, T., Mian, A., Li, R., Sellis, T., Yu, J. X.: Holistic influence maximization for targeted advertisements in spatial social networks. In: 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16\u201319, 2018, pp. 1340\u20131343. IEEE Computer Society (2018)","DOI":"10.1109\/ICDE.2018.00145"},{"issue":"10","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Lin, M., Li, W., Lu, S.: Balanced influence maximization in attributed social network based on sampling. In: Caverlee, J., Hu, X.B., Lalmas, M., Wang, W. (eds.) WSDM 2020: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, 3\u20137 February 2020, pp. 375\u2013383. ACM (2020)","DOI":"10.1145\/3336191.3371833"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Lu, C., Yu, J.X., Zhang, Z., Cheng, H.: Graph ISO\/auto-morphism: a divide- &-conquer approach. In: Proceedings of the 2021 International Conference on Management of Data, SIGMOD 2021, New York, NY, USA, pp. 1195\u20131207. Association for Computing Machinery (2021)","DOI":"10.1145\/3448016.3452820"},{"key":"25_CR23","unstructured":"MacArthur, B.D., S\u00e1nchez-Garc\u00eda, R.J., Anderson, J.W.: On automorphism groups of networks. arXiv preprint arXiv:0705.3215 (2007)"},{"key":"25_CR24","unstructured":"Michel, G., Marc, R.: An axiomatic approach to the concept of interaction among players in cooperative games. Int. J. Game Theory (1999)"},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8(1), 130\u2013147 (2011)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"25_CR26","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"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.-I.: Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"25_CR28","first-page":"307","volume":"28","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: A value for n-person games. Contrib. Theory Games 28, 307\u2013317 (1953)","journal-title":"Contrib. Theory Games"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Tang, F., Liu, Q., Zhu, H., Chen, E., Zhu, F.: Diversified social influence maximization. In: Wu, X., Ester, M., Xu, G. (eds.) 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2014, Beijing, China, 17\u201320 August 2014, pp. 455\u2013459. IEEE Computer Society (2014)","DOI":"10.1109\/ASONAM.2014.6921625"},{"issue":"7","key":"25_CR30","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.14778\/3450980.3450981","volume":"14","author":"D Tsaras","year":"2021","unstructured":"Tsaras, D., Trimponias, G., Ntaflos, L., Papadias, D.: Collective influence maximization for multiple competing products with an awareness-to-influence model. Proc. VLDB Endow. 14(7), 1124\u20131136 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Distance-aware influence maximization in geo-social network. In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, 16\u201320 May 2016, pp. 1\u201312. IEEE Computer Society (2016)","DOI":"10.1109\/ICDE.2016.7498224"},{"key":"25_CR32","unstructured":"Weber, R.J.: Probabilistic values for games. In: The Shapley Value. Essays in Honor of Lloyd S. Shapley, pp. 307\u2013317 (1953)"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, K., Zhou, J., Tao, D., Karras, P., Li, Q., Xiong, H.: Geodemographic influence maximization. In: Gupta, R., Liu, Y., Tang, J., Prakash, B.A. (eds.) KDD 2020: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, 23\u201327 August 2020, pp. 2764\u20132774. ACM (2020)","DOI":"10.1145\/3394486.3403327"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, Y.: Top-k influential nodes in social networks: a game perspective. In: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1029\u20131032 (2017)","DOI":"10.1145\/3077136.3080709"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T13:50:42Z","timestamp":1730469042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"26","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":"63% - 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.5","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)"}}]}}