{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T08:05:08Z","timestamp":1771920308598,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,20]]},"DOI":"10.1109\/hpec49654.2021.9622861","type":"proceedings-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T20:57:36Z","timestamp":1638392256000},"page":"1-8","source":"Crossref","is-referenced-by-count":8,"title":["Machine Learning Fairness is Computationally Difficult and Algorithmically Unsatisfactorily Solved"],"prefix":"10.1109","author":[{"given":"Mike H.M.","family":"Teodorescu","sequence":"first","affiliation":[]},{"given":"Xinyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"2564","article-title":"Preventing fairness gerrymandering: Auditing and learning for subgroup fairness","author":"kearns","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref32","author":"braverman","year":"2021","journal-title":"The gradient complexity of linear regression"},{"key":"ref31","author":"banerjee","year":"2020","journal-title":"Train\/Test Complexity and Space Complexity of Linear Regression"},{"key":"ref30","year":"2018","journal-title":"Computational complexity of machine learning algorithms – The Kernel Trip"},{"key":"ref35","article-title":"Fairness Sample Complexity and the Case for Human Intervention","author":"balashankar","year":"2019","journal-title":"Proceedings of Where is the Human? Bridging the Gap Between AI and HCI CHI Workshop (SigChi ’19)"},{"key":"ref34","article-title":"Probably Approximately Metric-Fair Learning","author":"rothblum","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CISE.2009.5366068"},{"key":"ref11","first-page":"193","article-title":"Credit risk analysis in peer-to-peer lending system","author":"kumar","year":"2016","journal-title":"2016 IEEE International Conference on Knowledge Engineering and Applications (ICKEA) ICKEA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5296\/jmr.v5i2.2899"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008324023422"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.dss.2014.03.001","article-title":"A Data-Driven Approach to Predict the Success of Bank Telemarketing","author":"moro","year":"2014","journal-title":"Decision Support Systems"},{"key":"ref15","article-title":"Machine Learning Project Phase 1","author":"phan","year":"0","journal-title":"Predicting subscription to term deposit using the Bank Marketing Data Set"},{"key":"ref16","article-title":"Principles for accountable algorithms and a social impact statement for algorithms","author":"diakopoulos","year":"2017","journal-title":"FAT\/ML"},{"key":"ref17","first-page":"1","article-title":"Seeking Ethical use of AI Algorithms: Challenges and Mitigations","volume":"1","author":"tarafdar","year":"2020","journal-title":"ICIS 2020 Proceedings Forty-First International Conference on Information Systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.25300\/MISQ\/2021\/16535"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/FAIRWARE.2018.8452913"},{"key":"ref28","first-page":"363","article-title":"Core Vector Machines: Fast SVM Training on Very Large Data Sets","volume":"6","author":"tsang","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/isaf.261"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3280989"},{"key":"ref3","first-page":"28","article-title":"Forecasting creditworthiness: Logistic vs. artificial neural net","volume":"18","author":"lee","year":"1999","journal-title":"The Journal of Business Forecasting"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/02664760802554263"},{"key":"ref29","article-title":"Reducing the run-time complexity of Support Vector Machines","author":"osuna","year":"1998","journal-title":"Proceedings ICPR’98"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSE.2012.6282321"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2016910595"},{"key":"ref7","article-title":"Naive Feature Selection: Sparsity in Naive Bayes","volume":"108","author":"askari","year":"2020","journal-title":"Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS) 2020"},{"key":"ref2","article-title":"On the web’s cutting edge, anonymity in name only","author":"steel","year":"2010","journal-title":"The Wall Street Journal"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.07.007"},{"key":"ref1","article-title":"Exploring Fairness in Machine Learning for International Development","author":"awwad","year":"2020","journal-title":"MIT D-Lab CITE Report Cambridge MIT D-Lab Report number dspace mit edu\/handle\/1721 1\/126854"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2994868"},{"key":"ref21","first-page":"3315","article-title":"Equality of opportunity in supervised learning","author":"hardt","year":"0","journal-title":"NIPS’16 Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.01.016"},{"key":"ref23","article-title":"Naive Bayes for Text Classification with Unbalanced Classes","volume":"4213","author":"eibe","year":"2006","journal-title":"Knowledge Discovery in Databases PKDD 2006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2002909"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.857955"}],"event":{"name":"2021 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA, USA","start":{"date-parts":[[2021,9,20]]},"end":{"date-parts":[[2021,9,24]]}},"container-title":["2021 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9622740\/9622741\/09622861.pdf?arnumber=9622861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:48Z","timestamp":1652201628000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9622861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,20]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/hpec49654.2021.9622861","relation":{},"subject":[],"published":{"date-parts":[[2021,9,20]]}}}