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

Biao Mei

dblp:149/7821 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-6038-0370ORCID · verified

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
Efficient and distributed learning · 50% Probabilistic and Bayesian machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.912025
Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation · NeurIPS 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation · NeurIPS 2025
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.912025
Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › posterior inference
posterior aggregation
0.912025
Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation · NeurIPS 2025

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

wasserstein barycenter · 0.9particle-based variational inference · 0.9
YearPublicationVenuePosition
2026 A heterogeneous graph neural network with spatial-temporal and operating condition-aware message passing mechanism for RUL prediction of aero-engines
Ruoyao Tian, Haorui Sun, Biao Mei, Yun Fu 0010
Adv. Eng. Informatics3
2025 Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation
abstract
Personalized Bayesian federated learning (PBFL) handles non-i.i.d. client data and quantifies uncertainty by combining personalization with Bayesian inference. However, current PBFL methods face two main limitations: posterior inference on clients often assumes restrictive parametric forms, and server-side posterior aggregation typically relies on naive parameter averaging. To overcome these issues, we propose FedWBA, a novel PBFL method that enhances both local inference and global aggregation. At the client level, we use particle-based variational inference for nonparametric posterior representation. At the server level, we introduce particle-based Wasserstein barycenter aggregation, offering a more geometrically meaningful approach. Theoretically, we provide local and global convergence guarantees for FedWBA. Locally, we prove a KL divergence decrease lower bound per iteration for variational inference convergence. Globally, we show that the Wasserstein barycenter converges to the true parameter as the client data size increases. Empirically, experiments show that FedWBA outperforms baselines in prediction accuracy, uncertainty calibration, and convergence rate, with ablation studies confirming its robustness.
Biao Mei, Junliang Lyu, Renquan Zhang
NeurIPS2
2023 One-shot relational learning for extrapolation reasoning on temporal knowledge graphs
Ruixin Ma, Biao Mei, Meihong Liu, Liang Zhao 0005
Data Min. Knowl. Discov.2
2023 PANC: Prototype Augmented Neighbor Constraint instance completion in knowledge graphs
Ruixin Ma, Biao Mei, Guangyue Lv, Liang Zhao 0005
Expert Syst. Appl.4
2015 A new elliptic contour extraction method for reference hole detection in robotic drilling
Biao Mei, Guo-Rui Yan, Yinglin Ke
Pattern Anal. Appl.1
2014 Development of a monocular vision system for robotic drilling
abstract
Robotic drilling for aerospace structures demands a high positioning accuracy of the robot, which is usually achieved through error measurement and compensation. In this paper, we report the development of a practical monocular vision system for measurement of the relative error between the drill tool center point (TCP) and the reference hole. First, the principle of relative error measurement with the vision system is explained, followed by a detailed discussion on the hardware components, software components, and system integration. The elliptical contour extraction algorithm is presented for accurate and robust reference hole detection. System calibration is of key importance to the measurement accuracy of a vision system. A new method is proposed for the simultaneous calibration of camera internal parameters and hand-eye relationship with a dedicated calibration board. Extensive measurement experiments have been performed on a robotic drilling system. Experimental results show that the measurement accuracy of the developed vision system is higher than 0.15 mm, which meets the requirement of robotic drilling for aircraft structures.
Biao Mei, Guo-Rui Yan, Yinglin Ke
J. Zhejiang Univ. Sci. C2