{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T08:06:12Z","timestamp":1769328372802,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["2221- E-001-014-MY3 and 109-2221-E-001-017-MY2"],"award-info":[{"award-number":["2221- E-001-014-MY3 and 109-2221-E-001-017-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557708","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:29:57Z","timestamp":1665883797000},"page":"4515-4519","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Targeted Influence with Community and Gender-Aware Seeding"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Styczen","sequence":"first","affiliation":[{"name":"Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing-Jyue","family":"Chen","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-Wen","family":"Teng","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvonne-Anne","family":"Pignolet","sequence":"additional","affiliation":[{"name":"The Dfinity Foundation, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lydia","family":"Chen","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"De-Nian","family":"Yang","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"C. Avin B. Keller Z. Lotker C. Mathieu D. Peleg and Y.-A. Pignolet. 2015. Homophily and the glass ceiling effect in social networks. In ACM ITCS.  C. Avin B. Keller Z. Lotker C. Mathieu D. Peleg and Y.-A. Pignolet. 2015. Homophily and the glass ceiling effect in social networks. In ACM ITCS.","DOI":"10.1145\/2688073.2688097"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"C. Borgs M. Brautbar J. Chayes and B. Lucier. 2014. Maximizing social influence in nearly optimal time. In SIAM SODA.  C. Borgs M. Brautbar J. Chayes and B. Lucier. 2014. Maximizing social influence in nearly optimal time. In SIAM SODA.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_2_2_3_1","unstructured":"X. Chen Y. Zhao G. Liu R. Sun X. Zhou and K. Zheng. 2020. Efficient similarity-aware influence maximization in geo-social network. IEEE TKDE (2020).  X. Chen Y. Zhao G. Liu R. Sun X. Zhou and K. Zheng. 2020. Efficient similarity-aware influence maximization in geo-social network. IEEE TKDE (2020)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532549"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"S. Gershtein T. Milo B. Youngmann and G. Zeevi. 2018. IM balanced: Influence maximization under balance constraints. In ACM CIKM.  S. Gershtein T. Milo B. Youngmann and G. Zeevi. 2018. IM balanced: Influence maximization under balance constraints. In ACM CIKM.","DOI":"10.1145\/3269206.3269212"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"P. W. Holland K. B. Laskey and S. Leinhardt. 1983. Stochastic blockmodels: First steps. Soc. Netw. (1983).  P. W. Holland K. B. Laskey and S. Leinhardt. 1983. Stochastic blockmodels: First steps. Soc. Netw. (1983).","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"H. Huang H. Shen Z. Meng H. Chang and H. He. 2019. Community-based influence maximization for viral marketing. APIN (2019).  H. Huang H. Shen Z. Meng H. Chang and H. He. 2019. Community-based influence maximization for viral marketing. APIN (2019).","DOI":"10.1007\/s10489-018-1387-8"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"D. Kempe J. Kleinberg and \u00c9. Tardos. 2003. Maximizing the spread of influence through a social network. In ACM SIGKDD.  D. Kempe J. Kleinberg and \u00c9. Tardos. 2003. Maximizing the spread of influence through a social network. In ACM SIGKDD.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"M. Khajehnejad A. Asgharian Rezaei M. Babaei J. Hoffmann M. Jalili and A. Weller. 2020. Adversarial graph embeddings for fair influence maximization over social networks. In IJCAI.  M. Khajehnejad A. Asgharian Rezaei M. Babaei J. Hoffmann M. Jalili and A. Weller. 2020. Adversarial graph embeddings for fair influence maximization over social networks. In IJCAI.","DOI":"10.24963\/ijcai.2020\/594"},{"key":"e_1_3_2_2_10_1","volume-title":"CSR: A community based spreaders ranking algorithm for influence maximization in social networks. W3J","author":"Kumar S.","year":"2022","unstructured":"S. Kumar , A. Gupta , and I. Khatri . 2022 . CSR: A community based spreaders ranking algorithm for influence maximization in social networks. W3J (2022). S. Kumar, A. Gupta, and I. Khatri. 2022. CSR: A community based spreaders ranking algorithm for influence maximization in social networks. W3J (2022)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"J. Leskovec A. Krause C. Guestrin C. Faloutsos J. VanBriesen and N. Glance. 2007. Cost-effective outbreak detection in networks. In ACM SIGKDD.  J. Leskovec A. Krause C. Guestrin C. Faloutsos J. VanBriesen and N. Glance. 2007. Cost-effective outbreak detection in networks. In ACM SIGKDD.","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_2_12_1","volume-title":"Influence maximization on social graphs: A survey","author":"Li Y.","year":"2018","unstructured":"Y. Li , J. Fan , Y. Wang , and K.-L. Tan . 2018. Influence maximization on social graphs: A survey . IEEE TKDE ( 2018 ). Y. Li, J. Fan, Y. Wang, and K.-L. Tan. 2018. Influence maximization on social graphs: A survey. IEEE TKDE (2018)."},{"key":"e_1_3_2_2_13_1","volume-title":"Community structure in time-dependent, multiscale, and multiplex networks. Science","author":"Mucha P.","year":"2010","unstructured":"P. Mucha , T. Richardson , K. Macon , M. Porter , and J.-P. Onnela . 2010. Community structure in time-dependent, multiscale, and multiplex networks. Science ( 2010 ). P. Mucha, T. Richardson, K. Macon, M. Porter, and J.-P. Onnela. 2010. Community structure in time-dependent, multiscale, and multiplex networks. Science (2010)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"e_1_3_2_2_15_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab.  L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_2_16_1","volume-title":"PHG: A three-phase algorithm for influence maximization based on community structure","author":"Qiu L.","year":"2019","unstructured":"L. Qiu , W. Jia , J. Yu , X. Fan , and W. Gao . 2019 . PHG: A three-phase algorithm for influence maximization based on community structure . IEEE Access ( 2019). L. Qiu, W. Jia, J. Yu, X. Fan, and W. Gao. 2019. PHG: A three-phase algorithm for influence maximization based on community structure. IEEE Access (2019)."},{"key":"e_1_3_2_2_17_1","volume-title":"Robert's Rules of Order 10 ed.)","author":"Robert H. M.","unstructured":"H. M. Robert . 2000. Robert's Rules of Order 10 ed.) . Da Capo Press, London , England . H. M. Robert. 2000. Robert's Rules of Order 10 ed.). Da Capo Press, London, England."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"J. Shang S. Zhou X. Li L. Liu and H. Wu. 2017. CoFIM: A community-based framework for influence maximization on large-scale networks. KBS (2017).  J. Shang S. Zhou X. Li L. Liu and H. Wu. 2017. CoFIM: A community-based framework for influence maximization on large-scale networks. KBS (2017).","DOI":"10.1016\/j.knosys.2016.09.029"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"A.-A. Stoica and A. Chaintreau. 2019. Fairness in social influence maximization. In WWW.  A.-A. Stoica and A. Chaintreau. 2019. Fairness in social influence maximization. In WWW.","DOI":"10.1145\/3308560.3317588"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"A.-A. Stoica J. X. Y. Han and A. Chaintreau. 2020. Seeding network influence in biased networks and the benefits of diversity. In WWW.  A.-A. Stoica J. X. Y. Han and A. Chaintreau. 2020. Seeding network influence in biased networks and the benefits of diversity. In WWW.","DOI":"10.1145\/3366423.3380275"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"A.-A. Stoica C. Riederer and A. Chaintreau. 2018. Algorithmic glass ceiling in social networks: The effects of social recommendations on network diversity. In WWW.  A.-A. Stoica C. Riederer and A. Chaintreau. 2018. Algorithmic glass ceiling in social networks: The effects of social recommendations on network diversity. In WWW.","DOI":"10.1145\/3178876.3186140"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Y.-W. Teng H.-W. Chen D.-N. Yang Y.-A. Pignolet T.-W. Li and L. Chen. 2021. On influencing the influential: Disparity seeding. In ACM CIKM.  Y.-W. Teng H.-W. Chen D.-N. Yang Y.-A. Pignolet T.-W. Li and L. Chen. 2021. On influencing the influential: Disparity seeding. In ACM CIKM.","DOI":"10.1145\/3459637.3482375"},{"key":"e_1_3_2_2_23_1","volume-title":"From Louvain to","author":"Traag V.","year":"2019","unstructured":"V. Traag , L. Waltman , and N. J. van Eck . 2019. From Louvain to Leiden : Guaranteeing well-connected communities. Sci. Rep . ( 2019 ). V. Traag, L. Waltman, and N. J. van Eck. 2019. From Louvain to Leiden: Guaranteeing well-connected communities. Sci. Rep. (2019)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"A. Tsang B. Wilder E. Rice M. Tambe and Y. Zick. 2019. Group-fairness in influence maximization. In IJCAI.  A. Tsang B. Wilder E. Rice M. Tambe and Y. Zick. 2019. Group-fairness in influence maximization. In IJCAI.","DOI":"10.24963\/ijcai.2019\/831"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:49Z","timestamp":1750182529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":24,"alternative-id":["10.1145\/3511808.3557708","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557708","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}