Minimizing a newly defined fairness-modularity is proved to be exactly equivalent to enforcing equal protected-group proportions in every community, and a greedy Fast Newman variant is proposed to optimize it.
Community detection in graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Recovering Fairness Directly from Modularity: a New Way for Fair Community Partitioning
Minimizing a newly defined fairness-modularity is proved to be exactly equivalent to enforcing equal protected-group proportions in every community, and a greedy Fast Newman variant is proposed to optimize it.