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

Haoyi Li

dblp:333/8010 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 2 · 2 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
Graph learning · 50% Efficient and distributed learning · 50%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph clustering
federated graph clustering
1.012026
Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering · AAAI 2026
Machine learning › Efficient and distributed learning › federated learning
federated graph learning
1.012026
Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering · AAAI 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering · AAAI 2026
Machine learning › Graph learning
graph clustering
1.012026
Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering · AAAI 2026
Data integration and cleaning › missing data
attribute completion
0.312026
Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering · AAAI 2026

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

graph neural network · 2.0causal structure learning · 2.0
YearPublicationVenuePosition
2026 Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering
abstract
Node-level federated graph clustering allows multiple unlabeled subgraph holders to collaboratively train on node-level tasks without sharing private information. Existing methods usually assume that the node attributes are complete and have achieved promising progress. However, in the Federated Graph Learning (FGL) scenarios, this assumption is overly strict due to failures in data collection devices. Consequently, most existing FGL frameworks struggle to extract useful features from attribute-incomplete graphs for clustering, yet the issue remains underexplored. To bridge this gap, we propose a causally-aware attribute completion for Incomplete Federated Graph Clustering (IFedGC), which constructs a reliable global causal structure that incorporates clustering-friendly information to guide attribute completion for each subgraph. Specifically, in the attribute completion step, we first construct the causal structure to extract the causal relationships between initialized features, and then upload them to the server. Subsequently, we integrate multiple uploaded causal structures into a global causal one to achieve cross-client attribute completion. Moreover, to support reliable clustering, we first collect the high-confidence cluster centroids from each subgraph using a Graph Neural Network (GNN) model and subsequently aggregate these centroids on the server. The above two steps are seamlessly integrated into a unified FGL framework to obtain a clustering-oriented causal structure, which is sent back to the client to promote high-quality attribute completion for better clustering. Extensive results on five benchmark datasets demonstrate the effectiveness and superiority of IFedGC against its competitors.
Jingxin Liu 0006, Wenxuan Tu, Renda Han, Haoyi Li, Xiangyan Tang
AAAI5
2024 HERP: Hierarchical and distributed clouds oriented efficient resource scheduling algorithm with stochastic requirements
Haoyi Li
Expert Syst. Appl.2
2024 An improved phase gradient autofocus algorithm for ISAR phase autofocus problem
Weihong Fu, Haoyi Li
J. Supercomput.2
2023 Cost-effective stochastic resource placement in edge clouds with horizontal and vertical sharing
Wei Wei 0016, Haoyi Li, Weidong Yang 0003
Future Gener. Comput. Syst.2