{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T15:59:13Z","timestamp":1762531153248,"version":"build-2065373602"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10115-025-02559-3","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T11:28:02Z","timestamp":1756466882000},"page":"11041-11073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Overlap-aware influence maximization with balanced replay deep Q-network"],"prefix":"10.1007","volume":"67","author":[{"given":"Yuxin","family":"Zuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuqi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiantian","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"2559_CR1","doi-asserted-by":"crossref","unstructured":"Liu Y, Sze W, Gao X, Chen G (2021) Multiple agents reinforcement learning based influence maximization in social network services. In: Service-oriented computing: 19th international conference, ICSOC 2021, Virtual Event, November 22\u201325, 2021, Proceedings 19. Springer, pp 431\u2013445","DOI":"10.1007\/978-3-030-91431-8_27"},{"key":"2559_CR2","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust K et al (1994) Social network analysis: methods and applications. The Press Syndicate of the University of Cambridge","DOI":"10.1017\/CBO9780511815478"},{"key":"2559_CR3","doi-asserted-by":"crossref","unstructured":"Searle J (2010) Making the Social World: the structure of human civilization. Oxford University Press","DOI":"10.1093\/acprof:osobl\/9780195396171.001.0001"},{"key":"2559_CR4","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K-I (2014) Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. In: Proceedings of the AAAI conference on artificial intelligence, vol 28","DOI":"10.1609\/aaai.v28i1.8726"},{"issue":"6","key":"2559_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/37.969135","volume":"21","author":"C Asavathiratham","year":"2001","unstructured":"Asavathiratham C, Roy S, Lesieutre B, Verghese G (2001) The influence model. IEEE Control Syst Mag 21(6):52\u201364","journal-title":"IEEE Control Syst Mag"},{"issue":"9","key":"2559_CR6","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 DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62(9):3417\u20133455","journal-title":"Knowl Inf Syst"},{"key":"2559_CR7","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"2559_CR8","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) 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","DOI":"10.1145\/956750.956769"},{"key":"2559_CR9","unstructured":"Perrault P, Healey J, Wen Z, Valko M (2020) Budgeted online influence maximization. In: International conference on machine learning. PMLR, pp 7620\u20137631"},{"key":"2559_CR10","doi-asserted-by":"crossref","unstructured":"Ou H-C, Chou C-K, Chen M-S (2016) Influence maximization for complementary goods: why parties fail to cooperate? In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 1713\u20131722","DOI":"10.1145\/2983323.2983741"},{"issue":"3","key":"2559_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3442341","volume":"15","author":"G Wu","year":"2021","unstructured":"Wu G, Gao X, Yan G, Chen G (2021) Parallel greedy algorithm to multiple influence maximization in social network. ACM Trans Knowl Discov Data 15(3):1\u201321","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"2559_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang X, Zhang Y, Zhang W, Lin X (2016) Efficient distance-aware influence maximization in geo-social networks. IEEE Trans Knowl Data Eng 29(3):599\u2013612","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"2559_CR13","first-page":"2208","volume":"33","author":"X Yin","year":"2019","unstructured":"Yin X, Hu X, Chen Y, Yuan X, Li B (2019) Signed-pagerank: an efficient influence maximization framework for signed social networks. IEEE Trans Knowl Data Eng 33(5):2208\u20132222","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2559_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2016","unstructured":"Tong G, Wu W, Tang S, Du D-Z (2016) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw 25(1):112\u2013125","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"5","key":"2559_CR15","doi-asserted-by":"publisher","first-page":"3232","DOI":"10.1109\/TNET.2016.2600025","volume":"24","author":"H Zhang","year":"2016","unstructured":"Zhang H, Nguyen DT, Das S, Zhang H, Thai MT (2016) Corrections to \u201cleast cost influence maximization across multiple social networks\u2019\u2019 [Apr 16 929\u2013939]. IEEE\/ACM Trans Netw 24(5):3232\u20133232","journal-title":"IEEE\/ACM Trans Netw"},{"key":"2559_CR16","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"2559_CR17","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"2559_CR18","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: European conference on principles of data mining and knowledge discovery. Springer, pp 259\u2013271","DOI":"10.1007\/11871637_27"},{"issue":"10","key":"2559_CR19","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-L (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2559_CR20","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) 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","DOI":"10.1145\/2723372.2723734"},{"key":"2559_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) 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","DOI":"10.1145\/2882903.2915207"},{"key":"2559_CR22","unstructured":"Li H, Xu M, Bhowmick SS, Sun C, Jiang Z, Cui J (2019) Disco: influence maximization meets network embedding and deep learning. arXiv preprint arXiv:1906.07378"},{"key":"2559_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554","volume":"82","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019) Lapso-im: a learning-based influence maximization approach for social networks. Appl Soft Comput 82:105554","journal-title":"Appl Soft Comput"},{"key":"2559_CR24","doi-asserted-by":"crossref","unstructured":"Rostamnia M, Kianian S. (2019) Vertex cover preprocessing for influence maximization algorithms. In: 2019 5th conference on knowledge based engineering and innovation (KBEI). IEEE, pp 338\u2013342","DOI":"10.1109\/KBEI.2019.8734949"},{"key":"2559_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"2559_CR26","doi-asserted-by":"crossref","unstructured":"Tang J, Zhu Y, Tang X, Han K (2022) Distributed influence maximization for large-scale online social networks. In: 2022 IEEE 38th international conference on data engineering (ICDE). IEEE, pp 81\u201395","DOI":"10.1109\/ICDE53745.2022.00011"},{"key":"2559_CR27","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"2559_CR28","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Chen W, Cheng X (2014) Imrank: influence maximization via finding self-consistent ranking. In: Proceedings of the 37th international ACM SIGIR conference on research and development in information retrieval, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"2559_CR29","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information and knowledge management, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"2559_CR30","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"2559_CR31","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) 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","DOI":"10.1145\/2588555.2593670"},{"key":"2559_CR32","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems 30"},{"key":"2559_CR33","unstructured":"Dai H, Dai B, Song L (2016) Discriminative embeddings of latent variable models for structured data. In: International conference on machine learning. PMLR, pp 2702\u20132711"},{"key":"2559_CR34","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search, Advances in neural information processing systems, vol 31"},{"key":"2559_CR35","unstructured":"Manchanda S, Mittal A, Dhawan A, Medya S, Ranu S, Singh A (2019) Learning heuristics over large graphs via deep reinforcement learning. arXiv preprint arXiv:1903.03332"},{"key":"2559_CR36","unstructured":"Kamarthi H, Vijayan P, Wilder B, Ravindran B, Tambe M (2019) Influence maximization in unknown social networks: learning policies for effective graph sampling . arXiv preprint arXiv:1907.11625"},{"key":"2559_CR37","doi-asserted-by":"crossref","unstructured":"Ali K, Wang C-Y, Yeh M-Y, Chen Y-S (2020) Addressing competitive influence maximization on unknown social network with deep reinforcement learning. In: 2020 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE, pp 196\u2013203","DOI":"10.1109\/ASONAM49781.2020.9381471"},{"key":"2559_CR38","unstructured":"Yadav A, Noothigattu R, Rice E, Onasch-Vera L, Marcolino LS, Tambe M (2018) Please be an influencer? Contingency-aware influence maximization. In: AAMAS, pp 1423\u20131431"},{"key":"2559_CR39","doi-asserted-by":"crossref","unstructured":"Tian S, Zhang P, Mo S, Wang L, Peng Z (2019) A learning approach for topic-aware influence maximization. In: Web and big data: third international joint conference, APWeb-WAIM 2019, Chengdu, China, August 1\u20133, 2019, Proceedings, Part I 3. Springer, pp 125\u2013140","DOI":"10.1007\/978-3-030-26072-9_9"},{"issue":"2","key":"2559_CR40","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","volume":"11","author":"T Chen","year":"2023","unstructured":"Chen T, Yan S, Guo J, Wu W (2023) Touplegdd: a fine-designed solution of influence maximization by deep reinforcement learning. IEEE Trans Comput Soc Syst 11(2):2210\u20132221","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2559_CR41","unstructured":"Ling C, Jiang J, Wang J, Thai MT, Xue R, Song J, Qiu M, Zhao L (2023) Deep graph representation learning and optimization for influence maximization. In: International conference on machine learning. PMLR, pp 21350\u201321361"},{"issue":"9","key":"2559_CR42","first-page":"1","volume":"17","author":"Y Li","year":"2023","unstructured":"Li Y, Gao H, Gao Y, Guo J, Wu W (2023) A survey on influence maximization: from an ml-based combinatorial optimization. ACM Trans Knowl Discov Data 17(9):1\u201350","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"7540","key":"2559_CR43","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"2559_CR44","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602"},{"issue":"7","key":"2559_CR45","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1109\/TPDS.2021.3124670","volume":"33","author":"MT Islam","year":"2021","unstructured":"Islam MT, Karunasekera S, Buyya R (2021) Performance and cost-efficient spark job scheduling based on deep reinforcement learning in cloud computing environments. IEEE Trans Parallel Distrib Syst 33(7):1695\u20131710","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"2559_CR46","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","volume":"10","author":"H Li","year":"2022","unstructured":"Li H, Xu M, Bhowmick SS, Rayhan JS, Sun C, Cui J (2022) Piano: influence maximization meets deep reinforcement learning. IEEE Trans Comput Soc Syst 10(3):1288\u20131300","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2559_CR47","doi-asserted-by":"publisher","first-page":"12084","DOI":"10.1109\/ACCESS.2020.2966056","volume":"8","author":"Q Liqing","year":"2020","unstructured":"Liqing Q, Chunmei G, Shuang Z, Xiangbo T, Mingjv Z (2020) Tsim: a two-stage selection algorithm for influence maximization in social networks. IEEE Access 8:12084\u201312095","journal-title":"IEEE Access"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02559-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02559-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02559-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T15:51:48Z","timestamp":1762530708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02559-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"references-count":47,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2559"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02559-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"25 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}