Fairness Rising from the Ranks - HITS and PageRank on Homophilic Networks
Association for Computing Machinery (ACM) via YouTube
Overview
Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Watch a 21-minute ACM conference talk exploring how HITS and PageRank algorithms perform on homophilic networks, with particular focus on fairness implications. Delve into theoretical analysis presented by researchers Ana-Andreea Stoica, Nelly Litvak, and Augustin Chaintreau as they examine ranking algorithms' behavior in networks where connections form based on shared characteristics. Learn about the intersection of network theory and algorithmic fairness, understanding how these popular ranking methods may perpetuate or mitigate existing biases in networked systems.
Syllabus
Fairness rising from the ranks: HITS and PageRank on Homophilic Networks
Taught by
Association for Computing Machinery (ACM)