[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

A General Concave Fairness Framework for Influence Maximization Based on Poverty Reward

Published: 12 December 2024 Publication History

Abstract

Influence maximization (IM) aims to find a group of influential nodes as initial spreaders to maximize the influence spread over a network. Yet, traditional IM algorithms have not been designed with fairness in mind, resulting in discrimination against some groups, like LGBTQ communities and racial minorities. This issue has spurred research on Fair Influence Maximization (FIM). However, existing FIM studies come with some drawbacks. First, most proposed notions of fairness for FIM cannot adjust the tradeoff between fairness level and influence spread. Second, though a few specific notions of fairness allow such balancing, they are limited to a few specific concave functions, which may not be suitable for various real-world scenarios. Furthermore, none of them have studied the deep relations between the features of concave functions and the level of fairness. Third, existing fairness metrics are limited to their corresponding concepts of fairness. Comparing the level of fairness across different algorithms using existing metrics can be challenging. To tackle the above problems, this article first proposes a novel fairness notion named Poverty Reward (PR), which achieves fairness by rewarding the enrichment of groups with low utility. Based on PR, we further propose an algorithmic framework called Concave Fairness Framework (CFF) that allows any concave function that satisfies specific requirements. We also systematically clarify how fairness is improved by applying concave functions and provide an in-depth quantitative analysis of how to select appropriate concave functions for different utility distributions. Moreover, we propose the Reward of Fairness (RoF) metric that evaluates the disparity between groups. Based on RoF, an evaluation system is built to uniformly compare FIM algorithms from different fairness notions. Experiments in real-world datasets have demonstrated the validity of the CFF, as well as the proposed fairness notion.

References

[1]
Junaid Ali, Mahmoudreza Babaei, Abhijnan Chakraborty, Baharan Mirzasoleiman, Krishna P. Gummadi, and Adish Singla. 2022. On the Fairness of Time-Critical Influence Maximization in Social Networks. In Proceedings of the IEEE International Conference on Data Engineering (ICDE ’22), 1541–1542.
[2]
Khurshed Ali, Chih-Yu Wang, and Yi-Shin Chen. 2022. Leveraging Transfer Learning in Reinforcement Learning to Tackle Competitive Influence Maximization. Knowledge and Information Systems 64, 8 (2022), 2059–2090.
[3]
Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi, and Hugo Gilbert. 2021. Fairness in Influence Maximization through Randomization. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI ’21), 14684–14692.
[4]
Reuben Binns. 2020. On the Apparent Conflict between Individual and Group Fairness. In Proceedings of the Conference on Fairness, Accountability, and Transparency (FAT* ’20), 514–524.
[5]
Pedro Domingos and Matthew Richardson. 2001. Mining the Network Value of Customers. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’01), 57–66.
[6]
Yushun Dong, Jian Kang, Hanghang Tong, and Jundong Li. 2021. Individual Fairness for Graph Neural Networks: A Ranking Based Approach. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’21), 300–310.
[7]
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 35, 10 (2023), 10583–10602.
[8]
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard S. Zemel. 2012. Fairness through Awareness. In Innovations in Theoretical Computer Science 2012, 214–226.
[9]
Golnoosh Farnadi, Behrouz Babaki, and Michel Gendreau. 2020. A Unifying Framework for Fairness-Aware Influence Maximization. In Companion of the 2020 Web Conference 2020, 714–722.
[10]
Benjamin Fish, Ashkan Bashardoust, danah boyd, Sorelle A. Friedler, Carlos Scheidegger, and Suresh Venkatasubramanian. 2019. Gaps in Information Access in Social Networks. In Proceedings of the World Wide Web Conference (WWW ’19), 480–490.
[11]
David García-Soriano and Francesco Bonchi. 2021. Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’21). ACM, 436–446.
[12]
Siamak Ghodsi, Seyed Amjad Seyedi, and Eirini Ntoutsi. 2024. Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering. In Advances in Knowledge Discovery and Data Mining - 28th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD ’24), Vol. 14645, 284–296.
[13]
Nicolas Gillis, Le Thi Khanh Hien, Valentin Leplat, and Vincent Y. F. Tan. 2022. Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence 44, 8 (2022), 4052–4064.
[14]
Moritz Hardt, Eric Price, and Nati Srebro. 2016. Equality of Opportunity in Supervised Learning. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems, 3315–3323.
[15]
Zeinab S. Jalali, Weixiang Wang, Myunghwan Kim, Hema Raghavan, and Sucheta Soundarajan. 2020. On the Information Unfairness of Social Networks. In Proceedings of the 2020 SIAM International Conference on Data Mining (SDM ’20), 613–521.
[16]
Jian Kang, Jingrui He, Ross Maciejewski, and Hanghang Tong. 2020. InFoRM: Individual Fairness on Graph Mining. In Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’20), 379–389.
[17]
David Kempe, Jon M. Kleinberg, and Éva Tardos. 2003. Maximizing the Spread of Influence through a Social Network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’03), 137–146.
[18]
Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In Proceedings of the 5th International Conference on Learning Representations (ICLR ’17).
[19]
Yuchen Li, Ju Fan, Yanhao Wang, and Kian-Lee Tan. 2018. Influence Maximization on Social Graphs: A Survey. IEEE Transactions on Knowledge and Data Engineering 30, 10 (2018), 1852–1872.
[20]
Hui Lin and Jeff A. Bilmes. 2011. A Class of Submodular Functions for Document Summarization. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies, 510–520.
[21]
Mingkai Lin, Lintan Sun, Rui Yang, Xusheng Liu, Yajuan Wang, Ding Li, Wenzhong Li, and Sanglu Lu. 2023. Fair Influence Maximization in Large-scale Social Networks Based on Attribute-Aware Reverse Influence Sampling. Journal of Artificial Intelligence Research 76 (2023), 925–957.
[22]
Hervé Moulin. 2004. Fair Division and Collective Welfare, MIT press.
[23]
Yonemoto Naohiro, Kawashima Yoshitaka, Endo Kaori, and Yamada Mitsuhiko. 2019. Gatekeeper Training for Suicidal Behaviors: A Systematic Review. Journal of Affective Disorders 246 (2019), 506–514.
[24]
Arvind Narayanan. 2018. Translation Tutorial: 21 Fairness Definitions and Their Politics. In Proceedings of the Conference on Fairness, Accountability and Transparency, Vol. 1170, 3.
[25]
Binghui Peng and Wei Chen. 2019. Adaptive Influence Maximization with Myopic Feedback. In Advances in Neural Information Processing Systems (NeurIPS ’19), Vol. 32, 5575–5584.
[26]
Pierre Perrault, Jennifer Healey, Zheng Wen, and Michal Valko. 2020. Budgeted Online Influence Maximization. In Proceedings of the 37th International Conference on Machine Learning (ICML ’20), Vol. 119, 7620–7631.
[27]
Aida Rahmattalabi, Shahin Jabbari, Himabindu Lakkaraju, Phebe Vayanos, Max Izenberg, Ryan Brown, Eric Rice, and Milind Tambe. 2021. Fair Influence Maximization: A Welfare Optimization Approach. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI ’21), 11630–11638.
[28]
John Rawls. 2020. A Theory of Justice: Revised Edition. Harvard University Press.
[29]
Behnam Razaghi, Mehdy Roayaei, and Nasrollah Moghadam Charkari. 2023. On the Group-Fairness-Aware Influence Maximization in Social Networks. IEEE Transactions on Computational Social Systems 10, 6 (2023), 3406–3414.
[30]
Matthew Richardson and Pedro M. Domingos. 2002. Mining Knowledge-Sharing Sites for Viral Marketing. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 61–70.
[31]
Xiaobin Rui, Zhixiao Wang, Jiayu Zhao, Lichao Sun, and Wei Chen. 2023. Scalable Fair Influence Maximization. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems, 66675–66691.
[32]
Ana-Andreea Stoica, Jessy Xinyi Han, and Augustin Chaintreau. 2020. Seeding Network Influence in Biased Networks and the Benefits of Diversity. In Proceedings of the Web Conference 2020, 2089–2098.
[33]
Lichao Sun, Weiran Huang, Philip S. Yu, and Wei Chen. 2018. Multi-Round Influence Maximization. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2249–2258.
[34]
Alan Tsang, Bryan Wilder, Eric Rice, Milind Tambe, and Yair Zick. 2019. Group-Fairness in Influence Maximization. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI ’19), 5997–6005.
[35]
Bryan Wilder, Han-Ching Ou, Kayla de la Haye, and Milind Tambe. 2018. Optimizing Network Structure for Preventative Health. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS ’18), 841–849.
[36]
Amulya Yadav, Bryan Wilder, Eric Rice, Robin Petering, Jaih Craddock, Amanda Yoshioka-Maxwell, Mary Hemler, Laura Onasch-Vera, Milind Tambe, and Darlene Woo. 2018. Bridging the Gap between Theory and Practice in Influence Maximization: Raising Awareness About HIV among Homeless Youth. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI ’18), 5399–5403.
[37]
Wayne W. Zachary. 1977. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research 33, 4 (1977), 452–473.
[38]
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi. 2017. Fairness Constraints: Mechanisms for Fair Classification. In Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS ’17), 962–970.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Knowledge Discovery from Data
ACM Transactions on Knowledge Discovery from Data  Volume 19, Issue 1
January 2025
431 pages
EISSN:1556-472X
DOI:10.1145/3703003
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 December 2024
Online AM: 28 October 2024
Accepted: 12 October 2024
Revised: 15 July 2024
Received: 15 February 2024
Published in TKDD Volume 19, Issue 1

Check for updates

Author Tags

  1. Influence maximization
  2. Fairness
  3. Poverty reward
  4. Concave functions

Qualifiers

  • Research-article

Funding Sources

  • Natural Science Foundation of Jiangsu Province
  • National Natural Science Foundation of China

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 97
    Total Downloads
  • Downloads (Last 12 months)97
  • Downloads (Last 6 weeks)57
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

Full Text

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media