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

Zeyu Bi

dblp:415/3950 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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
Graph learning · 72% Efficient and distributed learning · 22% Probabilistic and Bayesian machine learning · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph clustering
federated graph clustering
0.912025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025
Machine learning › Graph learning
graph clustering
0.912025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025
Machine learning › Graph learning › graph clustering
multi-view graph clustering
0.912025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025
Machine learning › Graph learning
graph neural network
0.312025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025
Machine learning › Probabilistic and Bayesian machine learning › missing data
missing data imputation
0.312025
Federated Multi-view Graph Clustering with Incomplete Attribute Imputation · IJCAI 2025

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

non-parametric graph neural network · 0.9anchor graph · 0.9
YearPublicationVenuePosition
2025 Federated Multi-view Graph Clustering with Incomplete Attribute Imputation
abstract
Federated Multi-View Clustering (FedMVC) aims to uncover consistent clustering structures from distributed multi-view data for clustering while preserving data privacy. However, existing FedMVC methods under vertical settings either ignore the ubiquitous incomplete view issue or require uploading data features, which may lead to privacy leakage or induce high communication costs. To mitigate the view incompleteness issue and simultaneously maintain privacy and efffciency, we propose a novel Federated Multiview Graph Clustering with Incomplete Attribute Imputation (FMVC-IAI). This method constructs a consensus graph structure through complementary multi-view data and then utilizes a non-parametric graph neural network (GNN) to impute missing features. Additionally, it utilizes the adjacency graph as the knowledge carrier to share and fuse the multi-view information. To alleviate the high communication cost due to graph sharing, we proposed to share the anchor graph for global adjacency graph construction, which reduces communication cost and also helps to reduce privacy leakage risk. Extensive experiments demonstrate the superiority of our method in FedMVC tasks with incomplete views.
Wei Feng 0010, Zeyu Bi, Qianqian Wang 0001, Bo Dong 0001
IJCAI2