Fairness-Aware Maximal Cliques Identification in Attributed Social Networks With Concept-Cognitive Learning

Attributed social networks are pervasive in real life and play a crucial role in shaping various aspects of society. These networks not only capture the connections between individuals but also encompass the associated attributes and characteristics. Analyzing and understanding these attributes provide insights into social behaviors, information diffusion patterns, and the formation of influential communities. Consequently, we propose a novel algorithm for detecting fairness-aware maximal cliques in the attributed social networks. We extract the concept lattice of attributed social networks and quantify these concepts using the concept stability and fairness measures defined in this article. By utilizing the proposed fairness-aware distance, we identify fairness-aware maximal cliques within attributed social networks. The effectiveness of the algorithm is then validated using five real-world network datasets. Experimental results fully demonstrate the effectiveness and scalability of our approach in identifying key structures, analyzing attribute networks, and promoting the development of responsible computational systems.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2024-09-09
DOI
https://doi.org/10.1109/tcss.2024.3445721
Citations
6
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fairness-Aware Maximal Cliques Identification in Attributed Social Networks With Concept-Cognitive Learning

Fei Hao, Sergei O. Kuznetsov, Wei Ling, Huilai Zhi et al.
6 citations
IEEE Transactions on Computational Social Systems
Advanced Graph Neural Networks
2.08
article

Fairness-Aware Maximal Cliques Identification in Attributed Social Networks With Concept-Cognitive Learning

Fei Hao, Sergei O. Kuznetsov, Wei Ling, Huilai Zhi, Geyong Min, Min Tao
article en
6 citations

Abstract

Attributed social networks are pervasive in real life and play a crucial role in shaping various aspects of society. These networks not only capture the connections between individuals but also encompass the associated attributes and characteristics. Analyzing and understanding these attributes provide insights into social behaviors, information diffusion patterns, and the formation of influential communities. Consequently, we propose a novel algorithm for detecting fairness-aware maximal cliques in the attributed social networks. We extract the concept lattice of attributed social networks and quantify these concepts using the concept stability and fairness measures defined in this article. By utilizing the proposed fairness-aware distance, we identify fairness-aware maximal cliques within attributed social networks. The effectiveness of the algorithm is then validated using five real-world network datasets. Experimental results fully demonstrate the effectiveness and scalability of our approach in identifying key structures, analyzing attribute networks, and promoting the development of responsible computational systems.

IEEE Transactions on Computational Social SystemsVol. 11(6)
National Research University Higher School of Economics (RU), Quanzhou Normal University (CN), University of Exeter (GB), Northwest University (CN), Shaanxi Normal University (CN)
Reduced inequalities
Openalex Percentile: Top 11%
Advanced Graph Neural Networks
2.08
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.