{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:40:11Z","timestamp":1750293611317,"version":"3.41.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["788893"],"award-info":[{"award-number":["788893"]}]},{"name":"AMDROMA","award":["H2020RIA"],"award-info":[{"award-number":["H2020RIA"]}]},{"name":"SoBigData++","award":["871042"],"award-info":[{"award-number":["871042"]}]},{"name":"PNRR MUR","award":["PE0000013-FAIR"],"award-info":[{"award-number":["PE0000013-FAIR"]}]},{"name":"PNRR MUR","award":["IR0000013-SoBigData.it"],"award-info":[{"award-number":["IR0000013-SoBigData.it"]}]},{"name":"MUR PRIN","award":["2022EKNE5K"],"award-info":[{"award-number":["2022EKNE5K"]}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["101057746"],"award-info":[{"award-number":["101057746"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Swiss State Secretariat for Education, Research and Innovation","award":["22 00058"],"award-info":[{"award-number":["22 00058"]}]},{"name":"UK","award":["10061955"],"award-info":[{"award-number":["10061955"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2025,2,28]]},"abstract":"<jats:p>The goal of recommender systems is to provide to users suggestions that match their interests, with the eventual goal of increasing their satisfaction, as measured by the number of transactions (clicks, purchases, and so forth). Often, this leads to providing recommendations that are of a particular type. For some contexts (e.g., browsing videos for information) this may be undesirable, as it may enforce the creation of filter bubbles. This is because of the existence of underlying bias in the input data of prior user actions.<\/jats:p>\n          <jats:p>\n            Reducing hidden bias in the data and ensuring fairness in algorithmic data analysis has recently received significant attention. In this article, we consider both the densest subgraph and the\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -clustering problem, two primitives that are being used by some recommender systems. We are given a coloring on the nodes, respectively the points, and aim to compute a\n            <jats:italic>fair<\/jats:italic>\n            solution\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(S\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            , consisting of a subgraph or a clustering, such that none of the colors is disparately impacted by the solution.\n          <\/jats:p>\n          <jats:p>\n            Unfortunately, introducing fair solutions typically makes these problems substantially more difficult. Unlike the unconstrained densest subgraph problem, which is solvable in polynomial time, the fair densest subgraph problem is NP-hard even to approximate, which means that with the standard computational model it is probably impossible to solve (or even approximate it sufficiently well) in polynomial time. For\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -clustering, the fairness constraints make the problem very similar to capacitated clustering, which is a notoriously hard problem to even approximate.\n          <\/jats:p>\n          <jats:p>Despite such negative premises, we are able to provide positive results in important use cases. In particular, we are able to prove that a suitable spectral embedding allows recovery of an almost optimal, fair, dense subgraph hidden in the input data, whenever one is present, a result that is further supported by experimental evidence.<\/jats:p>\n          <jats:p>\n            We also show a polynomial-time,\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(2\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -approximation algorithm to the problem of fair densest subgraph, assuming that there exist only two colors and both colors occur equally often in the graph. This result turns out to be optimal assuming the small set expansion hypothesis. For fair\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -clustering, we show that we can recover high quality fair clusterings effectively and efficiently. For the special case of\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -median and\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -center, we offer additional, fast and simple approximation algorithms as well as new hardness results.\n          <\/jats:p>\n          <jats:p>\n            The above theoretical findings drive the design of heuristics, which we experimentally evaluate on a scenario based on real data, in which our aim is to strike a good balance between diversity and highly correlated items from Amazon co-purchasing graphs and Facebook contacts. We additionally evaluated our algorithmic solutions for the fair\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(k\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -median problem through experiments on various real-world datasets.\n          <\/jats:p>","DOI":"10.1145\/3664929","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T13:17:47Z","timestamp":1715692667000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Projections as a Means toward Balanced Recommendations"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9183-7911","authenticated-orcid":false,"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[{"name":"Sapienza, University of Rome, Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4941-0532","authenticated-orcid":false,"given":"Luca","family":"Becchetti","sequence":"additional","affiliation":[{"name":"Sapienza, University of Rome, Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-1126","authenticated-orcid":false,"given":"Matteo","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"Sapienza, University of Rome, Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3062-4485","authenticated-orcid":false,"given":"Adriano","family":"Fazzone","sequence":"additional","affiliation":[{"name":"CENTAI, Turin, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9809-7191","authenticated-orcid":false,"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza, University of Rome, Rome, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2036-0612","authenticated-orcid":false,"given":"Cristina","family":"Menghini","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9114-0661","authenticated-orcid":false,"given":"Chris","family":"Schwiegelshohn","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2024,12,30]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347170"},{"key":"e_1_3_3_3_2","first-page":"120","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Agarwal Alekh","year":"2019","unstructured":"Alekh Agarwal, Miroslav Dud\u00edk, and Zhiwei Steven Wu. 2019. Fair regression: Quantitative definitions and reduction-based algorithms. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 120\u2013129."},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_3_5_2","first-page":"1027","volume-title":"Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907)","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907). 1027\u20131035."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_3_7_2","first-page":"405","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Backurs Arturs","year":"2019","unstructured":"Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, and Tal Wagner. 2019. Scalable fair clustering. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 405\u2013413."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13123-8_6"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3317587"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316318"},{"key":"e_1_3_3_12_2","first-page":"4955","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919)","volume":"32","author":"Bera Suman Kalyan","year":"2019","unstructured":"Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair algorithms for clustering. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919), Vol. 32. 4955\u20134966."},{"key":"e_1_3_3_13_2","unstructured":"Ioana O. Bercea Martin Gro\u00df Samir Khuller Aounon Kumar Clemens R\u00f6sner Daniel R. Schmidt and Melanie Schmidt. 2018. On the cost of essentially fair clusterings. arXiv:1811.10319. Retrieved from http:\/\/arxiv.org\/abs\/1811.10319"},{"key":"e_1_3_3_14_2","first-page":"18:1","volume-title":"Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM \u201919)","author":"Bercea Ioana Oriana","year":"2019","unstructured":"Ioana Oriana Bercea, Martin Gro\u00df, Samir Khuller, Aounon Kumar, Clemens R\u00f6sner, Daniel R. Schmidt, and Melanie Schmidt. 2019. On the cost of essentially fair clusterings. In Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM \u201919). Massachusetts Institute of Technology, Cambridge, MA, 18:1\u201318:22."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.34"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2021.08.011"},{"key":"e_1_3_3_18_2","unstructured":"Matteo B\u00f6hm Adriano Fazzone Stefano Leonardi and Chris Schwiegelshohn. 2020. Fair clustering with multiple colors. arXiv:2002.07892. Retrieved from https:\/\/arxiv.org\/abs\/2002.07892"},{"key":"e_1_3_3_19_2","first-page":"715","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Bose Avishek J.","year":"2019","unstructured":"Avishek J. Bose and William L. Hamilton. 2019. Compositional fairness constraints for graph embeddings. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 715\u2013724."},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00051"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/20"},{"key":"e_1_3_3_22_2","first-page":"28:1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP \u201918)","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018. Ranking with fairness constraints. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP \u201918). 28:1\u201328:15."},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_3_24_2","first-page":"5036","volume-title":"Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS \u201917)","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS \u201917). 5036\u20135044."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45077-1_4"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1089\/big.2016.0047"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935813"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.5555\/894477"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_3_35_2","first-page":"2357","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Gordaliza Paula","year":"2019","unstructured":"Paula Gordaliza, Eustasio del Barrio, Fabrice Gamboa, and Jean-Michel Loubes. 2019. Obtaining fairness using optimal transport theory. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 2357\u20132365."},{"key":"e_1_3_3_36_2","first-page":"3315","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NIPS \u201916)","volume":"29","author":"Hardt Moritz","year":"2016","unstructured":"Moritz Hardt, Eric Price, and Nati Srebro. 2016. Equality of opportunity in supervised learning. In Proceedings of the Advances in Neural Information Processing Systems (NIPS \u201916), Vol. 29. 3315\u20133323."},{"key":"e_1_3_3_37_2","first-page":"7587","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919)","volume":"32","author":"Huang Lingxiao","year":"2019","unstructured":"Lingxiao Huang, Shaofeng H.-C. Jiang, and Nisheeth K. Vishnoi. 2019. Coresets for clustering with fairness constraints. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919), Vol. 32. Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.), 7587\u20137598."},{"key":"e_1_3_3_38_2","volume-title":"Analyzing the Structure of Large Graphs","author":"Kannan Ravi","year":"1999","unstructured":"Ravi Kannan and V. Vinay. 1999. Analyzing the Structure of Large Graphs. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn, Bonn."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.25300\/MISQ\/2020\/16371"},{"key":"e_1_3_3_40_2","first-page":"43:1","volume-title":"Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS \u201917)","author":"Kleinberg Jon M.","year":"2017","unstructured":"Jon M. Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2017. Inherent trade-offs in the fair determination of risk scores. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS \u201917). 43:1\u201343:23."},{"key":"e_1_3_3_41_2","first-page":"3448","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. 2019. Fair k-center clustering for data summarization. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 3448\u20133457."},{"key":"e_1_3_3_42_2","first-page":"3458","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML \u201919)","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner, Samira Samadi, Pranjal Awasthi, and Jamie Morgenstern. 2019. Guarantees for spectral clustering with fairness constraints. In Proceedings of the 36th International Conference on Machine Learning (ICML \u201919). 3458\u20133467."},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.009"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5931"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316350"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055412"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959929"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599306"},{"key":"e_1_3_3_50_2","unstructured":"Jamie Morgenstern Samira Samadi Mohit Singh Uthaipon Tao Tantipongpipat and Santosh Vempala. 2019. Fair dimensionality reduction and iterative rounding for SDPs. arXiv: 1902.11281."},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","unstructured":"Alejandro Noriega-Campero Michiel Bakker Bernardo Garcia-Bulle and Alex Pentland. 2018. Active fairness in algorithmic decision making. arXiv:1810.00031. Retrieved from http:\/\/arxiv.org\/abs\/1810.00031","DOI":"10.1145\/3306618.3314277"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806792"},{"key":"e_1_3_3_54_2","first-page":"96:1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP \u201918)","author":"R\u00f6sner Clemens","year":"2018","unstructured":"Clemens R\u00f6sner and Melanie Schmidt. 2018. Privacy preserving clustering with constraints. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP \u201918). 96:1\u201396:14."},{"key":"e_1_3_3_55_2","doi-asserted-by":"crossref","unstructured":"Yossi Rubner Carlo Tomasi and Leonidas J. Guibas. 2000. The earth mover\u2019s distance as a metric for image retrieval. International Journal of Computer Vision 40 2 (2000) 99\u2013121.","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_3_3_56_2","first-page":"10999","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201918)","volume":"31","author":"Samadi Samira","year":"2018","unstructured":"Samira Samadi, Uthaipon Tao Tantipongpipat, Jamie H. Morgenstern, Mohit Singh, and Santosh Vempala. 2018. The price of fair PCA: One extra dimension. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201918), Vol. 31. 10999\u201311010."},{"key":"e_1_3_3_57_2","first-page":"232","volume-title":"Proceedings of the 17th International Workshop on Approximation and Online Algorithms (WAOA \u201919)","author":"Schmidt Melanie","year":"2019","unstructured":"Melanie Schmidt, Chris Schwiegelshohn, and Christian Sohler. 2019. Fair coresets and streaming algorithms for fair k-means. In Proceedings of the 17th International Workshop on Approximation and Online Algorithms (WAOA \u201919). 232\u2013251."},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2012.06.035"},{"key":"e_1_3_3_59_2","first-page":"15135","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919)","volume":"32","author":"Tantipongpipat Uthaipon","year":"2019","unstructured":"Uthaipon Tantipongpipat, Samira Samadi, Mohit Singh, Jamie H. Morgenstern, and Santosh S. Vempala. 2019. Multi-criteria dimensionality reduction with applications to fairness. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS \u201919), Vol. 32. Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.), 15135\u201315145."},{"key":"e_1_3_3_60_2","first-page":"502","volume-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201911)","author":"Thanh Binh L.","year":"2011","unstructured":"Binh L. Thanh, Salvatore Ruggieri, and Franco Turini. 2011. k-NN as an implementation of situation testing for discrimination discovery and prevention. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201911). 502\u2013510."},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_3_63_2","unstructured":"V. Krebs. 2018. PolBook Network Dataset Unpublished. Retrieved from http:\/\/www.orgnet.com"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052660"},{"key":"e_1_3_3_65_2","first-page":"962","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS \u201917)","author":"Zafar Muhammad Bilal","year":"2017","unstructured":"Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi. 2017. Fairness constraints: Mechanisms for fair classification. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS \u201917). 962\u2013970."},{"key":"e_1_3_3_66_2","first-page":"228","volume-title":"Proceedings of the Advance in Neural Information Processing Systems (NIPS \u201917)","volume":"30","author":"Zafar Muhammad Bilal","year":"2017","unstructured":"Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, Krishna P. Gummadi, and Adrian Weller. 2017. From parity to preference-based notions of fairness in classification. In Proceedings of the Advance in Neural Information Processing Systems (NIPS \u201917), Vol. 30. 228\u2013238."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:47Z","timestamp":1750291427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,30]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3664929"],"URL":"https:\/\/doi.org\/10.1145\/3664929","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2024,12,30]]},"assertion":[{"value":"2023-07-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}