{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,13]],"date-time":"2026-09-13T02:47:42Z","timestamp":1789267662244,"version":"build-2803163510"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2628-E-001-003-MY3"],"award-info":[{"award-number":["108-2628-E-001-003-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001869","name":"Academia Sinica","doi-asserted-by":"publisher","award":["206c-1012021"],"award-info":[{"award-number":["206c-1012021"]}],"id":[{"id":"10.13039\/501100001869","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["110-2221-E-007-085-MY3"],"award-info":[{"award-number":["110-2221-E-007-085-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001869","name":"Academia Sinica","doi-asserted-by":"publisher","award":["AS-TP-110-M07-2"],"award-info":[{"award-number":["AS-TP-110-M07-2"]}],"id":[{"id":"10.13039\/501100001869","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["108-2221-E-007-064-MY3"],"award-info":[{"award-number":["108-2221-E-007-064-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10115-022-01696-3","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:02:42Z","timestamp":1658260962000},"page":"2059-2090","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Leveraging transfer learning in reinforcement learning to tackle competitive influence maximization"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5749-6727","authenticated-orcid":false,"given":"Khurshed","family":"Ali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-0791","authenticated-orcid":false,"given":"Chih-Yu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi-Shin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"1696_CR1","doi-asserted-by":"crossref","unstructured":"Ali K, Wang CY, Chen YS (2018) Boosting reinforcement learning in competitive influence maximization with transfer learning. In: Proceedings of IEEE\/WIC\/ACM international conference on web intelligence (WI). IEEE, pp 395\u2013400","DOI":"10.1109\/WI.2018.00-62"},{"key":"1696_CR2","doi-asserted-by":"publisher","first-page":"6337","DOI":"10.1109\/ACCESS.2018.2888895","volume":"7","author":"K Ali","year":"2019","unstructured":"Ali K, Wang CY, Chen YS (2019) A novel nested q-learning method to tackle time-constrained competitive influence maximization. IEEE Access 7:6337\u20136352","journal-title":"IEEE Access"},{"key":"1696_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Ishay S, Sela A, Ben-Gal IE (2018) Spread-it: a strategic game of competitive diffusion through social networks. IEEE Trans Games 11(2):129\u2013141","DOI":"10.1109\/TG.2018.2806302"},{"key":"1696_CR4","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of international workshop on web and internet economics. Springer, pp 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"1696_CR5","doi-asserted-by":"crossref","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceedings of international workshop on internet and network economics. Springer, pp 539\u2013550","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"1696_CR6","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El\u00a0Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World wide web. ACM, pp 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"1696_CR7","doi-asserted-by":"crossref","unstructured":"Chen HH, Ciou YB, Lin SD (2012) Information propagation game: a tool to acquire human playing data for multiplayer influence maximization on social networks. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1524\u20131527","DOI":"10.1145\/2339530.2339771"},{"key":"1696_CR8","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. ACM, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1696_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 2010 IEEE international conference on data mining. IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"1696_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 SIAM international conference on data mining. SIAM, pp 379\u2013390","DOI":"10.1137\/1.9781611972818.33"},{"key":"1696_CR11","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. ACM, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"1696_CR12","doi-asserted-by":"crossref","unstructured":"Clark A, Poovendran R (2011) Maximizing influence in competitive environments: a game-theoretic approach. In: Proceedings of international conference on decision and game theory for security. Springer, pp 151\u2013162","DOI":"10.1007\/978-3-642-25280-8_13"},{"key":"1696_CR13","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) 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. ACM, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"key":"1696_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"1","key":"1696_CR15","first-page":"1","volume":"5","author":"E Even-Dar","year":"2003","unstructured":"Even-Dar E, Mansour Y (2003) Learning rates for q-learning. J Mach Learn Res 5(1):1\u201325","journal-title":"J Mach Learn Res"},{"key":"1696_CR16","doi-asserted-by":"crossref","unstructured":"Fazeli A, Jadbabaie A (2012) Game theoretic analysis of a strategic model of competitive contagion and product adoption in social networks. In: Proceedings of 2012 IEEE 51st IEEE conference on decision and control (CDC). IEEE, pp 74\u201379","DOI":"10.1109\/CDC.2012.6426222"},{"key":"1696_CR17","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez F, Veloso M (2006) Probabilistic policy reuse in a reinforcement learning agent. In: Proceedings of the 5th international joint conference on autonomous agents and multiagent systems. ACM, pp 720\u2013727","DOI":"10.1145\/1160633.1160762"},{"key":"1696_CR18","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Virinchi S, Roy S (2015) Asim: a scalable algorithm for influence maximization under the independent cascade model. In: Proceedings of the 24th international conference on world wide web. ACM, pp 35\u201336","DOI":"10.1145\/2740908.2742725"},{"key":"1696_CR19","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 international conference on management of data. ACM, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"1696_CR20","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011a) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web. ACM, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1696_CR21","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: Proceedings of 2011 IEEE 11th international conference on data mining. IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"1696_CR22","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 SIAM international conference on data mining. SIAM, pp 463\u2013474","DOI":"10.1137\/1.9781611972825.40"},{"key":"1696_CR23","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: Proceedings of 2012 IEEE 12th international conference on data mining. IEEE, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1696_CR24","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 9th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1696_CR25","doi-asserted-by":"crossref","unstructured":"Lazaric A, Restelli M, Bonarini A (2008) Transfer of samples in batch reinforcement learning. In: Proceedings of the 25th international conference on Machine learning. ACM, pp 544\u2013551","DOI":"10.1145\/1390156.1390225"},{"key":"1696_CR26","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1696_CR27","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. ACM, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1696_CR28","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":"1696_CR29","doi-asserted-by":"crossref","unstructured":"Lin SC, Lin SD, Chen MS (2015) A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 695\u2013704","DOI":"10.1145\/2783258.2783392"},{"issue":"3","key":"1696_CR30","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/B:AIRE.0000036264.95672.64","volume":"21","author":"MG Madden","year":"2004","unstructured":"Madden MG, Howley T (2004) Transfer of experience between reinforcement learning environments with progressive difficulty. Artif Intell Rev 21(3):375\u2013398","journal-title":"Artif Intell Rev"},{"key":"1696_CR31","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. ACM, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"1696_CR32","doi-asserted-by":"crossref","unstructured":"Qiu J, Tang J, Ma H, Dong Y, Wang K, Tang J (2018) Deepinf: social influence prediction with deep learning. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 2110\u20132119","DOI":"10.1145\/3219819.3220077"},{"key":"1696_CR33","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1696_CR34","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction. MIT Press"},{"key":"1696_CR35","doi-asserted-by":"crossref","unstructured":"Tanaka F, Yamamura M (2003) Multitask reinforcement learning on the distribution of MDPS. In: Proceedings 2003 IEEE international symposium on computational intelligence in robotics and automation. Computational intelligence in robotics and automation for the new millennium (Cat. No. 03EX694), vol\u00a03. IEEE, pp 1108\u20131113","DOI":"10.1109\/CIRA.2003.1222152"},{"key":"1696_CR36","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. ACM, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"1696_CR37","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. ACM, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"1696_CR38","unstructured":"Taylor M, Whiteson S, Stone P (2006) Transfer learning for policy search methods. In: ICML workshop on structural knowledge transfer for machine learning. Citeseer, pp 1\u20134"},{"key":"1696_CR39","first-page":"880","volume":"5","author":"ME Taylor","year":"2005","unstructured":"Taylor ME, Stone P, Liu Y (2005) Value functions for RL-based behavior transfer: a comparative study. Proc AAAI 5:880\u2013885","journal-title":"Proc AAAI"},{"key":"1696_CR40","first-page":"242","volume":"1","author":"L Torrey","year":"2009","unstructured":"Torrey L, Shavlik J (2009) Transfer learning. Handb Res Mach Learn Appl Trends: Algorithms, Methods, Techn 1:242","journal-title":"Handb Res Mach Learn Appl Trends: Algorithms, Methods, Techn"},{"key":"1696_CR41","doi-asserted-by":"crossref","unstructured":"Torrey L, Shavlik J, Walker T, Maclin R (2007) Relational macros for transfer in reinforcement learning. In: International conference on inductive logic programming. Springer, pp 254\u2013268","DOI":"10.1007\/978-3-540-78469-2_25"},{"key":"1696_CR42","unstructured":"Torrey L, Shavlik J, Natarajan S, Kuppili P, Walker T (2008) Transfer in reinforcement learning via Markov logic networks. In: AAAI workshop on transfer learning for complex tasks"},{"key":"1696_CR43","doi-asserted-by":"crossref","unstructured":"Wilson A, Fern A, Ray S, Tadepalli P (2007) Multi-task reinforcement learning: a hierarchical Bayesian approach. In: Proceedings of the 24th international conference on Machine learning. ACM, pp 1015\u20131022","DOI":"10.1145\/1273496.1273624"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01696-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01696-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01696-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T03:29:46Z","timestamp":1659756586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01696-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":43,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1696"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01696-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"17 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}