Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Puqing Jiang

dblp:368/1124 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 91% Graph learning · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness
fair graph learning
1.012026
Fair Graph Learning with Limited Sensitive Attribute Information · AAAI 2026
Machine learning › Trustworthy machine learning › fairness › fair graph learning
fair graph neural network
1.012026
Fair Graph Learning with Limited Sensitive Attribute Information · AAAI 2026
Machine learning › Trustworthy machine learning
fairness
1.012026
Fair Graph Learning with Limited Sensitive Attribute Information · AAAI 2026
Machine learning › Graph learning
graph neural network
0.312026
Fair Graph Learning with Limited Sensitive Attribute Information · AAAI 2026

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.0fairness optimization · 1.0
YearPublicationVenuePosition
2026 Fair Graph Learning with Limited Sensitive Attribute Information
abstract
Graph neural networks (GNNs) excel at modeling graph-structured data but often inherit and amplify biases, leading to substantial efforts in developing fair GNNs. However, most existing approaches assume full access to sensitive attribute information, which is often impractical in real-world scenarios due to privacy concerns or risks of discrimination. To address this limitation, this paper focuses on graph fairness with limited sensitive attribute information, ensuring applicability to real-world contexts where current methods fall short. Specifically, we introduce an innovative fairness optimization strategy, propose a novel framework named FGLISA, and provide a theoretical perspective linking limited sensitive attribute information access to fairness objectives, thus enabling fair graph learning in real-world applications with limited sensitive attribute information. Experiments on diverse real-world datasets and tasks validate the effectiveness of our approach in achieving both fairness and predictive performance.
Zichong Wang, Jie Yang 0009, Jun Zhuang 0004, Puqing Jiang, Mingzhe Chen, Wenbin Zhang 0002
AAAI4