The KL-Divergence Between a Graph Model and its Fair I-Projection as a Fairness Regularizer
- 10 September 2021
- book chapter
- Published by Springer Nature
- p. 351-366
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- A Survey of Link Prediction in Complex NetworksACM Computing Surveys, 2016
- Fairness through awareness2012
- Maximum entropy models and subjective interestingness: an application to tiles in binary databasesData Mining and Knowledge Discovery, 2010
- An introduction to exponential random graph (p*) models for social networksSocial Networks, 2007
- The link‐prediction problem for social networksJournal of the American Society for Information Science and Technology, 2007
- The political blogosphere and the 2004 U.S. election2005
- Information projections revisitedIEEE Transactions on Information Theory, 2003
- Birds of a Feather: Homophily in Social NetworksAnnual Review of Sociology, 2001
- Practical Use of the Information-Theoretic Approach1998
- $I$-Divergence Geometry of Probability Distributions and Minimization ProblemsThe Annals of Probability, 1975