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

Daimin Tan

dblp:400/5811 · 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

Computer networks · 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
Efficient and distributed learning · 100%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning
client selection
0.912025
Device Selection and Resource Allocation With Semi-Supervised Method for Federated Edge Learning · IEEE Trans. Mob. Comput. 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Device Selection and Resource Allocation With Semi-Supervised Method for Federated Edge Learning · IEEE Trans. Mob. Comput. 2025
Machine learning › Efficient and distributed learning
resource allocation
0.912025
Device Selection and Resource Allocation With Semi-Supervised Method for Federated Edge Learning · IEEE Trans. Mob. Comput. 2025
Edge and fog computing
edge devices
0.312025
Device Selection and Resource Allocation With Semi-Supervised Method for Federated Edge Learning · IEEE Trans. Mob. Comput. 2025

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

semi-supervised learning · 1.7incentive optimization · 1.7bipartite graph matching · 1.7
YearPublicationVenuePosition
2025 Device Selection and Resource Allocation With Semi-Supervised Method for Federated Edge Learning
abstract
With the rapid growth of distributed learning and workflow orchestration, Federated Edge Learning has emerged as a solution, enabling multiple edge devices to collaboratively train a large model without the need for sharing raw data. Beyond considering bandwidth and computational resource limitations in the Internet of Things (IoT) environment, it is crucial to address the issue of IoT devices often collecting data that lacks timely annotations, which can lead to latency and label deficiency issues. In most Federated Edge Learning mechanisms, clients’ weights are selected for offloading to the server. In this paper, we propose a solution for dynamic edge selection and wireless network allocation under semi-supervised and privacy protection settings, termed Semi-supervised Scheduling and Allocation Optimization for Federated Edge Learning (SSAFL). SSAFL is designed to adapt to various scenarios, including channel state variations, device heterogeneity, resource incentives, deadline control, label deficiencies, and Non-IID data distributions. This adaptability is achieved through the utilization of an Incentive Optimization framework that encompasses bandwidth allocation and device scheduling policies. Within SSAFL, we introduce the concept of a weighted bipartite graph network to tackle the Incentive Optimization problem and achieve a balance in large-scale optimization of device selection. Additionally, to address the label deficiency issue, we devise a Dynamic Timer for deadline control for each client. Comprehensive and confidential results demonstrate that our proposed approach significantly outperforms other Federated Edge Learning baselines.
Ruihan Hu, Haochen Yuan 0001, Daimin Tan, Zhongjie Wang 0003
IEEE Trans. Mob. Comput.3