Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fair Influence Maximization in Social Networks: A Community-Based Evolutionary Algorithm (2311.14288v1)

Published 24 Nov 2023 in cs.SI

Abstract: Influence Maximization (IM) has been extensively studied in network science, which attempts to find a subset of users to maximize the influence spread. A new variant of IM, Fair Influence Maximization (FIM), which primarily enhances the fair propagation of information, attracts increasing attention in academic. However, existing algorithms for FIM suffer from a trade-off between fairness and running time. Since it is a tough task to ensure that users are fairly influenced in terms of sensitive attributes, such as race or gender, while maintaining a high influence spread. To tackle this problem, in this paper, we propose an effective and efficient Community-based Evolutionary Algorithm for FIM (named CEA-FIM). In CEA-FIM, a community-based node selection strategy is proposed to identify potential nodes, which not only considers the size of the community but also the attributes of the nodes in the community. Subsequently, we design an evolutionary algorithm based on the proposed node selection strategy to hasten the search for the optimal solution, including the novel initialization, crossover and mutation strategies. We validate the proposed algorithm CEA-FIM by performing experiments on real-world and synthetic networks. The experimental results show that the proposed CEA-FIM achieves a better balance between effectiveness and efficiency, compared to the state-of-the-art baseline algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Y. Li, J. Fan, Y. Wang, and K.-L. Tan, “Influence maximization on social graphs: A survey,” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 10, pp. 1852–1872, 2018.
  2. A. Yadav, B. Wilder, E. Rice, R. Petering, J. Craddock, A. Yoshioka-Maxwell, M. Hemler, L. Onasch-Vera, M. Tambe, and D. Woo, “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, 2018, pp. 5399–5403.
  3. W. Chen, W. Lu, and N. Zhang, “Time-critical influence maximization in social networks with time-delayed diffusion process,” in Proceedings of the 26th AAAI Conference on Artificial Intelligence, vol. 26, no. 1, 2012, pp. 591–598.
  4. X. He, G. Song, W. Chen, and Q. Jiang, “Influence blocking maximization in social networks under the competitive linear threshold model,” in Proceedings of the 12th SIAM International Conference on Data Mining, 2012, pp. 463–474.
  5. A. Banerjee, A. G. Chandrasekhar, E. Duflo, and M. O. Jackson, “The diffusion of microfinance,” Science, vol. 341, no. 6144, p. 1236498, 2013.
  6. P. Domingos and M. Richardson, “Mining the network value of customers,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, pp. 57–66.
  7. D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137–146.
  8. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 420–429.
  9. J. Kim, S.-K. Kim, and H. Yu, “Scalable and parallelizable processing of influence maximization for large-scale social networks?” in Proceedings of the 29th IEEE International Conference on Data Engineering, 2013, pp. 266–277.
  10. W. Chen, R. Wu, and Z. Yu, “Scalable lattice influence maximization,” IEEE Transactions on Computational Social Systems, vol. 7, no. 4, pp. 956–970, 2020.
  11. S. Wang, J. Liu, and Y. Jin, “Finding influential nodes in multiplex networks using a memetic algorithm,” IEEE Transactions on Cybernetics, vol. 51, no. 2, pp. 900–912, 2021.
  12. L. Zhang, K. Ma, H. Yang, C. Zhang, H. Ma, and Q. Liu, “A search space reduction-based progressive evolutionary algorithm for influence maximization in social networks,” IEEE Transactions on Computational Social Systems, pp. 1–15, 2022.
  13. R. W. Pfeifer and J. Oliver, “A study of HIV seroprevalence in a group of homeless youth in hollywood, california,” Journal of Adolescent Health, vol. 20, no. 5, pp. 339–342, 1997.
  14. N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan, “A survey on bias and fairness in machine learning,” ACM Computing Surveys, vol. 54, no. 6, pp. 1–35, 2021.
  15. S. Caton and C. Haas, “Fairness in machine learning: A survey,” arXiv preprint arXiv:2010.04053, 2020.
  16. Y. Dong, J. Ma, C. Chen, and J. Li, “Fairness in graph mining: A survey,” arXiv preprint arXiv:2204.09888, 2022.
  17. A. Tsang, B. Wilder, E. Rice, M. Tambe, and Y. Zick, “Group-fairness in influence maximization,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2019, pp. 5997–6005.
  18. M. Khajehnejad, A. A. Rezaei, M. Babaei, J. Hoffmann, M. Jalili, and A. Weller, “Adversarial graph embeddings for fair influence maximization over social networks,” in Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence, 2020, pp. 4306–4312.
  19. A. Khajehnejad, M. Khajehnejad, M. Babaei, K. P. Gummadi, A. Weller, and B. Mirzasoleiman, “CrossWalk: Fairness-enhanced node representation learning,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, 2022, pp. 11 963–11 970.
  20. B. Razaghi, M. Roayaei, and N. M. Charkari, “On the group-fairness-aware influence maximization in social networks,” IEEE Transactions on Computational Social Systems, pp. 1–9, 2022.
  21. H. Gong and C. Guo, “Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge,” Expert Systems with Applications, vol. 214, p. 119138, 2023.
  22. B. Fish, A. Bashardoust, D. Boyd, S. Friedler, C. Scheidegger, and S. Venkatasubramanian, “Gaps in information access in social networks?” in Proceedings of the 2019 World Wide Web Conference, 2019, pp. 480–490.
  23. A.-A. Stoica and A. Chaintreau, “Fairness in social influence maximization,” in Companion Proceedings of the 2019 World Wide Web Conference, 2019, pp. 569–574.
  24. W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977.
  25. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002.
  26. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, p. P10008, 2008.
  27. Y. Wang, G. Cong, G. Song, and K. Xie, “Community-based greedy algorithm for mining top-k influential nodes in mobile social networks,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010, pp. 1039–1048.
  28. M. Styczen, B.-J. Chen, Y.-W. Teng, Y.-A. Pignolet, L. Chen, and D.-N. Yang, “Targeted influence with community and gender-aware seeding,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022, pp. 4515–4519.
  29. L. Zhang, Y. Liu, F. Cheng, J. Qiu, and X. Zhang, “A local-global influence indicator based constrained evolutionary algorithm for budgeted influence maximization in social networks,” IEEE Transactions on Network Science and Engineering, vol. 8, no. 2, pp. 1557–1570, 2021.
  30. X. Li, X. Cheng, S. Su, and C. Sun, “Community-based seeds selection algorithm for location aware influence maximization,” Neurocomputing, vol. 275, pp. 1601–1613, 2018.
  31. J. Goldenberg, B. Libai, and E. Muller, “Talk of the network: A complex systems look at the underlying process of word-of-mouth,” Marketing Letters, vol. 12, no. 3, pp. 211–223, 2001.
  32. J. Shang, S. Zhou, X. Li, L. Liu, and H. Wu, “CoFIM: A community-based framework for influence maximization on large-scale networks,” Knowledge-Based Systems, vol. 117, pp. 88–100, 2017.
  33. S. Kumar, A. Kumar, and B. Panda, “Identifying influential nodes for smart enterprises using community structure with integrated feature ranking,” IEEE Transactions on Industrial Informatics, vol. 19, no. 1, pp. 703–711, 2022.
  34. G. Farnad, B. Babaki, and M. Gendreau, “A unifying framework for fairness-aware influence maximization,” in Companion Proceedings of the 2020 World Wide Web Conference, 2020, pp. 714–722.
  35. A. Rahmattalabi, S. Jabbari, H. Lakkaraju, P. Vayanos, M. Izenberg, R. Brown, E. Rice, and M. Tambe, “Fair influence maximization: A welfare optimization approach,” in Proceedings of the 35th AAAI Conference on Artificial Intelligence, 2021, pp. 11 630–11 638.
  36. R. Becker, G. D’Angelo, S. Ghobadi, and H. Gilbert, “Fairness in influence maximization through randomization,” in Proceedings of the 35th AAAI Conference on Artificial Intelligence, vol. 35, no. 17, 2021, pp. 14 684–14 692.
  37. L. Ma, M. Huang, S. Yang, R. Wang, and X. Wang, “An adaptive localized decision variable analysis approach to large-scale multiobjective and many-objective optimization,” IEEE Transactions on Cybernetics, vol. 52, no. 7, pp. 6684–6696, 2022.
  38. L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank citation ranking: Bringing order to the web.” Stanford InfoLab, Tech. Rep., 1999.
  39. A. Mislove, B. Viswanath, K. P. Gummadi, and P. Druschel, “You are who you know: Inferring user profiles in online social networks,” in Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, 2010, pp. 251–260.
  40. M. Babaei, P. Grabowicz, I. Valera, K. P. Gummadi, and M. Gomez-Rodriguez, “On the efficiency of the information networks in social media,” in Proceedings of the 9th ACM International Conference on Web Search and Data Mining, 2016, pp. 83–92.
  41. M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi, “Measuring user influence in Twitter: The million follower fallacy,” in Proceedings of the 4th International AAAI Conference on Weblogs and Social Media (ICWSM 2010), 2010, pp. 10–17.
  42. B. Wilder, H. C. Ou, K. de la Haye, and M. Tambe, “Optimizing network structure for preventative health,” in Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018, pp. 841–849.
  43. M. Roayaei, “On the binarization of grey wolf optimizer: A novel binary optimizer algorithm,” Soft Computing, vol. 25, no. 23, pp. 14 715–14 728, 2021.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now