skip to main content
10.1145/3589334.3645609acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article
Open access

Fairness Rising from the Ranks: HITS and PageRank on Homophilic Networks

Published: 13 May 2024 Publication History

Abstract

In this paper, we investigate the conditions under which link analysis algorithms prevent minority groups from reaching high ranking slots. We find that the most common link-based algorithms using centrality metrics, such as PageRank and HITS, can reproduce and even amplify bias against minority groups in networks. Yet, their behavior differs: one one hand, we empirically show that PageRank mirrors the degree distribution for most of the ranking positions and it can equalize representation of minorities among the top ranked nodes; on the other hand, we find that HITS amplifies pre-existing bias in homophilic networks through a novel theoretical analysis, supported by empirical results. We find the root cause of bias amplification in HITS to be the level of homophily present in the network, modeled through an evolving network model with two communities. We illustrate our theoretical analysis on both synthetic and real datasets and we present directions for future work.

Supplemental Material

MP4 File
Supplemental video

References

[1]
Alekh Agarwal, Soumen Chakrabarti, and Sunny Aggarwal. 2006. Learning to rank networked entities. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. 14--23.
[2]
Julia Angwin, Jeff Larson, Surya Mattu, and Lauren Kirchner. 2016. Machine bias. ProPublica (May 2016).
[3]
Nelson Antunes, Sayan Banerjee, Shankar Bhamidi, and Vladas Pipiras. 2023. Attribute network models, stochastic approximation, and network sampling and ranking algorithms. arXiv preprint arXiv:2304.08565 (2023).
[4]
Chen Avin, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, and Yvonne-Anne Pignolet. 2015. Homophily and the glass ceiling effect in social networks. In Proceedings of the 6th Conference on Innovations in Theoretical Computer Science. 41--50.
[5]
Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512.
[6]
Albert-Laszlo Barabasi and Zoltan N Oltvai. 2004. Network biology: understanding the cell's functional organization. Nature reviews genetics, Vol. 5, 2 (2004), 101--113.
[7]
Alex Beutel, Jilin Chen, Tulsee Doshi, Hai Qian, Li Wei, Yi Wu, Lukasz Heldt, Zhe Zhao, Lichan Hong, Ed H Chi, et al. 2019. Fairness in recommendation ranking through pairwise comparisons. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2212--2220.
[8]
Asia J Biega, Krishna P Gummadi, and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. 405--414.
[9]
Allan Borodin, Gareth Roberts, Jeffrey Rosenthal, and Panayiotis Tsaparas. 2005. Link analysis ranking: algorithms, theory, and experiments. Transactions on Internet Technology (TOIT), Vol. 5, 1 (Feb. 2005).
[10]
Yann Bramoullé, Sergio Currarini, Matthew O Jackson, Paolo Pin, and Brian W Rogers. 2012. Homophily and long-run integration in social networks. Journal of Economic Theory, Vol. 147, 5 (2012), 1754--1786.
[11]
L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017).
[12]
Mengtian Cui, Manuel Sebastian Mariani, and Matúvs Medo. 2022. Algorithmic bias amplification via temporal effects: The case of PageRank in evolving networks. Communications in Nonlinear Science and Numerical Simulation, Vol. 104 (2022), 106029.
[13]
Lorand Dali and Blaz Fortuna. 2011. Learning to rank for semantic search. SemSearch@ WWW2011 (2011).
[14]
Yushun Dong, Jing Ma, Song Wang, Chen Chen, and Jundong Li. 2023. Fairness in graph mining: A survey. IEEE Transactions on Knowledge and Data Engineering (2023).
[15]
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012. Fairness through awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 214--226.
[16]
Lisette Esp'in-Noboa, Claudia Wagner, Markus Strohmaier, and Fariba Karimi. 2022. Inequality and inequity in network-based ranking and recommendation algorithms. Scientific reports, Vol. 12, 1 (2022), 1--14.
[17]
Michael Feldman, Sorelle A Friedler, John Moeller, Carlos Scheidegger, and Suresh Venkatasubramanian. 2015. Certifying and removing disparate impact. In proceedings of the 21th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 259--268.
[18]
Santo Fortunato, Alessandro Flammini, Filippo Menczer, and Alessandro Vespignani. 2006. Topical interests and the mitigation of search engine bias. Proceedings of the National Academy of Sciences, Vol. 103, 34 (2006), 12684--12689.
[19]
Moritz Hardt, Eric Price, and Nati Srebro. 2016. Equality of opportunity in supervised learning. Advances in Neural Information Processing Systems, Vol. 29 (2016).
[20]
Jon M Kleinberg. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), Vol. 46, 5 (1999), 604--632.
[21]
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, Vol. 67. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 43.
[22]
Eun Lee, Fariba Karimi, Claudia Wagner, Hang-Hyun Jo, Markus Strohmaier, and Mirta Galesic. 2019. Homophily and minority-group size explain perception biases in social networks. Nature human behaviour, Vol. 3, 10 (2019), 1078--1087.
[23]
Ronny Lempel and Shlomo Moran. 2000. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks, Vol. 33, 1--6 (2000), 387--401.
[24]
Michael Ley. 2009. DBLP: some lessons learned. Proceedings of the VLDB Endowment, Vol. 2, 2 (2009), 1493--1500.
[25]
Tie-Yan Liu et al. 2009. Learning to rank for information retrieval. Foundations and Trends® in Information Retrieval, Vol. 3, 3 (2009), 225--331.
[26]
Manuel Sebastian Mariani, Matúvs Medo, and Yi-Cheng Zhang. 2015. Ranking nodes in growing networks: When PageRank fails. Scientific reports, Vol. 5, 1 (2015), 1--10.
[27]
Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a Feather: Homophily in Social Networks. Annual review of sociology, Vol. 27 (2001), 415--444.
[28]
Marc A Najork, Hugo Zaragoza, and Michael J Taylor. 2007. HITS on the Web: How does it compare?. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. 471--478.
[29]
Mark EJ Newman and Michelle Girvan. 2003. Mixing patterns and community structure in networks. In Statistical mechanics of complex networks. Springer, 66--87.
[30]
Andrew Y Ng, Alice X Zheng, and Michael I Jordan. 2001. Stable algorithms for link analysis. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval. 258--266.
[31]
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab.
[32]
Samira Samadi, Uthaipon Tantipongpipat, Jamie H Morgenstern, Mohit Singh, and Santosh Vempala. 2018. The price of fair PCA: One extra dimension. Advances in Neural Information Processing Systems, Vol. 31 (2018).
[33]
Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. Advances in Neural Information Processing Systems, Vol. 32 (2019).
[34]
Arnab Sinha, Zhihong Shen, Yang Song, Hao Ma, Darrin Eide, Bo-june Paul Hsu, and Kuansan Wang. 2015. An overview of Microsoft Academic Service (MAS) and applications. In Proceedings of the 24th International Conference on World Wide Web. ACM, 243--246.
[35]
Ana-Andreea Stoica, Christopher Riederer, and Augustin Chaintreau. 2018. Algorithmic Glass Ceiling in Social Networks: The effects of social recommendations on network diversity. In Proceedings of The Web Conference. 923--932.
[36]
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. ArnetMiner: Extraction and Mining of Academic Social Networks. In proceedings of the 21th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 990--998.
[37]
Adriano A Veloso, Humberto M Almeida, Marcos A Goncc alves, and Wagner Meira Jr. 2008. Learning to rank at query-time using association rules. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval. 267--274.
[38]
Madalina Vlasceanu and David M Amodio. 2022. Propagation of societal gender inequality by internet search algorithms. Proceedings of the National Academy of Sciences, Vol. 119, 29 (2022), e2204529119.
[39]
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez Rogriguez, and Krishna P Gummadi. 2017. Fairness constraints: Mechanisms for fair classification. In Artificial Intelligence and Statistics. PMLR, 962--970.
[40]
Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, and Ricardo Baeza-Yates. 2017. Fa* ir: A fair top-k ranking algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1569--1578.
[41]
Meike Zehlike and Carlos Castillo. 2020. Reducing disparate exposure in ranking: A learning to rank approach. In Proceedings of The Web Conference. 2849--2855.
[42]
Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022a. Fairness in ranking, part i: Score-based ranking. Comput. Surveys, Vol. 55, 6 (2022), 1--36.
[43]
Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2022b. Fairness in ranking, part ii: Learning-to-rank and recommender systems. Comput. Surveys, Vol. 55, 6 (2022), 1--41.
[44]
Yiguang Zhang, Jessy Xinyi Han, Ilica Mahajan, Priyanjana Bengani, and Augustin Chaintreau. 2021. Chasm in Hegemony: Explaining and Reproducing Disparities in Homophilous Networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 5, 2 (2021), 1--38. io

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '24: Proceedings of the ACM Web Conference 2024
May 2024
4826 pages
ISBN:9798400701719
DOI:10.1145/3589334
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 May 2024

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. fairness
  2. hits
  3. information retrieval
  4. link analysis ranking
  5. networks
  6. pagerank
  7. search algorithms

Qualifiers

  • Research-article

Funding Sources

  • NSF
  • NWO

Conference

WWW '24
Sponsor:
WWW '24: The ACM Web Conference 2024
May 13 - 17, 2024
Singapore, Singapore

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)242
  • Downloads (Last 6 weeks)49
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media