{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:16Z","timestamp":1775815456609,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,28]]},"DOI":"10.1145\/3696410.3714888","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T22:47:11Z","timestamp":1745362031000},"page":"4673-4683","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Effective Influence Maximization with Priority"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6488-6098","authenticated-orcid":false,"given":"Jinghao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8804-4208","authenticated-orcid":false,"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[{"name":"Liaoning University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3908-6545","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Wollongong, Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6068-5062","authenticated-orcid":false,"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"e_1_3_2_1_2_1","volume-title":"Maximizing Social Influence in Nearly Optimal Time","author":"Borgs Christian","unstructured":"Christian Borgs, Michael Brautbar, Jennifer T. Chayes, and Brendan Lucier. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA. SIAM, 946--957."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ceren Budak Divyakant Agrawal and Amr El Abbadi. 2011. Limiting the spread of misinformation in social networks. In WWW. ACM 665--674.","DOI":"10.1145\/1963405.1963499"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Chi Wang and Yajun Wang. 2010a. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. ACM 1029--1038.","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Yajun Wang and Siyu Yang. 2009. Efficient influence maximization in social networks. In KDD. ACM 199--208.","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_6_1","volume-title":"Scalable Influence Maximization in Social Networks under the Linear Threshold Model","author":"Chen Wei","unstructured":"Wei Chen, Yifei Yuan, and Li Zhang. 2010b. Scalable Influence Maximization in Social Networks under the Linear Threshold Model. In ICDM. IEEE Computer Society, 88--97."},{"key":"e_1_3_2_1_7_1","volume-title":"ICML (1) (JMLR Workshop and Conference Proceedings","author":"Chen Yuxin","unstructured":"Yuxin Chen and Andreas Krause. 2013. Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization. In ICML (1) (JMLR Workshop and Conference Proceedings, Vol. 28). JMLR.org, 160--168."},{"key":"e_1_3_2_1_8_1","volume-title":"ICML (JMLR Workshop and Conference Proceedings","volume":"63","author":"Chen Yuxin","year":"2014","unstructured":"Yuxin Chen, Hiroaki Shioi, Cesar Fuentes Montesinos, Lian Pin Koh, Serge A. Wich, and Andreas Krause. 2014. Active Detection via Adaptive Submodularity. In ICML (JMLR Workshop and Conference Proceedings, Vol. 32). JMLR.org, 55--63."},{"key":"e_1_3_2_1_9_1","volume-title":"Domingos and Matthew Richardson","author":"Pedro","year":"2001","unstructured":"Pedro M. Domingos and Matthew Richardson. 2001. Mining the network value of customers. In KDD. ACM, 57--66."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208436.2208448"},{"key":"e_1_3_2_1_11_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. In ICDM. IEEE Computer Society, 211--220."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617328"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00615-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_3_2_1_16_1","volume-title":"IRIE: Scalable and Robust Influence Maximization in Social Networks","author":"Jung Kyomin","year":"2012","unstructured":"Kyomin Jung, Wooram Heo, and Wei Chen. 2012. IRIE: Scalable and Robust Influence Maximization in Social Networks. In ICDM. IEEE Computer Society, 918--923."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon M. Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. ACM 137--146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983862"},{"key":"e_1_3_2_1_19_1","volume-title":"Glance","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne M. VanBriesen, and Natalie S. Glance. 2007. Cost-effective outbreak detection in networks. In KDD. ACM, 420--429."},{"key":"e_1_3_2_1_20_1","volume-title":"Efficient Dynamic Attributed Graph Generation. CoRR","author":"Li Fan","year":"2024","unstructured":"Fan Li, Xiaoyang Wang, Dawei Cheng, Cong Chen, Ying Zhang, and Xuemin Lin. 2024a. Efficient Dynamic Attributed Graph Generation. CoRR, Vol. abs\/2412.08810 (2024)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3409869"},{"key":"e_1_3_2_1_22_1","volume-title":"Time Constrained Influence Maximization in Social Networks","author":"Liu Bo","unstructured":"Bo Liu, Gao Cong, Dong Xu, and Yifeng Zeng. 2012. Time Constrained Influence Maximization in Social Networks. In ICDM. IEEE Computer Society, 439--448."},{"key":"e_1_3_2_1_23_1","volume-title":"Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks. In SIGMOD Conference. ACM, 695--710","author":"Nguyen Hung T.","unstructured":"Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks. In SIGMOD Conference. ACM, 695--710."},{"key":"e_1_3_2_1_24_1","volume-title":"Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations","author":"Ohsaka Naoto","unstructured":"Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-ichi Kawarabayashi. 2014. Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In AAAI. AAAI Press, 138--144."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3390\/a13080183"},{"key":"e_1_3_2_1_26_1","volume-title":"Domingos","author":"Richardson Matthew","year":"2002","unstructured":"Matthew Richardson and Pedro M. Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In KDD. ACM, 61--70."},{"key":"e_1_3_2_1_27_1","volume-title":"Deep Overlapping Community Search via Subspace Embedding. CoRR","author":"Sima Qing","year":"2024","unstructured":"Qing Sima, Jianke Yu, Xiaoyang Wang, Wenjie Zhang, Ying Zhang, and Xuemin Lin. 2024. Deep Overlapping Community Search via Subspace Embedding. CoRR, Vol. abs\/2404.14692 (2024)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Lichao Sun Weiran Huang Philip S. Yu and Wei Chen. 2018. Multi-Round Influence Maximization. In KDD. ACM 2249--2258.","DOI":"10.1145\/3219819.3220101"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3272636"},{"key":"e_1_3_2_1_30_1","volume-title":"Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning. CoRR","author":"Tan Xingyu","year":"2024","unstructured":"Xingyu Tan, Xiaoyang Wang, Qing Liu, Xiwei Xu, Xin Yuan, and Wenjie Zhang. 2024. Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning. CoRR, Vol. abs\/2410.14211 (2024)."},{"key":"e_1_3_2_1_31_1","volume-title":"Online Processing Algorithms for Influence Maximization. In SIGMOD Conference. ACM, 991--1005","author":"Tang Jing","year":"2018","unstructured":"Jing Tang, Xueyan Tang, Xiaokui Xiao, and Junsong Yuan. 2018. Online Processing Algorithms for Influence Maximization. In SIGMOD Conference. ACM, 991--1005."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_1_34_1","volume-title":"Sequential analysis","author":"Wald Abraham","unstructured":"Abraham Wald. 2004. Sequential analysis. Courier Corporation."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675042"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633472"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2624734"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681997"},{"key":"e_1_3_2_1_39_1","volume-title":"Efficient Maximal Temporal Plex Enumeration","author":"Wu Yanping","unstructured":"Yanping Wu, Renjie Sun, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2024b. Efficient Maximal Temporal Plex Enumeration. In ICDE. IEEE, 3098--3110."},{"key":"e_1_3_2_1_40_1","first-page":"1088","article-title":"2-hop Sampling: Efficient and Effective Influence Estimation","volume":"35","author":"Zhu Yuqing","year":"2023","unstructured":"Yuqing Zhu, Jing Tang, Xueyan Tang, Sibo Wang, and Andrew Lim. 2023. 2-hop Sampling: Efficient and Effective Influence Estimation. IEEE Trans. Knowl. Data Eng., Vol. 35, 2 (2023), 1088--1103.","journal-title":"IEEE Trans. Knowl. Data Eng."}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714888","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:53Z","timestamp":1750295933000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":40,"alternative-id":["10.1145\/3696410.3714888","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714888","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}