{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:05:06Z","timestamp":1772913906866,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T00:00:00Z","timestamp":1582848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T00:00:00Z","timestamp":1582848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2018YFB1003400"],"award-info":[{"award-number":["2018YFB1003400"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2042017kf1017"],"award-info":[{"award-number":["2042017kf1017"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivated by the application of<jats:italic>viral marketing<\/jats:italic>, the topic-aware influence maximization (TIM) problem has been proposed to identify the most influential users under given topics. In particular, it aims to find<jats:italic>k<\/jats:italic>seeds (users) in social network<jats:italic>G<\/jats:italic>, such that the seeds can maximize the influence on users under the specific query topics and diffusion model such as independent cascade (IC) or linear threshold (LT). This problem has been proved to be NP-hard, and most of the proposed techniques suffer from the efficiency issue due to the lack of generalization. Even worse, the design of these algorithms requires significant specialized knowledge which is hard to be understood and implemented. To overcome these issues, this paper aims to learn a generalized heuristic framework to solve TIM problems by meta-learning. To this end, we first propose two topic-aware social influence propagation models based on IC and LT model, respectively, which is conducive to better advertising injections. We then encode the feature of each node by a vector and introduce a model, called<jats:italic>deep influence evaluation model<\/jats:italic>, to evaluate the user influence under different circumstances. Based on this model, we can construct the solution according to the influence evaluations efficiently, rather than spending a high cost to compute the exact influence by considering the complex graph structure. We conducted experiments on generated graph instances and real-world social networks. The results show the superiority in performance and comparable quality of our framework.<\/jats:p>","DOI":"10.1007\/s41019-020-00117-1","type":"journal-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T08:02:52Z","timestamp":1582876972000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":94,"title":["Deep Reinforcement Learning-Based Approach to Tackle Topic-Aware Influence Maximization"],"prefix":"10.1007","volume":"5","author":[{"given":"Shan","family":"Tian","sequence":"first","affiliation":[]},{"given":"Songsong","family":"Mo","sequence":"additional","affiliation":[]},{"given":"Liwei","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-0970","authenticated-orcid":false,"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,28]]},"reference":[{"key":"117_CR1","unstructured":"Albert R, Barab\u00e1si A (2001) Statistical mechanics of complex networks. CoRR arXiv:cond-mat\/0106096"},{"key":"117_CR2","unstructured":"Aslay \u00c7, Barbieri N, Bonchi F, Baeza-Yates RA (2014) Online topic-aware influence maximization queries. In: Proceedings of the 17th international conference on extending database technology, EDBT 2014, Athens, Greece, March 24\u201328, 2014, pp 295\u2013306"},{"key":"117_CR3","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2017) Neural combinatorial optimization with reinforcement learning. In: 5th international conference on learning representations, ICLR 2017, Toulon, France, April 24\u201326, 2017, workshop track proceedings"},{"issue":"8","key":"117_CR4","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","volume":"35","author":"Y Bengio","year":"2013","unstructured":"Bengio Y, Courville AC, Vincent P (2013) Representation learning: a review and new perspectives. IEEE Trans Pattern Anal Mach Intell 35(8):1798\u20131828","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"117_CR5","unstructured":"Bordes A, Usunier N, Garc\u00eda-Dur\u00e1n A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Advances in neural information processing systems 26: 27th annual conference on neural information processing systems 2013. Proceedings of a meeting held December 5\u20138, 2013, Lake Tahoe, Nevada, United States, pp 2787\u20132795"},{"key":"117_CR6","unstructured":"Borgs C, Brautbar M, Chayes JT, Lucier B (2012) Influence maximization in social networks: towards an optimal algorithmic solution. CoRR arxiv:1212.0884"},{"issue":"9","key":"117_CR7","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"117_CR8","first-page":"666","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Tan K, Tang J (2015) Online topic-aware influence maximization. PVLDB 8(6):666\u2013677","journal-title":"PVLDB"},{"key":"117_CR9","first-page":"1","volume-title":"Computational Social Networks","author":"Wei Chen","year":"2015","unstructured":"Chen W, Lin T, Yang C (2015) Real-time topic-aware influence maximization using preprocessing. In: Proceedings of 4th international conference computational social networks, CSoNet 2015, Beijing, China, August 4\u20136, 2015, pp 1\u201313"},{"key":"117_CR10","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, Paris, France, June 28\u2013July 1, 2009, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"117_CR11","doi-asserted-by":"crossref","unstructured":"Fan J, Qiu J, Li Y, Meng Q, Zhang D, Li G, Tan K, Du X (2018) OCTOPUS: an online topic-aware influence analysis system for social networks. In: 34th IEEE international conference on data engineering, ICDE 2018, Paris, France, April 16\u201319, 2018, pp 1569\u20131572","DOI":"10.1109\/ICDE.2018.00178"},{"key":"117_CR12","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference on world wide web, WWW 2011, Hyderabad, India, March 28\u2013April 1, 2011 (companion volume), pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"117_CR13","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, USA, August 13\u201317, 2016, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"117_CR14","doi-asserted-by":"crossref","unstructured":"Guo J, Zhang P, Zhou C, Cao Y, Guo L (2013) Personalized influence maximization on social networks. In: 22nd ACM international conference on information and knowledge management, CIKM\u201913, San Francisco, CA, USA, October 27\u2013November 1, 2013, pp 199\u2013208","DOI":"10.1145\/2505515.2505571"},{"key":"117_CR15","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, 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, Washington, DC, USA, August 24\u201327, 2003, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"117_CR16","unstructured":"Khalil EB, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. In: Advances in neural information processing systems 30: annual conference on neural information processing systems 2017, 4\u20139 December 2017, Long Beach, CA, USA, pp 6351\u20136361"},{"key":"117_CR17","unstructured":"Krizhevsky A, Sutskever I, Hinton GE (2012) Imagenet classification with deep convolutional neural networks. In: Advances in neural information processing systems 25: 26th annual conference on neural information processing systems 2012. Proceedings of a meeting held December 3\u20136, 2012, Lake Tahoe, Nevada, United States, pp 1106\u20131114"},{"key":"117_CR18","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon SB (2010) What is twitter, a social network or a news media? In: Proceedings of the 19th international conference on world wide web, WWW 2010, Raleigh, North Carolina, USA, April 26\u201330, 2010, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"117_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen JM, Glance NS (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, San Jose, California, USA, August 12\u201315, 2007, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"117_CR20","doi-asserted-by":"crossref","unstructured":"Li G, Chen S, Feng J, Tan K, Li W (2014) Efficient location-aware influence maximization. In: International conference on management of data, SIGMOD 2014, Snowbird, UT, USA, June 22\u201327, 2014, pp 87\u201398","DOI":"10.1145\/2588555.2588561"},{"issue":"10","key":"117_CR21","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 (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":"117_CR22","doi-asserted-by":"crossref","unstructured":"Li Y, Fan J, Zhang D, Tan K (2017) Discovering your selling points: personalized social influential tags exploration. In: Proceedings of the 2017 ACM international conference on management of data, SIGMOD conference 2017, Chicago, IL, USA, May 14\u201319, 2017, pp 619\u2013634","DOI":"10.1145\/3035918.3035952"},{"issue":"10","key":"117_CR23","first-page":"1070","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan K (2015) Real-time targeted influence maximization for online advertisements. PVLDB 8(10):1070\u20131081","journal-title":"PVLDB"},{"key":"117_CR24","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller MA (2013) Playing atari with deep reinforcement learning. CoRR arxiv:1312.5602"},{"issue":"7540","key":"117_CR25","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 MA, Fidjeland A, Ostrovski G, Petersen S, Beattie C, Sadik A, Antonoglou I, King H, Kumaran D, Wierstra D, Legg S, Hassabis D (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"117_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-15-0105-0_9","volume-title":"Theoretical computer science","author":"S Mo","year":"2019","unstructured":"Mo S, Tian S, Wang L, Peng Z (2019) Minimizing the spread of rumor within budget constraint in online network. In: Sun X, He K, Chen X (eds) Theoretical computer science. Springer, Singapore, pp 131\u2013149"},{"key":"117_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Dinh TN, Thai MT (2016) Cost-aware targeted viral marketing in billion-scale networks. In: 35th annual IEEE international conference on computer communications, INFOCOM 2016, San Francisco, CA, USA, April 10\u201314, 2016, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"117_CR28","unstructured":"Schaul T, Quan J, Antonoglou I, Silver D (2015) Prioritized experience replay. CoRR arxiv:1511.05952"},{"key":"117_CR29","volume-title":"Reinforcement learning\u2014an introduction. Adaptive computation and machine learning","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning\u2014an introduction. Adaptive computation and machine learning. MIT Press, Cambridge"},{"key":"117_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-26072-9_9","volume-title":"Web and Big Data","author":"Shan Tian","year":"2019","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\u2014third international joint conference, APWeb-WAIM 2019, Chengdu, China, August 1\u20133, 2019, Proceedings, Part I, pp 125\u2013140"},{"key":"117_CR31","doi-asserted-by":"crossref","unstructured":"van Hasselt H, Guez A, Silver D (2016) Deep reinforcement learning with double q-learning. In: Proceedings of the thirtieth AAAI conference on artificial intelligence, February 12\u201317, 2016, Phoenix, Arizona, USA, pp 2094\u20132100","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"117_CR32","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. In: Advances in neural information processing systems 28: annual conference on neural information processing systems 2015, December 7\u201312, 2015, Montreal, Quebec, Canada, pp 2692\u20132700"},{"issue":"4","key":"117_CR33","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1007\/s11280-018-0623-9","volume":"22","author":"P Zhang","year":"2019","unstructured":"Zhang P, Bao Z, Niu Y, Zhang Y, Mo S, Geng F, Peng Z (2019) Proactive rumor control in online networks. World Wide Web 22(4):1799\u20131818","journal-title":"World Wide Web"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-020-00117-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-020-00117-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-020-00117-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T20:27:56Z","timestamp":1665952076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-020-00117-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,28]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["117"],"URL":"https:\/\/doi.org\/10.1007\/s41019-020-00117-1","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,28]]},"assertion":[{"value":"7 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}