Overlapping community-based fair influence maximization under a multi-transformation optimization algorithm

Fair Influence Maximization (FIM) aims to ensure an equitable spread of influence across different groups in a social network while maximizing overall reach. By incorporating fairness constraints and leveraging community structures, FIM mitigates bias and enhances the effectiveness of influence propagation. Despite its importance, optimizing FIM objectives is computationally challenging, and existing methods often neglect the overlapping nature of community structures. Also, selecting the most suitable transformation in advance is challenging, as different transformations lead to varying search behaviors for evaluating influence spread. To address these issues, this study introduces Overlapping Community-based FIM under a Multi-Transformation Optimization algorithm (OCMTO). OCMTO considers both overlapping and non-overlapping nodes within communities to balance influence spread and fairness. It employs a multi-transformation evolutionary framework that optimizes multiple transformations simultaneously, ensuring scalability and convergence. The algorithm adapts to different transformations without the need for manual selection, allowing it to efficiently explore the solution space. Meanwhile, OCMTO estimates relationships between transformations based on individual overlap. Experimental results on real-world datasets show that OCMTO outperforms state-of-the-art methods in scalability and fairness, demonstrating its practical potential for applications such as digital marketing campaigns, public health interventions, and political influence dissemination. Specifically, the proposed algorithm demonstrates a 9.2% improvement in average influence spread over the best existing method, while effectively addressing the trade-offs between influence, fairness, and complexity.

Authors

Institutions

Publication Details

Journal
Journal Of Big Data
Published
2025-05-28
DOI
https://doi.org/10.1186/s40537-025-01181-y
Citations
3
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
3.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Overlapping community-based fair influence maximization under a multi-transformation optimization algorithm

Chunfeng Jiang, Zhihua Niu, Amin Rezaeipanah, Jie Qu et al.
3 citations
Journal Of Big Data
Complex Network Analysis Techniques
3.97
article

Overlapping community-based fair influence maximization under a multi-transformation optimization algorithm

Chunfeng Jiang, Zhihua Niu, Amin Rezaeipanah, Jie Qu, Yulan Zhao
article en
3 citations

Abstract

Fair Influence Maximization (FIM) aims to ensure an equitable spread of influence across different groups in a social network while maximizing overall reach. By incorporating fairness constraints and leveraging community structures, FIM mitigates bias and enhances the effectiveness of influence propagation. Despite its importance, optimizing FIM objectives is computationally challenging, and existing methods often neglect the overlapping nature of community structures. Also, selecting the most suitable transformation in advance is challenging, as different transformations lead to varying search behaviors for evaluating influence spread. To address these issues, this study introduces Overlapping Community-based FIM under a Multi-Transformation Optimization algorithm (OCMTO). OCMTO considers both overlapping and non-overlapping nodes within communities to balance influence spread and fairness. It employs a multi-transformation evolutionary framework that optimizes multiple transformations simultaneously, ensuring scalability and convergence. The algorithm adapts to different transformations without the need for manual selection, allowing it to efficiently explore the solution space. Meanwhile, OCMTO estimates relationships between transformations based on individual overlap. Experimental results on real-world datasets show that OCMTO outperforms state-of-the-art methods in scalability and fairness, demonstrating its practical potential for applications such as digital marketing campaigns, public health interventions, and political influence dissemination. Specifically, the proposed algorithm demonstrates a 9.2% improvement in average influence spread over the best existing method, while effectively addressing the trade-offs between influence, fairness, and complexity.

Journal Of Big DataVol. 12(1)
Jilin University of Chemical Technology (CN), Jilin Agricultural Science and Technology University (CN), Persian Gulf University (IR)
Jilin Agricultural Science and Technology University
Openalex Percentile: Top 7%
Complex Network Analysis Techniques
3.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.