Recommendation Independence. Kamishima, T., Akaho, S., Asoh, H., & Sakuma, J. 81:187–201. ![Recommendation Independence [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex This paper studies a recommendation algorithm whose outcomes are not influenced by specified information. It is useful in contexts potentially unfair decision should be avoided, such as job-applicant recommendations that are not influenced by socially sensitive information. An algorithm that could exclude the influence of sensitive information would thus be useful for job-matching with fairness. We call the condition between a recommendation outcome and a sensitive feature Recommendation Independence, which is formally defined as statistical independence between the outcome and the feature. Our previous independence-enhanced algorithms simply matched the means of predictions between sub-datasets consisting of the same sensitive value. However, this approach could not remove the sensitive information represented by the second or higher moments of distributions. In this paper, we develop new methods that can deal with the second moment, i.e., variance, of recommendation outcomes without increasing the computational complexity. These methods can more strictly remove the sensitive information, and experimental results demonstrate that our new algorithms can more effectively eliminate the factors that undermine fairness. Additionally, we explore potential applications for independence-enhanced recommendation, and discuss its relation to other concepts, such as recommendation diversity.
@article{kamishima_recommendation_2018,
title = {Recommendation Independence},
volume = {81},
url = {http://proceedings.mlr.press/v81/kamishima18a.html},
abstract = {This paper studies a recommendation algorithm whose outcomes are not
influenced by specified information. It is useful in contexts potentially
unfair decision should be avoided, such as job-applicant recommendations
that are not influenced by socially sensitive information. An algorithm
that could exclude the influence of sensitive information would thus be
useful for job-matching with fairness. We call the condition between a
recommendation outcome and a sensitive feature Recommendation
Independence, which is formally defined as statistical independence
between the outcome and the feature. Our previous independence-enhanced
algorithms simply matched the means of predictions between sub-datasets
consisting of the same sensitive value. However, this approach could not
remove the sensitive information represented by the second or higher
moments of distributions. In this paper, we develop new methods that can
deal with the second moment, i.e., variance, of recommendation outcomes
without increasing the computational complexity. These methods can more
strictly remove the sensitive information, and experimental results
demonstrate that our new algorithms can more effectively eliminate the
factors that undermine fairness. Additionally, we explore potential
applications for independence-enhanced recommendation, and discuss its
relation to other concepts, such as recommendation diversity.},
pages = {187--201},
author = {Kamishima, Toshihiro and Akaho, Shotaro and Asoh, Hideki and Sakuma, Jun},
date = {2018}
}
Downloads: 0
{"_id":"7ZpgFoSGhiWCe2837","bibbaseid":"kamishima-akaho-asoh-sakuma-recommendationindependence","authorIDs":[],"author_short":["Kamishima, T.","Akaho, S.","Asoh, H.","Sakuma, J."],"bibdata":{"bibtype":"article","type":"article","title":"Recommendation Independence","volume":"81","url":"http://proceedings.mlr.press/v81/kamishima18a.html","abstract":"This paper studies a recommendation algorithm whose outcomes are not influenced by specified information. It is useful in contexts potentially unfair decision should be avoided, such as job-applicant recommendations that are not influenced by socially sensitive information. An algorithm that could exclude the influence of sensitive information would thus be useful for job-matching with fairness. We call the condition between a recommendation outcome and a sensitive feature Recommendation Independence, which is formally defined as statistical independence between the outcome and the feature. Our previous independence-enhanced algorithms simply matched the means of predictions between sub-datasets consisting of the same sensitive value. However, this approach could not remove the sensitive information represented by the second or higher moments of distributions. In this paper, we develop new methods that can deal with the second moment, i.e., variance, of recommendation outcomes without increasing the computational complexity. These methods can more strictly remove the sensitive information, and experimental results demonstrate that our new algorithms can more effectively eliminate the factors that undermine fairness. Additionally, we explore potential applications for independence-enhanced recommendation, and discuss its relation to other concepts, such as recommendation diversity.","pages":"187–201","author":[{"propositions":[],"lastnames":["Kamishima"],"firstnames":["Toshihiro"],"suffixes":[]},{"propositions":[],"lastnames":["Akaho"],"firstnames":["Shotaro"],"suffixes":[]},{"propositions":[],"lastnames":["Asoh"],"firstnames":["Hideki"],"suffixes":[]},{"propositions":[],"lastnames":["Sakuma"],"firstnames":["Jun"],"suffixes":[]}],"date":"2018","bibtex":"@article{kamishima_recommendation_2018,\n\ttitle = {Recommendation Independence},\n\tvolume = {81},\n\turl = {http://proceedings.mlr.press/v81/kamishima18a.html},\n\tabstract = {This paper studies a recommendation algorithm whose outcomes are not\ninfluenced by specified information. It is useful in contexts potentially\nunfair decision should be avoided, such as job-applicant recommendations\nthat are not influenced by socially sensitive information. An algorithm\nthat could exclude the influence of sensitive information would thus be\nuseful for job-matching with fairness. We call the condition between a\nrecommendation outcome and a sensitive feature Recommendation\nIndependence, which is formally defined as statistical independence\nbetween the outcome and the feature. Our previous independence-enhanced\nalgorithms simply matched the means of predictions between sub-datasets\nconsisting of the same sensitive value. However, this approach could not\nremove the sensitive information represented by the second or higher\nmoments of distributions. In this paper, we develop new methods that can\ndeal with the second moment, i.e., variance, of recommendation outcomes\nwithout increasing the computational complexity. These methods can more\nstrictly remove the sensitive information, and experimental results\ndemonstrate that our new algorithms can more effectively eliminate the\nfactors that undermine fairness. Additionally, we explore potential\napplications for independence-enhanced recommendation, and discuss its\nrelation to other concepts, such as recommendation diversity.},\n\tpages = {187--201},\n\tauthor = {Kamishima, Toshihiro and Akaho, Shotaro and Asoh, Hideki and Sakuma, Jun},\n\tdate = {2018}\n}\n\n","author_short":["Kamishima, T.","Akaho, S.","Asoh, H.","Sakuma, J."],"key":"kamishima_recommendation_2018","id":"kamishima_recommendation_2018","bibbaseid":"kamishima-akaho-asoh-sakuma-recommendationindependence","role":"author","urls":{"Paper":"http://proceedings.mlr.press/v81/kamishima18a.html"},"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"article","biburl":"https://fair-ia.ekstrandom.net/fair-ia.bib","creationDate":"2020-04-09T18:53:45.474Z","downloads":0,"keywords":[],"search_terms":["recommendation","independence","kamishima","akaho","asoh","sakuma"],"title":"Recommendation Independence","year":null,"dataSources":["FRCCaPECNMucjb6Hk"]}