{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:32:23Z","timestamp":1743111143709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030969561"},{"type":"electronic","value":"9783030969578"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96957-8_30","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T14:04:35Z","timestamp":1645538675000},"page":"344-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Need for Transparent Demographic Group Trade-Offs in Credit Risk and Income Classification"],"prefix":"10.1007","author":[{"given":"Ananth","family":"Balashankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alyssa","family":"Lees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"30_CR1","unstructured":"Salamanca, C.D.J.R., et al.: A local law in relation to automated decision systems used by agencies (2018)"},{"issue":"4175","key":"30_CR2","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1126\/science.187.4175.398","volume":"187","author":"PJ Bickel","year":"1975","unstructured":"Bickel, P.J., Hammel, E.A., O\u2019Connell, J.W.: Sex bias in graduate admissions: data from Berkeley. Science 187(4175), 398\u2013404 (1975)","journal-title":"Science"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Zhao, J., Wang, T., Yatskar, M., Ordonez, V., Chang, K.W., Reducing gender bias amplification using corpus-level constraints. In: EMNLP, Men also like shopping (2017)","DOI":"10.18653\/v1\/D17-1323"},{"key":"30_CR4","unstructured":"Ensign, D., Friedler, S.A., Neville, S., Scheidegger, C.E., Venkatasubramanian, S.: Runaway feedback loops in predictive policing. CoRR, abs\/1706.09847 (2017)"},{"key":"30_CR5","unstructured":"Kearns, M., Neel, S., Roth, A., Wu, Z.S.: Auditing and learning for subgroup fairness. In: ICML, Preventing fairness gerrymandering (2018)"},{"key":"30_CR6","unstructured":"Menon, A.K., Williamson, R.C.: The cost of fairness in binary classification. In: Proceedings of the 1st Conference on Fairness, Accountability and Transparency, volume 81 of Proceedings of Machine Learning Research, pp. 107\u2013118. PMLR, New York, NY, USA, 23\u201324 Feburary 2018"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Reingold, O., Zemel, R.S.: Fairness through awareness. In: ITCS, Toniann Pitassi (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"30_CR8","unstructured":"Dwork, C., Ilvento, C.: Fairness under composition. In: ITCS (2019)"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00778-006-0029-7","volume":"16","author":"P Godfrey","year":"2007","unstructured":"Godfrey, P., Shipley, R., Gryz, J.: Algorithms and analyses for maximal vector computation. VLDB J. 16(1), 5\u201328 (2007)","journal-title":"VLDB J."},{"key":"30_CR10","unstructured":"Dheeru, D., Taniskidou, E.K.: UCI machine learning repository (2017)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Selbst, A.D., Boyd, D., Friedler, S.A., Venkatasubramanian, S., Vertesi, J.: Fairness and abstraction in sociotechnical systems. In: FAT* 2019 (2019)","DOI":"10.1145\/3287560.3287598"},{"key":"30_CR12","unstructured":"Grgic-Hlaca, N.: The case for process fairness in learning : Feature selection for fair decision making. In: NIPS Symposium on Machine Learning and the Law, vol. 1, pp. 2 (2016)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Madras, D., Creager, E., Pitassi, T., Zemel, R.: Fairness through causal awareness: learning causal latent-variable models for biased data. In: FAT* 2019 (2019)","DOI":"10.1145\/3287560.3287564"},{"key":"30_CR14","unstructured":"Buolamwini, J., Gebru, T.: Gender shades: Intersectional accuracy disparities in commercial gender classification. In: FAT (2018)"},{"key":"30_CR15","unstructured":"Chen, I., Johansson, F.D., Sontag, D.A.: Why is my classifier discriminatory? CoRR, abs\/1805.12002 (2018)"},{"key":"30_CR16","unstructured":"Angwin, S.M.A., Larson, J.E., Kirchner, L.: How we analyzed the compas recidivism algorithm.(2016)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Foster, D., Vohra, R.: An economic argument for affirmative action. Rationality Soc. 4(2), 176\u2013188 (1992)","DOI":"10.1177\/1043463192004002004"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Ali, J., Zafar, M.B., Singla, A., Gummadi, K.P.:. Loss-aversively fair classification. In: AIES 2019, pp. 211\u2013218 (2019)","DOI":"10.1145\/3306618.3314266"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Rawls, J.: A Theory of Justice (1971)","DOI":"10.4159\/9780674042605"},{"key":"30_CR20","unstructured":"Agarwal, A., Beygelzimer, A., Dud\u00edk, M., John, L., Wallach, H.M.: A reductions approach to fair classification. CoRR, abs\/1803.02453 (2018)"},{"key":"30_CR21","unstructured":"Andrew, Y.N.: Feature selection, $$<$$i$$>$$l$$<$$\/i$$>$$$$<$$sub$$>$$1$$<$$\/sub$$>$$ vs. $$<$$i$$>$$l$$<$$\/i$$>$$$$<$$sub$$>$$2$$<$$\/sub$$>$$ regularization, and rotational invariance. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004, p. 78. Association for Computing Machinery, New York, NY, USA (2004)"},{"key":"30_CR22","unstructured":"Hardt, M., Price, E., Srebro, N.: Equality of opportunity in supervised learning. CoRR, abs\/1610.02413 (2016)"},{"key":"30_CR23","unstructured":"Beutel, A., Chen, J., Zhao, Z., Hsin Chi, E.H.: Data decisions and theoretical implications when adversarially learning fair representations. CoRR, abs\/1707.00075 (2017)"},{"key":"30_CR24","unstructured":"Martinez, N., Bertran, M., Sapiro, G.: A multi objective perspective. In: ICML, Minimax pareto fairness (2020)"},{"key":"30_CR25","unstructured":"Kearns, M., Neel, S., Roth, A., Wu, Z.S.: Preventing fairness gerrymandering: Auditing and learning for subgroup fairness. CoRR, abs\/1711.05144 (2017)"},{"key":"30_CR26","unstructured":"Supreme Court of the United States. Griggs v. duke power co. (1971)"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2015, pp. 259\u2013268. ACM, New York, NY, USA (2015)","DOI":"10.1145\/2783258.2783311"},{"key":"30_CR28","unstructured":"Chouldechova, A., G\u2019Sell, M.: Fairer and more accurate, but for whom? 06 (2017)"},{"key":"30_CR29","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. MIT Press, Adaptive Computation and Machine Learning (2012)"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor, J., Anthony, M., Biggs, N.: Bounding sample size with the vapnik-chervonenkis dimension. 42, 65\u201373 (1993)","DOI":"10.1016\/0166-218X(93)90179-R"}],"container-title":["Lecture Notes in Computer Science","Information for a Better World: Shaping the Global Future"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96957-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T17:57:52Z","timestamp":1674842272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96957-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030969561","9783030969578"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96957-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iConference","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconference2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ischools.org\/iConference","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfTool","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"147","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}