Ahmad Asgharian Rezaei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ahmad Asgharian Rezaei has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mahdi Jalili
RMIT University
2 shared publications - Adrian Weller
Department of Engineering, University of Cambridge, Cambridge, UK
1 shared publication Alireza Elahi
Shahid Beheshti University, Tehran, Iran
1 shared publication- Amin Heydari Alashti
Snapp, Tehran, Iran
1 shared publication - Jessica Hoffmann
RMIT University
1 shared publication - Justin Munoz
School of Engineering, RMIT University, Melbourne, Australia
1 shared publication
Latest Publications
- 25 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (8) , 10690-10711
Parsisanj: an automatic component-based approach toward search engine evaluation
- 25 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (8) , 10690-10711
Parsisanj: an automatic component-based approach toward search engine evaluation
- 1 December 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 185, 115607
Deep learning based bi-level approach for proactive loan prospecting
- 1 December 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 185, 115607
Deep learning based bi-level approach for proactive loan prospecting
- Open Access
Adversarial Graph Embeddings for Fair Influence Maximization over Social Networks
Influence maximization is a widely studied topic in network science, where the aim is to reach the maximum possible number of nodes, while only targeting a small initial set of individuals. It has critical applications in many fields, including viral marketing, information propagation, news dissemination, and vaccinations. However, the objective does not usually take into account whether the final set of influenced nodes is fair with respect to sensitive attributes, such as race or gender. Here we address fair influence maximization, aiming to reach minorities more equitably. We introduce Adversarial Graph Embeddings: we co-train an auto-encoder for graph embedding and a discriminator to discern sensitive attributes. This leads to embeddings which are similarly distributed across sensitive attributes. We then find a good initial set by clustering the embeddings. We believe we are the first to use embeddings for the task of fair influence maximization. While there are typically trade-offs between fairness and influence maximization objectives, our experiments on synthetic and real-world datasets show that our approach dramatically reduces disparity while remaining competitive with state-of-the-art influence maximization methods.
Open AccessAdversarial Graph Embeddings for Fair Influence Maximization over Social Networks
Influence maximization is a widely studied topic in network science, where the aim is to reach the maximum possible number of nodes, while only targeting a small initial set of individuals. It has critical applications in many fields, including viral marketing, information propagation, news dissemination, and vaccinations. However, the objective does not usually take into account whether the final set of influenced nodes is fair with respect to sensitive attributes, such as race or gender. Here we address fair influence maximization, aiming to reach minorities more equitably. We introduce Adversarial Graph Embeddings: we co-train an auto-encoder for graph embedding and a discriminator to discern sensitive attributes. This leads to embeddings which are similarly distributed across sensitive attributes. We then find a good initial set by clustering the embeddings. We believe we are the first to use embeddings for the task of fair influence maximization. While there are typically trade-offs between fairness and influence maximization objectives, our experiments on synthetic and real-world datasets show that our approach dramatically reduces disparity while remaining competitive with state-of-the-art influence maximization methods.