{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T21:04:57Z","timestamp":1784149497444,"version":"3.55.0"},"reference-count":81,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.engappai.2026.115648","type":"journal-article","created":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T11:53:39Z","timestamp":1784116419000},"page":"115648","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P5","title":["Forecast to influence: Scalable temporal influence maximization in streaming settings"],"prefix":"10.1016","volume":"181","author":[{"given":"Aaqib","family":"Zahoor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janibul","family":"Bashir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iqra Altaf","family":"Gillani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.engappai.2026.115648_b1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00453-003-1038-1","article-title":"Reinforcement learning with immediate rewards and linear hypotheses","volume":"37","author":"Abe","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/j.engappai.2026.115648_b2","series-title":"Pattern Recognition and Artificial Intelligence: Selected Papers from the 6th Mediterranean Conference on Pattern Recognition and Artificial Intelligence (MedPRAI24)","first-page":"769","article-title":"Harnessing artificial neural networks for predictive KPI insights in infrastructure projects","author":"Al-khazrajy","year":"2025"},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b3","doi-asserted-by":"crossref","DOI":"10.1515\/eng-2022-0485","article-title":"Hybrid approach for cost estimation of sustainable building projects using artificial neural networks","volume":"14","author":"Al-Somaydaii","year":"2024","journal-title":"Open Eng."},{"issue":"2","key":"10.1016\/j.engappai.2026.115648_b4","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.2478\/cee-2024-0074","article-title":"Forecasting models for time and cost performance predicting of infrastructural projects","volume":"20","author":"Aldhamad","year":"2024","journal-title":"Civ. Environ. Eng."},{"key":"10.1016\/j.engappai.2026.115648_b5","doi-asserted-by":"crossref","unstructured":"Ali, K., Wang, C.-Y., Chen, Y.-S., 2018. Boosting reinforcement learning in competitive influence maximization with transfer learning. In: 2018 IEEE\/WIC\/ACM International Conference on Web Intelligence. pp. 395\u2013400.","DOI":"10.1109\/WI.2018.00-62"},{"key":"10.1016\/j.engappai.2026.115648_b6","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. pp. 196\u2013203.","DOI":"10.1109\/ASONAM49781.2020.9381471"},{"key":"10.1016\/j.engappai.2026.115648_b7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ins.2020.03.060","article-title":"Efficient algorithms based on centrality measures for identification of top-K influential users in social networks","volume":"527","author":"Alshahrani","year":"2020","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2026.115648_b8","series-title":"Efficient Learning Machines: Theories, Concepts, and Applications for Engineers and System Designers","first-page":"67","article-title":"Support vector regression","author":"Awad","year":"2015"},{"key":"10.1016\/j.engappai.2026.115648_b9","series-title":"EE-Net: Exploitation-exploration neural networks in contextual bandits","author":"Ban","year":"2021"},{"key":"10.1016\/j.engappai.2026.115648_b10","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. pp. 946\u2013957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"10.1016\/j.engappai.2026.115648_b11","series-title":"X-armed bandits","author":"Bubeck","year":"2011"},{"key":"10.1016\/j.engappai.2026.115648_b12","series-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques","first-page":"412","article-title":"HBMax: Optimizing memory efficiency for parallel influence maximization on multicore architectures","author":"Chen","year":"2023"},{"key":"10.1016\/j.engappai.2026.115648_b13","unstructured":"Chen, H., Qiu, W., Ou, H.-C., An, B., Tambe, M., 2021. Contingency-aware influence maximization: A reinforcement learning approach. In: Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence. pp. 1535\u20131545."},{"key":"10.1016\/j.engappai.2026.115648_b14","series-title":"Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1029","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","author":"Chen","year":"2010"},{"issue":"50","key":"10.1016\/j.engappai.2026.115648_b15","first-page":"1","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.engappai.2026.115648_b16","series-title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","first-page":"5531","article-title":"Complex contagion influence maximization: A reinforcement learning approach","author":"Chen","year":"2023"},{"issue":"2","key":"10.1016\/j.engappai.2026.115648_b17","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","article-title":"ToupleGDD: A fine-designed solution of influence maximization by deep reinforcement learning","volume":"11","author":"Chen","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b18","unstructured":"Dani, V., Hayes, T.P., Kakade, S.M., 2008. Stochastic linear optimization under bandit feedback. In: 21st Annual Conference on Learning Theory. pp. 355\u2013366."},{"issue":"4","key":"10.1016\/j.engappai.2026.115648_b19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.102.042307","article-title":"Influence maximization on temporal networks","volume":"102","author":"Erkol","year":"2020","journal-title":"Phys. Rev. E"},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s12530-024-09640-2","article-title":"Meta-heuristic algorithms for influence maximization: A survey","volume":"16","author":"Fan","year":"2025","journal-title":"Evol. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b21","doi-asserted-by":"crossref","unstructured":"Feng, S., Cong, G., Khan, A., Li, X., Liu, Y., Chee, Y.M., 2018. Inf2vec: Latent representation model for social influence embedding. In: 2018 IEEE 34th International Conference on Data Engineering. pp. 941\u2013952.","DOI":"10.1109\/ICDE.2018.00089"},{"key":"10.1016\/j.engappai.2026.115648_b22","series-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"771","article-title":"Influence maximization via graph neural bandits","author":"Feng","year":"2024"},{"key":"10.1016\/j.engappai.2026.115648_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.111915","article-title":"Influence maximization on competitive and complementary independent cascade model based on rating-aware bidirectional gated recurrent unit","volume":"160","author":"Fu","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.115648_b24","series-title":"Proceedings of the 20th International Conference Companion on World Wide Web","first-page":"47","article-title":"CELF++: Optimizing the greedy algorithm for influence maximization in social networks","author":"Goyal","year":"2011"},{"key":"10.1016\/j.engappai.2026.115648_b25","doi-asserted-by":"crossref","unstructured":"Graves, A., Fern\u00e1ndez, S., Schmidhuber, J., 2005. Bidirectional LSTM networks for improved phoneme classification and recognition. In: Proceedings of the International Conference on Artificial Neural Networks. pp. 799\u2013804.","DOI":"10.1007\/11550907_126"},{"issue":"6","key":"10.1016\/j.engappai.2026.115648_b26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10618-025-01133-3","article-title":"Topic-aware influence maximization with deep reinforcement learning and graph attention networks","volume":"39","author":"Halal","year":"2025","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.engappai.2026.115648_b27","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b28","doi-asserted-by":"crossref","unstructured":"Iacob, A., Cautis, B., Maniu, S., 2022. Contextual bandits for advertising campaigns: A diffusion-model independent approach. In: Proceedings of the 2022 SIAM International Conference on Data Mining. pp. 513\u2013521.","DOI":"10.1137\/1.9781611977172.58"},{"key":"10.1016\/j.engappai.2026.115648_b29","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.engappai.2026.115648_b30","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3274670","article-title":"Algorithms for online influencer marketing","volume":"13","author":"Lagr\u00e9e","year":"2018","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.engappai.2026.115648_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.orl.2025.107309","article-title":"Influence maximization independent of seed set size","volume":"62","author":"Lakshmanan","year":"2025","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1232722.1232727","article-title":"The dynamics of viral marketing","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Web"},{"key":"10.1016\/j.engappai.2026.115648_b34","series-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"420","article-title":"Cost-effective outbreak detection in networks","author":"Leskovec","year":"2007"},{"key":"10.1016\/j.engappai.2026.115648_b35","series-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"issue":"9","key":"10.1016\/j.engappai.2026.115648_b36","first-page":"1","article-title":"A survey on influence maximization: From an ML-based combinatorial optimization","volume":"17","author":"Li","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"10.1016\/j.engappai.2026.115648_b37","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","article-title":"PIANO: Influence maximization meets deep reinforcement learning","volume":"10","author":"Li","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b38","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J., 2003. The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management. pp. 556\u2013559.","DOI":"10.1145\/956863.956972"},{"key":"10.1016\/j.engappai.2026.115648_b39","doi-asserted-by":"crossref","unstructured":"Lin, S.-C., Lin, S.-D., Chen, M.-S., 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. pp. 695\u2013704.","DOI":"10.1145\/2783258.2783392"},{"key":"10.1016\/j.engappai.2026.115648_b40","series-title":"International Conference on Machine Learning","first-page":"22559","article-title":"Contextual combinatorial bandits with probabilistically triggered arms","author":"Liu","year":"2023"},{"key":"10.1016\/j.engappai.2026.115648_b41","first-page":"20000","article-title":"GCOMB: Learning budget-constrained combinatorial algorithms over billion-sized graphs","volume":"33","author":"Manchanda","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b42","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1109\/TNSE.2025.3598819","article-title":"Achieving fair influence maximization: Integrating privacy, diversity, and temporal fairness","volume":"13","author":"Meena","year":"2026","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.engappai.2026.115648_b43","doi-asserted-by":"crossref","unstructured":"Minutoli, M., Drocco, M., Halappanavar, M., Tumeo, A., Kalyanaraman, A., 2020a. cuRipples: Influence maximization on multi-GPU systems. In: Proceedings of the 34th ACM International Conference on Supercomputing. pp. 1\u201311.","DOI":"10.1145\/3392717.3392750"},{"key":"10.1016\/j.engappai.2026.115648_b44","doi-asserted-by":"crossref","unstructured":"Minutoli, M., Halappanavar, M., Kalyanaraman, A., Sathanur, A., Mcclure, R., McDermott, J., 2019. Fast and scalable implementations of influence maximization algorithms. In: 2019 IEEE International Conference on Cluster Computing. pp. 1\u201312.","DOI":"10.1109\/CLUSTER.2019.8890991"},{"key":"10.1016\/j.engappai.2026.115648_b45","doi-asserted-by":"crossref","unstructured":"Minutoli, M., Sambaturu, P., Halappanavar, M., Tumeo, A., Kalyananaraman, A., Vullikanti, A., 2020b. PREEMPT: Scalable epidemic interventions using submodular optimization on multi-GPU systems. In: SC20: International Conference for High Performance Computing, Networking, Storage and Analysis. pp. 1\u201315.","DOI":"10.1109\/SC41405.2020.00059"},{"key":"10.1016\/j.engappai.2026.115648_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.104900","article-title":"GraMeR: Graph meta reinforcement learning for multi-objective influence maximization","volume":"192","author":"Munikoti","year":"2024","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.engappai.2026.115648_b47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-018-0056-8","article-title":"Extended methods for influence maximization in dynamic networks","volume":"5","author":"Murata","year":"2018","journal-title":"Comput. Soc. Netw."},{"key":"10.1016\/j.engappai.2026.115648_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113553","article-title":"A residual graph reinforcement learning for budgeted influence maximization","volume":"320","author":"Ou","year":"2025","journal-title":"Knowl.-Based Syst."},{"issue":"9","key":"10.1016\/j.engappai.2026.115648_b49","doi-asserted-by":"crossref","first-page":"4398","DOI":"10.1109\/TKDE.2020.3040028","article-title":"Multi-task learning for influence estimation and maximization","volume":"34","author":"Panagopoulos","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.engappai.2026.115648_b50","doi-asserted-by":"crossref","unstructured":"Panagopoulos, G., Tziortziotis, N., Vazirgiannis, M., Malliaros, F., 2023. Maximizing influence with graph neural networks. In: Proceedings of the International Conference on Advances in Social Networks Analysis and Mining. pp. 237\u2013244.","DOI":"10.1145\/3625007.3627293"},{"key":"10.1016\/j.engappai.2026.115648_b51","first-page":"5363","article-title":"EvolveGCN: Evolving graph convolutional networks for dynamic graphs","volume":"vol. 34","author":"Pareja","year":"2020"},{"key":"10.1016\/j.engappai.2026.115648_b52","doi-asserted-by":"crossref","unstructured":"Qi, Y., Ban, Y., He, J., 2023. Graph neural bandits. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. pp. 1920\u20131931.","DOI":"10.1145\/3580305.3599371"},{"issue":"11","key":"10.1016\/j.engappai.2026.115648_b53","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0206318","article-title":"MATI: An efficient algorithm for influence maximization in social networks","volume":"13","author":"Rossi","year":"2018","journal-title":"PLoS One"},{"issue":"7","key":"10.1016\/j.engappai.2026.115648_b54","first-page":"3881","article-title":"A scalable algorithm for fair influence maximization with unbiased estimator","volume":"37","author":"Rui","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.engappai.2026.115648_b55","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/moor.1100.0446","article-title":"Linearly parameterized bandits","volume":"35","author":"Rusmevichientong","year":"2010","journal-title":"Math. Oper. Res."},{"issue":"15","key":"10.1016\/j.engappai.2026.115648_b56","doi-asserted-by":"crossref","first-page":"18294","DOI":"10.1007\/s10489-022-04403-5","article-title":"Local community detection based on influence maximization in dynamic networks","volume":"53","author":"Samie","year":"2023","journal-title":"Appl. Intell."},{"issue":"2","key":"10.1016\/j.engappai.2026.115648_b57","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TKDE.2016.2620141","article-title":"Influential node tracking on dynamic social network: An interchange greedy approach","volume":"29","author":"Song","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.engappai.2026.115648_b58","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":"10.1016\/j.engappai.2026.115648_b59","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":"10.1016\/j.engappai.2026.115648_b60","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: Asia-Pacific Web and Web-Age Information Management Joint International Conference on Web and Big Data. pp. 125\u2013140.","DOI":"10.1007\/978-3-030-26072-9_9"},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b61","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","article-title":"Adaptive influence maximization in dynamic social networks","volume":"25","author":"Tong","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.engappai.2026.115648_b62","series-title":"Finite-time analysis of kernelised contextual bandits","author":"Valko","year":"2013"},{"key":"10.1016\/j.engappai.2026.115648_b63","doi-asserted-by":"crossref","first-page":"8987","DOI":"10.1038\/s41598-026-37640-6","article-title":"Temporal influence maximization via continuous-time graph neural networks and deep reinforcement learning","volume":"16","author":"Wang","year":"2026","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b64","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s11227-024-06621-9","article-title":"DGN: Influence maximization based on deep reinforcement learning","volume":"81","author":"Wang","year":"2024","journal-title":"J. Supercomput."},{"key":"10.1016\/j.engappai.2026.115648_b65","article-title":"Online influence maximization under independent cascade model with semi-bandit feedback","volume":"30","author":"Wen","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b66","doi-asserted-by":"crossref","unstructured":"Xia, W., Li, Y., Wu, J., Li, S., 2021. DeepIS: Susceptibility estimation on social networks. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining. pp. 761\u2013769.","DOI":"10.1145\/3437963.3441829"},{"key":"10.1016\/j.engappai.2026.115648_b67","series-title":"LOFA: Online influence maximization under full-bandit feedback using lazy forward selection","author":"Xu","year":"2026"},{"key":"10.1016\/j.engappai.2026.115648_b68","doi-asserted-by":"crossref","unstructured":"Yalavarthi, V.K., Khan, A., 2018. Steering top-K influencers in dynamic graphs via local updates. In: 2018 IEEE International Conference on Big Data. pp. 576\u2013583.","DOI":"10.1109\/BigData.2018.8621873"},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b69","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s41109-024-00625-3","article-title":"Influence maximization on temporal networks: A review","volume":"9","author":"Yanchenko","year":"2024","journal-title":"Appl. Netw. Sci."},{"key":"10.1016\/j.engappai.2026.115648_b70","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123491","article-title":"Neural attentive influence maximization model in social networks via reverse influence sampling on historical behavior sequences","volume":"249","author":"Yang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.115648_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.113175","article-title":"Influence maximization in social networks based on long-term and short-term interest fusion reverse influence sampling","volume":"164","author":"Yang","year":"2026","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b72","doi-asserted-by":"crossref","first-page":"11515","DOI":"10.1038\/s41598-026-41731-9","article-title":"A deep reinforcement learning framework for influence maximization problem on large-scale social networks","volume":"16","author":"Yang","year":"2026","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.engappai.2026.115648_b73","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s12293-026-00494-6","article-title":"TOTEM: A unified framework for topic-aware temporal influence maximization with dual-interaction diffusion in social networks","volume":"18","author":"Yin","year":"2026","journal-title":"Memetic Comput."},{"key":"10.1016\/j.engappai.2026.115648_b74","series-title":"Proceedings of the 7th Joint International Conference on Data Science & Management of Data (CODS-COMAD \u201924)","first-page":"580","article-title":"TBCELF: Temporal budget-aware influence maximization","author":"Zahoor","year":"2024"},{"key":"10.1016\/j.engappai.2026.115648_b75","series-title":"Diffusion models for influence maximization on temporal networks: A guide to make the best choice","author":"Zahoor","year":"2025"},{"key":"10.1016\/j.engappai.2026.115648_b76","doi-asserted-by":"crossref","first-page":"2219","DOI":"10.1109\/TNSE.2025.3611330","article-title":"Beyond binary opinions: A deep reinforcement learning-based approach to uncertainty-aware competitive influence maximization","volume":"13","author":"Zhang","year":"2026","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"8","key":"10.1016\/j.engappai.2026.115648_b77","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.3390\/math10081341","article-title":"Influence maximization based on snapshot prediction in dynamic online social networks","volume":"10","author":"Zhang","year":"2022","journal-title":"Mathematics"},{"key":"10.1016\/j.engappai.2026.115648_b78","unstructured":"Zhou, D., Li, L., Gu, Q., 2020. Neural contextual bandits with UCB-based exploration. In: Proceedings of the 37th International Conference on Machine Learning. pp. 11492\u201311502."},{"issue":"6","key":"10.1016\/j.engappai.2026.115648_b79","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1109\/TCSS.2019.2938575","article-title":"Group influence maximization problem in social networks","volume":"6","author":"Zhu","year":"2019","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.engappai.2026.115648_b80","doi-asserted-by":"crossref","unstructured":"Zhu, J., Ghosh, S., Wu, W., Gao, C., 2019b. Profit maximization under group influence model in social networks. In: International Conference on Computational Data and Social Networks. pp. 108\u2013119.","DOI":"10.1007\/978-3-030-34980-6_13"},{"key":"10.1016\/j.engappai.2026.115648_b81","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126384","article-title":"BiGDN: An end-to-end influence maximization framework based on deep reinforcement learning and graph neural networks","volume":"270","author":"Zhu","year":"2025","journal-title":"Expert Syst. Appl."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626019329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626019329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T20:07:24Z","timestamp":1784146044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626019329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":81,"alternative-id":["S0952197626019329"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.115648","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Forecast to influence: Scalable temporal influence maximization in streaming settings","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.115648","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115648"}}