S. Siamak Ghodsi

dblp:238/9620 · also Siamak Ghodsi · DBLP profile ↗
← Back
4ranked-venue papers in the field
2as first author
3since 2021 · last 2025
0000-0002-3306-4233ORCID · verified

Domains — venue-derived; a paper can count in several

Big Data, Cloud & Distributed Data Systems · 2 (1 first)Data Mining & Knowledge Discovery · 1 (1 first)Knowledge Engineering, Semantic Web & Information Systems · 1
YearPublicationVenuePosition
2025 A Deep Latent Factor Graph Clustering with Fairness-Utility Trade-Off Perspective
abstract
Fair graph clustering seeks partitions that respect network structure while maintaining proportional representation across sensitive groups, with applications spanning community detection, team formation, resource allocation, and social network analysis. Many existing approaches enforce rigid constraints or rely on multi-stage pipelines (e.g., spectral embedding followed by $k$-means), limiting trade-off control, interpretability, and scalability. We introduce \emph{DFNMF}, an end-to-end deep nonnegative tri-factorization tailored to graphs that directly optimizes cluster assignments with a soft statistical-parity regularizer. A single parameter $λ$ tunes the fairness--utility balance, while nonnegativity yields parts-based factors and transparent soft memberships. The optimization uses sparse-friendly alternating updates and scales near-linearly with the number of edges. Across synthetic and real networks, DFNMF achieves substantially higher group balance at comparable modularity, often dominating state-of-the-art baselines on the Pareto front. The code is available at https://github.com/SiamakGhodsi/DFNMF.git.
S. Siamak Ghodsi, Seyed Amjad Seyedi, Tai Le Quy, Fariba Karimi 0001, Eirini Ntoutsi
IEEE Big Data1
2024 Adversarial Reweighting Guided by Wasserstein Distance to Achieve Demographic Parity
abstract
To address bias issues, fair machine learning usually jointly optimizes two (or more) metrics aiming at predictive utility and fairness. However, the inherent under-representation of minorities in the data often makes the disparate impact of subpopulations less noticeable and difficult to deal with during learning. In this paper, we propose a novel adversarial reweighting method to address such disparate impact. To balance the data distribution between the majority and the minority groups, our approach prefers samples from the majority group that are closer to the minority group as evaluated by the Wasserstein distance. Theoretical analysis shows the effectiveness of our adversarial reweighting approach. Experiments demonstrate that our approach mitigates disparate impact without sacrificing classification accuracy, outperforming related state-of-the-art methods on image and tabular benchmark datasets. Code is available at https://github.com/zhaoxuan00707/wasserstein_reweight.
Xuan Zhao 0025, Simone Fabbrizzi, Paula Reyero Lobo, S. Siamak Ghodsi, Klaus Broelemann, Steffen Staab, Gjergji Kasneci
IEEE Big Data4
2024 Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering
S. Siamak Ghodsi, Seyed Amjad Seyedi, Eirini Ntoutsi
PAKDD (1)1
2019 An ideal point based many-objective optimization for community detection of complex networks
Sahar Tahmasebi, Parham Moradi, S. Siamak Ghodsi, Alireza Abdollahpouri
Inf. Sci.3