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

Yuchen Jiang 0004

dblp:189/0003-4 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0001-7632-1300ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Security and privacy · 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
2 papers
Segmentation and scene understanding · 53% Generative modeling · 30% Efficient and distributed learning · 9%
Network and information security
1 paper
Security and privacy of machine learning · 50% Cryptographic protocols and secure computation · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
0.912025
FedG3FA: Three-Stage GAN-Aided Target Feature Alignment for Secure Data Sharing in Federated Learning System · IEEE Trans. Inf. Forensics Secur. 2025
Security and privacy of machine learning
federated learning security
0.912025
FedG3FA: Three-Stage GAN-Aided Target Feature Alignment for Secure Data Sharing in Federated Learning System · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation
secure data sharing
0.912025
FedG3FA: Three-Stage GAN-Aided Target Feature Alignment for Secure Data Sharing in Federated Learning System · IEEE Trans. Inf. Forensics Secur. 2025
Computer vision › Segmentation and scene understanding
scene graph generation
0.812024
Adaptive Feature Learning for Unbiased Scene Graph Generation · IEEE Trans. Image Process. 2024
Computer vision › Segmentation and scene understanding › scene graph generation
unbiased scene graph generation
0.812024
Adaptive Feature Learning for Unbiased Scene Graph Generation · IEEE Trans. Image Process. 2024
Machine learning › Efficient and distributed learning
federated learning
0.312025
FedG3FA: Three-Stage GAN-Aided Target Feature Alignment for Secure Data Sharing in Federated Learning System · IEEE Trans. Inf. Forensics Secur. 2025
Machine learning › Graph learning › graph neural network › message passing
adaptive message passing
0.212024
Adaptive Feature Learning for Unbiased Scene Graph Generation · IEEE Trans. Image Process. 2024

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

generative adversarial network · 1.7feature alignment · 1.7debiasing · 0.8bi-level curriculum learning · 0.8adaptive message passing · 0.8
YearPublicationVenuePosition
2025 FedG3FA: Three-Stage GAN-Aided Target Feature Alignment for Secure Data Sharing in Federated Learning System
Qingxia Li, Yuchen Jiang 0004, Ray Y. Zhong, Xiaochun Cao
IEEE Trans. Inf. Forensics Secur.2
2024 Adaptive Feature Learning for Unbiased Scene Graph Generation
abstract
Scene Graph Generation (SGG) aims to detect all objects and identify their pairwise relationships in the scene. Recently, tremendous progress has been made in exploring better context relationship representations. Previous work mainly focuses on contextual information aggregation and uses de-biasing strategies on samples to eliminate the preference for head predicates. However, there remain challenges caused by indeterminate feature training. Overlooking the label confusion problem in feature training easily results in a messy feature distribution among the confused categories, thereby affecting the prediction of predicates. To alleviate the aforementioned problem, in this paper, we focus on enhancing predicate representation learning. Firstly, we propose a novel Adaptive Message Passing (AMP) network to dynamically conduct information propagation among neighbors. AMP provides discriminating representations for neighbor nodes under the view of de-noising and adaptive aggregation. Furthermore, we construct a feature-assisted training paradigm alongside the predicate classification branch, guiding predicate feature learning to the corresponding feature space. Moreover, to alleviate biased prediction caused by the long-tailed class distribution and the interference of confused labels, we design a Bi-level Curriculum learning scheme (BiC). The BiC separately considers the training from the feature learning and de-biasing levels, preserving discriminating representations of different predicates while resisting biased predictions. Results on multiple SGG datasets show that our proposed method AMP-BiC has superior comprehensive performance, demonstrating its effectiveness.
Chuan Wang 0002, Liang Yang 0002, Yuchen Jiang 0004, Angelina Cao
IEEE Trans. Image Process.4
2022 Electrical-STGCN: An Electrical Spatio-Temporal Graph Convolutional Network for Intelligent Predictive Maintenance
abstract
With the rapid improvement of Industrial Internet of Things and artificial intelligence, predictive maintenance (PdM) has attracted great attention from both academia and industrial practitioners. When equipment is running, the electrical attributes have intrinsic relations. Meanwhile, they are changing over time. However, existing PdM models are often limited as they lack considering both attribute interactions and temporal dependence of the dynamic working system. To address the problem, in this article, we propose an electrical spatio-temporal graph convolutional network (Electrical-STGCN) for PdM. First, it takes a sequence of electrical records as input. Next, both attribute interactions and temporal dependence are established to extract features. Then, the extracted features are fed into a prediction component. Finally, the output of the Electrical-STGCN (i.e., remaining useful life) can help the workers decide whether to carry out equipment maintenance. The effectiveness of the proposed method is verified in real-world cases. Our method achieves 85.2% Accuracy and 0.9 F1-Score, which are better than the other approaches.
Yuchen Jiang 0004, Pengwen Dai, Pengcheng Fang, Ray Y. Zhong, Xiaochun Cao
IEEE Trans. Ind. Informatics1
2021 Flexible Worker Allocation in Aircraft Final Assembly Line Using Multiobjective Evolutionary Algorithms
abstract
In a paced aircraft final assembly line, some disturbances can be collected timely on the basis of the cyber-physical production system. In order to reduce the execution deviation, some workers need to switch among stations after a fixed period. Thus, a worker allocation problem with the multistage workstation is introduced first. Then, an integer programming formulation is presented to formulate the problem with the objective of shortest workstation cycle and the workload balance of both stations and workers. Moreover, a modified nondominated sorting genetic algorithm (NSGA-IV) is proposed to solve it, which tradeoff the convergence and the population diversity in the decision space. Finally, the NSGA-IV algorithm compares with five multiobjective evolutionary algorithms in a real-world case. Compared with manual allocation, the takt time of an aircraft final assembly line is reduced by 20.86% by using the NSGA-IV algorithm.
Pengcheng Fang, Qingmiao Liao, Ray Y. Zhong, Yuchen Jiang 0004
IEEE Trans. Ind. Informatics5