{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:17:33Z","timestamp":1785543453780,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"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":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449799","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:02:07Z","timestamp":1622746927000},"page":"1340-1350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Fair and Representative Subset Selection from Data Streams"],"prefix":"10.1145","author":[{"given":"Yanhao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Fabbri","sequence":"additional","affiliation":[{"name":"Pompeu Fabra University & Eurecat, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Mathioudakis","sequence":"additional","affiliation":[{"name":"University of Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Zeinab Abbassi Vahab\u00a0S. Mirrokni and Mayur Thakur. 2013. Diversity maximization under matroid constraints. In KDD. 32\u201340.  Zeinab Abbassi Vahab\u00a0S. Mirrokni and Mayur Thakur. 2013. Diversity maximization under matroid constraints. In KDD. 32\u201340.","DOI":"10.1145\/2487575.2487636"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints","volume":"6","author":"Alaluf Naor","year":"2020","unstructured":"Naor Alaluf , Alina Ene , Moran Feldman , Huy\u00a0 L. Nguyen , and Andrew Suh . 2020 . Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints . In ICALP. 6 : 1 \u2013 6 :19. Naor Alaluf, Alina Ene, Moran Feldman, Huy\u00a0L. Nguyen, and Andrew Suh. 2020. Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. In ICALP. 6:1\u20136:19.","journal-title":"ICALP."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming Submodular Maximization: Massive Data Summarization on the Fly. In KDD. 671\u2013680.  Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming Submodular Maximization: Massive Data Summarization on the Fly. In KDD. 671\u2013680.","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_5_1","unstructured":"L.\u00a0Elisa Celis Vijay Keswani Damian Straszak Amit Deshpande Tarun Kathuria and Nisheeth\u00a0K. Vishnoi. 2018. Fair and Diverse DPP-Based Data Summarization. In ICML. 715\u2013724.  L.\u00a0Elisa Celis Vijay Keswani Damian Straszak Amit Deshpande Tarun Kathuria and Nisheeth\u00a0K. Vishnoi. 2018. Fair and Diverse DPP-Based Data Summarization. In ICML. 715\u2013724."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0900-7"},{"key":"e_1_3_2_1_7_1","unstructured":"T.-H.\u00a0Hubert Chan Zhiyi Huang Shaofeng\u00a0H.-C. Jiang Ning Kang and Zhihao\u00a0Gavin Tang. 2017. Online Submodular Maximization with Free Disposal: Randomization Beats \u00bc for Partition Matroids. In SODA. 1204\u20131223.  T.-H.\u00a0Hubert Chan Zhiyi Huang Shaofeng\u00a0H.-C. Jiang Ning Kang and Zhihao\u00a0Gavin Tang. 2017. Online Submodular Maximization with Free Disposal: Randomization Beats \u00bc for Partition Matroids. In SODA. 1204\u20131223."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Chandra Chekuri Shalmoli Gupta and Kent Quanrud. 2015. Streaming Algorithms for Submodular Function Maximization. In ICALP. 318\u2013330.  Chandra Chekuri Shalmoli Gupta and Kent Quanrud. 2015. Streaming Algorithms for Submodular Function Maximization. In ICALP. 318\u2013330.","DOI":"10.1007\/978-3-662-47672-7_26"},{"key":"e_1_3_2_1_9_1","unstructured":"Ashish Chiplunkar Sagar Kale and Sivaramakrishnan\u00a0Natarajan Ramamoorthy. 2020. How to Solve Fair k-Center in Massive Data Models. In ICML. 6887\u20136896.  Ashish Chiplunkar Sagar Kale and Sivaramakrishnan\u00a0Natarajan Ramamoorthy. 2020. How to Solve Fair k-Center in Massive Data Models. In ICML. 6887\u20136896."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376898"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359274"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto Silvio Lattanzi Sergei Vassilvitskii and Morteza Zadimoghaddam. 2017. Submodular Optimization Over Sliding Windows. In WWW. 421\u2013430.  Alessandro Epasto Silvio Lattanzi Sergei Vassilvitskii and Morteza Zadimoghaddam. 2017. Submodular Optimization Over Sliding Windows. In WWW. 421\u2013430.","DOI":"10.1145\/3038912.3052699"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_14_1","volume-title":"Do Less","author":"Feldman Moran","unstructured":"Moran Feldman , Amin Karbasi , and Ehsan Kazemi . 2018. Do Less , Get More : Streaming Submodular Maximization with Subsampling. In NeurIPS. 730\u2013740. Moran Feldman, Amin Karbasi, and Ehsan Kazemi. 2018. Do Less, Get More: Streaming Submodular Maximization with Subsampling. In NeurIPS. 730\u2013740."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Marshall\u00a0L. Fisher George\u00a0L. Nemhauser and Laurence\u00a0A. Wolsey. 1978. An analysis of approximations for maximizing submodular set functions\u2014II. In Polyhedral Combinatorics Michel\u00a0L. Balinski and Alan\u00a0J. Hoffman (Eds.). Springer Berlin Heidelberg 73\u201387.  Marshall\u00a0L. Fisher George\u00a0L. Nemhauser and Laurence\u00a0A. Wolsey. 1978. An analysis of approximations for maximizing submodular set functions\u2014II. In Polyhedral Combinatorics Michel\u00a0L. Balinski and Alan\u00a0J. Hoffman (Eds.). Springer Berlin Heidelberg 73\u201387.","DOI":"10.1007\/BFb0121195"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0373-y"},{"key":"e_1_3_2_1_17_1","unstructured":"Ryan Gomes and Andreas Krause. 2010. Budgeted Nonparametric Learning from Data Streams. In ICML. 391\u2013398.  Ryan Gomes and Andreas Krause. 2010. Budgeted Nonparametric Learning from Data Streams. In ICML. 391\u2013398."},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints","volume":"62","author":"Huang Chien-Chung","year":"2020","unstructured":"Chien-Chung Huang , Theophile Thiery , and Justin Ward . 2020 . Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints . In APPROX\/RANDOM. 62 : 1 \u2013 62 :19. Chien-Chung Huang, Theophile Thiery, and Justin Ward. 2020. Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints. In APPROX\/RANDOM. 62:1\u201362:19.","journal-title":"APPROX\/RANDOM."},{"key":"e_1_3_2_1_19_1","unstructured":"Matthew Jones Huy L\u00ea\u00a0Nguy\u00ean and Thy Nguyen. 2020. Fair k-Centers via Maximum Matching. In ICML. 7460\u20137469.  Matthew Jones Huy L\u00ea\u00a0Nguy\u00ean and Thy Nguyen. 2020. Fair k-Centers via Maximum Matching. In ICML. 7460\u20137469."},{"key":"e_1_3_2_1_20_1","unstructured":"Matthew Kay Cynthia Matuszek and Sean\u00a0A. Munson. 2015. Unequal Representation and Gender Stereotypes in Image Search Results for Occupations. In CHI. 3819\u20133828.  Matthew Kay Cynthia Matuszek and Sean\u00a0A. Munson. 2015. Unequal Representation and Gender Stereotypes in Image Search Results for Occupations. In CHI. 3819\u20133828."},{"key":"e_1_3_2_1_21_1","unstructured":"Ehsan Kazemi Marko Mitrovic Morteza Zadimoghaddam Silvio Lattanzi and Amin Karbasi. 2019. Submodular Streaming in All Its Glory: Tight Approximation Minimum Memory and Low Adaptive Complexity. In ICML. 3311\u20133320.  Ehsan Kazemi Marko Mitrovic Morteza Zadimoghaddam Silvio Lattanzi and Amin Karbasi. 2019. Submodular Streaming in All Its Glory: Tight Approximation Minimum Memory and Low Adaptive Complexity. In ICML. 3311\u20133320."},{"key":"e_1_3_2_1_22_1","unstructured":"Ehsan Kazemi Morteza Zadimoghaddam and Amin Karbasi. 2018. Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. In ICML. 2549\u20132558.  Ehsan Kazemi Morteza Zadimoghaddam and Amin Karbasi. 2018. Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. In ICML. 2549\u20132558."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon\u00a0M. Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. 137\u2013146.  David Kempe Jon\u00a0M. Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. 137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_24_1","unstructured":"Matth\u00e4us Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML. 3448\u20133457.  Matth\u00e4us Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML. 3448\u20133457."},{"key":"e_1_3_2_1_25_1","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Krause Andreas","unstructured":"Andreas Krause and Daniel Golovin . 2014. Submodular Function Maximization . In Tractability: Practical Approaches to Hard Problems , Lucas Bordeaux, Youssef Hamadi, and Pushmeet Kohli(Eds.). Cambridge University Press , 71\u2013104. Andreas Krause and Daniel Golovin. 2014. Submodular Function Maximization. In Tractability: Practical Approaches to Hard Problems, Lucas Bordeaux, Youssef Hamadi, and Pushmeet Kohli(Eds.). Cambridge University Press, 71\u2013104."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809814"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Andreas Krause Carlos Guestrin Christos Faloutsos Jeanne\u00a0M. Van Briesen and Natalie\u00a0S. Glance. 2007. Cost-effective outbreak detection in networks. In KDD. 420\u2013429.  Jure Leskovec Andreas Krause Carlos Guestrin Christos Faloutsos Jeanne\u00a0M. Van Briesen and Natalie\u00a0S. Glance. 2007. Cost-effective outbreak detection in networks. In KDD. 420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_28_1","unstructured":"Erik\u00a0M. Lindgren Shanshan Wu and Alexandros\u00a0G. Dimakis. 2016. Leveraging Sparsity for Efficient Submodular Data Summarization. In NIPS. 3414\u20133422.  Erik\u00a0M. Lindgren Shanshan Wu and Alexandros\u00a0G. Dimakis. 2016. Leveraging Sparsity for Efficient Submodular Data Summarization. In NIPS. 3414\u20133422."},{"key":"e_1_3_2_1_29_1","first-page":"2449","article-title":"Deletion-Robust Submodular Maximization: Data Summarization with","author":"Mirzasoleiman Baharan","year":"2017","unstructured":"Baharan Mirzasoleiman , Amin Karbasi , and Andreas Krause . 2017 . Deletion-Robust Submodular Maximization: Data Summarization with \u201dthe Right to be Forgotten\u201d. In ICML. 2449 \u2013 2458 . Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause. 2017. Deletion-Robust Submodular Maximization: Data Summarization with \u201dthe Right to be Forgotten\u201d. In ICML. 2449\u20132458.","journal-title":"In ICML."},{"key":"e_1_3_2_1_30_1","unstructured":"Slobodan Mitrovic Ilija Bogunovic Ashkan Norouzi-Fard Jakub Tarnawski and Volkan Cevher. 2017. Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. In NIPS. 4557\u20134566.  Slobodan Mitrovic Ilija Bogunovic Ashkan Norouzi-Fard Jakub Tarnawski and Volkan Cevher. 2017. Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. In NIPS. 4557\u20134566."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_32_1","unstructured":"Ashkan Norouzi-Fard Jakub Tarnawski Slobodan Mitrovic Amir Zandieh Aidasadat Mousavifar and Ola Svensson. 2018. Beyond 1\/2-Approximation for Submodular Maximization on Massive Data Streams. In ICML. 3826\u20133835.  Ashkan Norouzi-Fard Jakub Tarnawski Slobodan Mitrovic Amir Zandieh Aidasadat Mousavifar and Ola Svensson. 2018. Beyond 1\/2-Approximation for Submodular Maximization on Massive Data Streams. In ICML. 3826\u20133835."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Barna Saha and Lise Getoor. 2009. On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch. In SDM. 697\u2013708.  Barna Saha and Lise Getoor. 2009. On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch. In SDM. 697\u2013708.","DOI":"10.1137\/1.9781611972795.60"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Dimitris Serbos Shuyao Qi Nikos Mamoulis Evaggelia Pitoura and Panayiotis Tsaparas. 2017. Fairness in Package-to-Group Recommendations. In WWW. 371\u2013379.  Dimitris Serbos Shuyao Qi Nikos Mamoulis Evaggelia Pitoura and Panayiotis Tsaparas. 2017. Fairness in Package-to-Group Recommendations. In WWW. 371\u2013379.","DOI":"10.1145\/3038912.3052612"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ana-Andreea Stoica Jessy\u00a0Xinyi Han and Augustin Chaintreau. 2020. Seeding Network Influence in Biased Networks and the Benefits of Diversity. In WWW. 2089\u20132098.  Ana-Andreea Stoica Jessy\u00a0Xinyi Han and Augustin Chaintreau. 2020. Seeding Network Influence in Biased Networks and the Benefits of Diversity. In WWW. 2089\u20132098.","DOI":"10.1145\/3366423.3380275"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2854182"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Junzhou Zhao Shuo Shang Pinghui Wang John C.\u00a0S. Lui and Xiangliang Zhang. 2019. Submodular Optimization over Streams with Inhomogeneous Decays. In AAAI. 5861\u20135868.  Junzhou Zhao Shuo Shang Pinghui Wang John C.\u00a0S. Lui and Xiangliang Zhang. 2019. Submodular Optimization over Streams with Inhomogeneous Decays. In AAAI. 5861\u20135868.","DOI":"10.1609\/aaai.v33i01.33015861"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:22Z","timestamp":1750195462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":40,"alternative-id":["10.1145\/3442381.3449799","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449799","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}