{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T22:00:43Z","timestamp":1772143243925,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10489-022-03854-0","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T21:12:03Z","timestamp":1657660323000},"page":"6909-6925","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["BatchedGreedy: A batch processing approach for influence maximization with candidate constraint"],"prefix":"10.1007","volume":"53","author":[{"given":"Xiaowei","family":"Han","sequence":"first","affiliation":[]},{"given":"Xiaopeng","family":"Yao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8728-3012","authenticated-orcid":false,"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"key":"3854_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3854_CR2","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Van Briesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: KDD, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3854_CR3","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: SODA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"3854_CR4","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time:, A martingale approach. In: SIGMOD, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"3854_CR5","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: CIKM, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"3854_CR6","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In: WWW, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"3854_CR7","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: SIGIR, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"3854_CR8","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection, http:\/\/snap.stanford.edu\/data"},{"key":"3854_CR9","doi-asserted-by":"crossref","unstructured":"Arora A, Galhotra S, Ranu S (2017) Debunking the myths of influence maximization:, An in-depth benchmarking study. In: SIGMOD, pp 651\u2013666","DOI":"10.1145\/3218967"},{"key":"3854_CR10","doi-asserted-by":"crossref","unstructured":"Feng S, Cong G, Khan A, Li X, Liu Y, Chee YM (2018) Inf2vec: Latent representation model for social influence embedding. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, pp 941\u2013952","DOI":"10.1109\/ICDE.2018.00089"},{"key":"3854_CR11","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization:, Combining scalability and efficiency with opinion-aware models. In: SIGMOD, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"key":"3854_CR12","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 Info Process Syst, 33:20 000\u201320 011"},{"key":"3854_CR13","unstructured":"Chen H, Qiu W, Ou H, An B, Tambe M (2021) Contingency-aware influence maximization: A reinforcement learning approach. In: Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2021, Virtual Event, 27-30 July 2021, ser. Proceedings of Machine Learning Research, C. P. de Campos, M. H. Maathuis, and E. Quaeghebeur, Eds., vol 161. AUAI Press, pp 1535\u20131545"},{"key":"3854_CR14","unstructured":"Meirom EA, Maron H, Mannor S, Chechik G (2021) Controlling graph dynamics with reinforcement learning and graph neural networks. In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, ser. Proceedings of Machine Learning Research, M. Meila and T. Zhang, Eds., vol 139. PMLR, pp 7565\u20137577"},{"key":"3854_CR15","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.ins.2020.08.093","volume":"546","author":"A Cali\u00f2","year":"2021","unstructured":"Cali\u00f2 A, Tagarelli A (2021) Attribute based diversification of seeds for targeted influence maximization. Inf Sci 546:1273\u20131305","journal-title":"Inf Sci"},{"issue":"6","key":"3854_CR16","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSS.2019.2938575","volume":"6","author":"J Zhu","year":"2019","unstructured":"Zhu J, Ghosh S, Wu W (2019) Group influence maximization problem in social networks. IEEE Trans Comput Soc Syst 6(6):1156\u20131164","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"5","key":"3854_CR17","first-page":"2208","volume":"33","author":"X Yin","year":"2021","unstructured":"Yin X, Hu X, Chen Y, Yuan X, Li B (2021) 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":"10","key":"3854_CR18","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2021.3066215","volume":"32","author":"S Shahrouz","year":"2021","unstructured":"Shahrouz S, Salehkaleybar S, Hashemi M (2021) Gim: GPU accelerated ris-based influence maximization algorithm. IEEE Trans Parallel Distributed Syst 32(10):2386\u20132399","journal-title":"IEEE Trans Parallel Distributed Syst"},{"key":"3854_CR19","doi-asserted-by":"crossref","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, vol 15(3), apr","DOI":"10.1145\/3442341"},{"issue":"1","key":"3854_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"3854_CR21","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"3","key":"3854_CR22","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1007\/s11280-020-00792-0","volume":"23","author":"H Min","year":"2020","unstructured":"Min H, Cao J, Yuan T, Liu B (2020) Topic based time-sensitive influence maximization in online social networks. World Wide Web 23(3):1831\u20131859","journal-title":"World Wide Web"},{"key":"3854_CR23","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275:1601\u20131613","journal-title":"Neurocomputing"},{"issue":"7","key":"3854_CR24","doi-asserted-by":"publisher","first-page":"805","DOI":"10.14778\/3067421.3067429","volume":"10","author":"Y Wang","year":"2017","unstructured":"Wang Y, Fan Q, Li Y, Tan K (2017) Real-time influence maximization on dynamic social streams. Proc VLDB Endow 10(7):805\u2013816","journal-title":"Proc VLDB Endow"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03854-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03854-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03854-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T04:37:12Z","timestamp":1677472632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03854-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["3854"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03854-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"5 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}