{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:25:39Z","timestamp":1768735539217,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"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":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-024-01311-z","type":"journal-article","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T13:02:09Z","timestamp":1728392529000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Learning graph representations for influence maximization"],"prefix":"10.1007","volume":"14","author":[{"given":"George","family":"Panagopoulos","sequence":"first","affiliation":[]},{"given":"Nikolaos","family":"Tziortziotis","sequence":"additional","affiliation":[]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Fragkiskos D.","family":"Malliaros","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,8]]},"reference":[{"issue":"5439","key":"1311_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"1311_CR2","volume-title":"Bengio","author":"I Bello","year":"2016","unstructured":"Bello I, Pham H, Le QV, Norouzi M (2016) Bengio. S Neural combinatorial optimization with reinforcement learning, CoRR"},{"key":"1311_CR3","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: SIAM symposium on discrete algorithms (SODA), pp. 946\u2013957 . SIAM","DOI":"10.1137\/1.9781611973402.70"},{"key":"1311_CR4","doi-asserted-by":"crossref","unstructured":"Boyd S, Boyd SP, Vandenberghe L (2004) Convex Optimization","DOI":"10.1017\/CBO9780511804441"},{"key":"1311_CR5","doi-asserted-by":"crossref","unstructured":"Cautis B, Maniu S, Tziortziotis N Adaptive influence maximization. In: ACM international conference on knowledge discovery and data mining (SIGKDD) (2019)","DOI":"10.1145\/3292500.3332285"},{"issue":"1","key":"1311_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-016-0033-z","volume":"3","author":"W Chen","year":"2016","unstructured":"Chen W, Lin T (2016) Real-time topic-aware influence maximization using preprocessing. Comput Soc Netw 3(1):1\u201319","journal-title":"Comput Soc Netw"},{"key":"1311_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: ACM international conference on knowledge discovery and data mining (SIGKDD)","DOI":"10.1145\/1557019.1557047"},{"key":"1311_CR8","unstructured":"Chen H, Qiu W, Ou H.-C, An B, Tambe M (2021) Contingency-aware influence maximization: A reinforcement learning approach. In: internationbal conference on uncertainty in artificial intelligence (UAI)"},{"key":"1311_CR9","doi-asserted-by":"crossref","unstructured":"Chen H, Wilder B, Qiu W, An B, Rice E, Tambe M (2023) Complex contagion influence maximization: a reinforcement learning approach. In: international joint conference on artificial intelligence (IJCAI), pp. 5531\u20135540","DOI":"10.24963\/ijcai.2023\/614"},{"key":"1311_CR10","unstructured":"Dai H, Khalil EB, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. arXiv preprint arXiv:1704.01665"},{"key":"1311_CR11","doi-asserted-by":"crossref","unstructured":"Duval A, Malliaros F (2022) Higher-order clustering and pooling for graph neural networks. In: acm international conference on information knowledge management (CIKM), pp. 426\u2013435","DOI":"10.1145\/3511808.3557353"},{"issue":"6","key":"1311_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","volume":"2","author":"C Fan","year":"2020","unstructured":"Fan C, Zeng L, Sun Y, Liu Y-Y (2020) Finding key players in complex networks through deep reinforcement learning. Nat Mach Intell 2(6):317\u2013324","journal-title":"Nat Mach Intell"},{"key":"1311_CR13","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin D (2011) Adaptive submodularity: theory and applications in active learning and stochastic optimization. J Artific Intell Res 42:427\u2013486","journal-title":"J Artific Intell Res"},{"issue":"2","key":"1311_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65(2):026107","journal-title":"Phys Rev E"},{"key":"1311_CR15","doi-asserted-by":"crossref","unstructured":"James G, Witten D, Hastie T, Tibshirani R (2013) An Introduction to Statistical Learning","DOI":"10.1007\/978-1-4614-7138-7"},{"key":"1311_CR16","unstructured":"Jayalath DJ\u00fcr\u00df J, Veli\u010dkovi\u0107 P Recursive algorithmic reasoning. arXiv preprint arXiv:2307.00337 (2023)"},{"key":"1311_CR17","volume-title":"Laurent T","author":"CK Joshi","year":"2019","unstructured":"Joshi CK (2019) Laurent T. Bresson X On learning paradigms for the travelling salesman problem, CoRR"},{"key":"1311_CR18","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: Scalable and robust influence maximization in social networks. In: IEEE international conference on data mining (ICDM)","DOI":"10.1109\/ICDM.2012.79"},{"key":"1311_CR19","unstructured":"Karalias N, Loukas (2020) A Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs. In: Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"1311_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: ACM conference on knowledge discovery and data mining (SIGKDD)","DOI":"10.1145\/956750.956769"},{"key":"1311_CR21","doi-asserted-by":"crossref","unstructured":"Klicpera, J, Bojchevski, A, G\u00fcnnemann, S (2019) Predict then propagate: Graph neural networks meet personalized pagerank. In: international conference on learning representations (ICLR)","DOI":"10.1145\/3394486.3403296"},{"key":"1311_CR22","unstructured":"Kool W, Van\u00a0Hoof H, Welling M (2019) Attention, learn to solve routing problems! In: international conference on learning representations (ICLR)"},{"issue":"1","key":"1311_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec J (2016) Snap: a general-purpose network analysis and graph-mining library. ACM Trans Intell Syst Technol 8(1):1\u201320","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1311_CR24","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: ACM international conference on knowledge discovery and data mining (SIGKDD)","DOI":"10.1145\/1281192.1281239"},{"key":"1311_CR25","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":"1311_CR26","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. arXiv preprint arXiv:1810.10659"},{"key":"1311_CR27","unstructured":"Ling, C, Jiang, J, Wang, J, Thai, M.T, Xue, R, Song, J, Qiu, M, Zhao, L (2023) Deep graph representation learning and optimization for influence maximization. In: International Conference on Machine Learning (ICML), pp. 21350\u201321361 . PMLR"},{"key":"1311_CR28","volume-title":"Saad","author":"AY Lokhov","year":"2019","unstructured":"Lokhov AY (2019) Saad. D Scalable influence estimation without sampling, CoRR"},{"issue":"1","key":"1311_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros FD, Giatsidis C, Papadopoulos AN, Vazirgiannis M (2020) The core decomposition of networks: theory, algorithms and applications. VLDB J 29(1):61\u201392","journal-title":"VLDB J"},{"key":"1311_CR30","first-page":"20000","volume":"33","author":"S Manchanda","year":"2020","unstructured":"Manchanda S, Mittal A, Dhawan A, Medya S, Ranu S, Singh A (2020) Gcomb: learning budget-constrained combinatorial algorithms over billion-sized graphs. Adv Neural Inf Process Syst (NeurIPS) 33:20000\u201320011","journal-title":"Adv Neural Inf Process Syst (NeurIPS)"},{"key":"1311_CR31","doi-asserted-by":"crossref","unstructured":"Manchanda S, Michel, S, Drakulic D, Andreoli JM (2022) On the generalization of neural combinatorial optimization heuristics. In: Joint European conference on machine learning and knowledge discovery in databases (ECML-PKDD), pp. 426\u2013442 Springer","DOI":"10.1007\/978-3-031-26419-1_26"},{"issue":"4","key":"1311_CR32","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1109\/TASE.2015.2461213","volume":"12","author":"N Mathew","year":"2015","unstructured":"Mathew N, Smith SL, Waslander SL (2015) Planning paths for package delivery in heterogeneous multirobot teams. IEEE Trans Autom Sci Eng 12(4):1298\u20131308","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"7862","key":"1311_CR33","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini A, Goldie A, Yazgan M, Jiang JW, Songhori E, Wang S, Lee Y-J, Johnson E, Pathak O, Nazi A (2021) A graph placement methodology for fast chip design. Nature 594(7862):207\u2013212","journal-title":"Nature"},{"issue":"9","key":"1311_CR34","doi-asserted-by":"publisher","first-page":"4398","DOI":"10.1109\/TKDE.2020.3040028","volume":"34","author":"G Panagopoulos","year":"2020","unstructured":"Panagopoulos G, Malliaros F, Vazirgiannis M (2020) Multi-task learning for influence estimation and maximization. IEEE Trans Knowl Data Eng 34(9):4398\u20134409","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1311_CR35","doi-asserted-by":"crossref","unstructured":"Panagopoulos G, Tziortziotis N, Malliaros FD, Vazirgiannis M (2023) Maximizing influence with graph neural networks. In: IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM) (2023)","DOI":"10.1145\/3625007.3627293"},{"key":"1311_CR36","doi-asserted-by":"crossref","unstructured":"Panagopoulos G, Malliaros FD, Vazirgiannis M (2018) Diffugreedy: An influence maximization algorithm based on diffusion cascades. In: international conference on complex networks and their applications (CNA), pp. 392\u2013404 . Springer","DOI":"10.1007\/978-3-030-05411-3_32"},{"key":"1311_CR37","doi-asserted-by":"crossref","unstructured":"Panagopoulos G, Malliaros FD, Vazirgianis M (2020) Influence maximization using influence and susceptibility embeddings. In: international AAAI conference on web and social media (ICWSM), pp. 511\u2013521","DOI":"10.1609\/icwsm.v14i1.7319"},{"key":"1311_CR38","doi-asserted-by":"crossref","unstructured":"Prates M, Avelar PH, Lemos H, Lamb LC, Vardi MY (2019) Learning to solve np-complete problems: a graph neural network for decision tsp. In: AAAI conference on artificial intelligence (AAAI)","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"1311_CR39","doi-asserted-by":"crossref","unstructured":"Seyfi M, Banitalebi-Dehkordi A, Zhou Z, Zhang Y (2023). Exact combinatorial optimization with temporo-attentional graph neural networks. In: Joint European conference on machine learning and knowledge discovery in databases (ECML-PKDD), pp. 268\u2013283 Springer","DOI":"10.1007\/978-3-031-43421-1_16"},{"key":"1311_CR40","unstructured":"Sutton RS, Barto AG (2018) Reinforcement Learning: An Introduction"},{"key":"1311_CR41","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: ACM international conference on management of data (SIGMOD)","DOI":"10.1145\/2723372.2723734"},{"issue":"3","key":"1311_CR42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.106.034316","volume":"106","author":"Y Tian","year":"2022","unstructured":"Tian Y, Lambiotte R (2022) Unifying information propagation models on networks and influence maximization. Phys Rev E 106(3):034316","journal-title":"Phys Rev E"},{"issue":"1","key":"1311_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","volume":"5","author":"S Tian","year":"2020","unstructured":"Tian S, Mo S, Wang L (2020) Deep reinforcement learning-based approach to tackle topic-aware influence maximization. Data Sci Eng 5(1):1\u201311","journal-title":"Data Sci Eng"},{"issue":"5","key":"1311_CR44","first-page":"738","volume":"6","author":"N Touati-Moungla","year":"2012","unstructured":"Touati-Moungla N (2012) Jost V Combinatorial optimization for electric vehicles management. J Energy Power Eng 6(5):738\u2013743","journal-title":"J Energy Power Eng"},{"key":"1311_CR45","doi-asserted-by":"crossref","unstructured":"Van\u00a0Hasselt H, Guez A, Silver D (2016) Deep reinforcement learning with double q-learning. In: AAAI conference on artificial intelligence (AAAI)","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"1311_CR46","unstructured":"Veli\u010dkovi\u0107, P, Badia AP, Budden D, Pascanu R, Banino A, Dashevskiy M, Hadsell R, Blundell C (2022) The clrs algorithmic reasoning benchmark. In: international conference on machine learning (ICML), pp. 22084\u201322102 PMLR"},{"key":"1311_CR47","unstructured":"Vinyals O, Fortunato M (2015) Jaitly. Advances in Neural Information Processing Systems (NeurIPS), N Pointer networks. In"},{"issue":"3","key":"1311_CR48","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Disc 25(3):545\u2013576","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"1311_CR49","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1311_CR50","doi-asserted-by":"crossref","unstructured":"Xia, W, Li, Y, Wu, J, Li, S (2021) Deepis: Susceptibility estimation on social networks. In: ACM international conference on web search and data mining (WSDM)","DOI":"10.1145\/3437963.3441829"},{"issue":"10","key":"1311_CR51","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng 27(10):2770\u20132783","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01311-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01311-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01311-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:44:27Z","timestamp":1740462267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01311-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,8]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1311"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01311-z","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,8]]},"assertion":[{"value":"19 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"203"}}