TY - GEN
T1 - Fair Graph Mining
AU - Kang, Jian
AU - Tong, Hanghang
N1 - – Difference: The related tutorial reviews intrinsic limi-tations of existing fairness notions in machine learning and sheds light on designing fair algorithms with ideas from economics and legal theory, whereas our tutorial focuses on review state-of-the-art techniques about en-forcing a wide range of fairness notions on graph mining algorithms. • Fairness in Machine Learning – Presenters: Solon Barocas, Moritz Hardt – Conference: NeurIPS, Dec 4 - 9, 2017, Long Beach, CA, USA – Connection: Both tutorials aim to introduce recent ad-vances in algorithmic fairness. – Difference: The related tutorial mainly focuses on group fairness and counterfactual fairness in traditional machine learning with IID data, whereas our tutorial focuses on algorithmic fairness on graphs, including group fairness, individual fairness and other fairness notions like Rawl-sian fairness, counterfactual fairness. ACKNOWLEDGEMENT This work is supported by National Science Foundation under grant No. 1947135, and 2003924, by the NSF Program on Fairness in AI in collaboration with Amazon under award No. 1939725, by NIFA award 2020-67021-32799, and Army Research Office (W911NF2110088) The content of the information in this document does not necessarily reflect the position or the policy of the Government or Amazon, and no official endorsement should be inferred. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.
PY - 2021/10/26
Y1 - 2021/10/26
N2 - In today's increasingly connected world, graph mining plays a pivotal role in many real-world application domains, including social network analysis, recommendations, marketing and financial security. Tremendous efforts have been made to develop a wide range of computational models. However, recent studies have revealed that many widely-applied graph mining models could suffer from potential discrimination. Fairness on graph mining aims to develop strategies in order to mitigate bias introduced/amplified during the mining process. The unique challenges of enforcing fairness on graph mining include (1) theoretical challenge on non-IID nature of graph data, which may invalidate the basic assumption behind many existing studies in fair machine learning, and (2) algorithmic challenge on the dilemma of balancing model accuracy and fairness. This tutorial aims to (1) present a comprehensive review of state-of-the-art techniques in fairness on graph mining and (2) identify the open challenges and future trends. In particular, we start with reviewing the background, problem definitions, unique challenges and related problems; then we will focus on an in-depth overview of (1) recent techniques in enforcing group fairness, individual fairness and other fairness notions in the context of graph mining, and (2) future directions in studying algorithmic fairness on graphs. We believe this tutorial could be attractive to researchers and practitioners in areas including data mining, artificial intelligence, social science and beneficial to a plethora of real-world application domains.
AB - In today's increasingly connected world, graph mining plays a pivotal role in many real-world application domains, including social network analysis, recommendations, marketing and financial security. Tremendous efforts have been made to develop a wide range of computational models. However, recent studies have revealed that many widely-applied graph mining models could suffer from potential discrimination. Fairness on graph mining aims to develop strategies in order to mitigate bias introduced/amplified during the mining process. The unique challenges of enforcing fairness on graph mining include (1) theoretical challenge on non-IID nature of graph data, which may invalidate the basic assumption behind many existing studies in fair machine learning, and (2) algorithmic challenge on the dilemma of balancing model accuracy and fairness. This tutorial aims to (1) present a comprehensive review of state-of-the-art techniques in fairness on graph mining and (2) identify the open challenges and future trends. In particular, we start with reviewing the background, problem definitions, unique challenges and related problems; then we will focus on an in-depth overview of (1) recent techniques in enforcing group fairness, individual fairness and other fairness notions in the context of graph mining, and (2) future directions in studying algorithmic fairness on graphs. We believe this tutorial could be attractive to researchers and practitioners in areas including data mining, artificial intelligence, social science and beneficial to a plethora of real-world application domains.
KW - algorithmic fairness
KW - bias mitigation
KW - graph mining
UR - http://www.scopus.com/inward/record.url?scp=85119176590&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85119176590&partnerID=8YFLogxK
U2 - 10.1145/3459637.3482030
DO - 10.1145/3459637.3482030
M3 - Conference contribution
AN - SCOPUS:85119176590
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 4849
EP - 4852
BT - CIKM 2021 - Proceedings of the 30th ACM International Conference on Information and Knowledge Management
PB - Association for Computing Machinery
T2 - 30th ACM International Conference on Information and Knowledge Management, CIKM 2021
Y2 - 1 November 2021 through 5 November 2021
ER -