1 citations · 1 across the 21 of their papers we have counts for
4 papers · 1 filter
Efficient Maximum Fair Clique Search over Large Networks
Qi Zhang, Rong-Hua Li, Zifan Zheng +3
Mining cohesive subgraphs in attributed graphs is an essential problem in the domain of graph data analysis. The integration of fairness considerations significantly fuels interest…
Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification
Henan Sun, Xunkai Li, Zhengyu Wu +3
Recently, graph neural networks (GNNs) have shown prominent performance in semi-supervised node classification by leveraging knowledge from the graph database. However, most existi…
Scalable Algorithms for Laplacian Pseudo-inverse Computation
Meihao Liao, Rong-Hua Li, Qiangqiang Dai +2
The pseudo-inverse of a graph Laplacian matrix, denoted as , finds extensive application in various graph analysis tasks. Notable examples include the calculation of ele…
Privacy-Preserving Graph Embedding based on Local Differential Privacy
Zening Li, Rong-Hua Li, Meihao Liao +2
Graph embedding has become a powerful tool for learning latent representations of nodes in a graph. Despite its superior performance in various graph-based machine learning tasks,…