Yuanting Yan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuanting Yan has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
- Peng Zhou
Anhui University
8 shared publications Yanping Zhang
Anhui Univ, Sch Comp Sci & Technol, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230601, Peoples R China
7 shared publicationsChengjin Yu
Anhui University
6 shared publications- Shu Zhao
Anhui University
6 shared publications - Yanping Zhang
Anhui University
5 shared publications Jie Chen
4 shared publications
Latest Publications
- 25 September 2026
- Published by Springer Nature
- p. 58-68
Cardiac Motion Transfer with Adaptive Physics Constraint
- 25 September 2026
- Published by Springer Nature
- p. 58-68
Cardiac Motion Transfer with Adaptive Physics Constraint
- 1 September 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (5) , 88
Recgp: gradient penalization for transferable adversarial attacks in recommendation systems
- 1 September 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (5) , 88
Recgp: gradient penalization for transferable adversarial attacks in recommendation systems
- 9 July 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (3) , 139
Multimodal backdoor attack on VLMs for autonomous driving via graffiti and cross-lingual triggers
- 9 July 2026
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 29 (3) , 139
Multimodal backdoor attack on VLMs for autonomous driving via graffiti and cross-lingual triggers
- 8 April 2026
- Published by Elsevier in Computerized Medical Imaging and Graphics
- Vol. 131, 102763
A deep cardiac motion field analysis approach via global 2nd-order kinematic graph modeling
- 8 April 2026
- Published by Elsevier in Computerized Medical Imaging and Graphics
- Vol. 131, 102763
A deep cardiac motion field analysis approach via global 2nd-order kinematic graph modeling
- 3 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 3850-3864
EcoPath: Energy-Efficient Multi-Path Data Aggregation for Ubiquitous Connectivity Services
Ubiquitous connectivity is a key 6G usage scenario, in which large-scale sensing systems deployed in remote and underserved regions must deliver heterogeneous sensing data under stringent energy budgets and deadline constraints. This paper presents EcoPath, a two-tier data aggregation framework for clustered large-scale sensor networks. EcoPath separates low-power intra-cluster collection from a high-rate multi-interface backhaul operated by cluster heads, where Multipath QUIC (MPQUIC) can be practically deployed to exploit path diversity. At the cluster head, EcoPath jointly integrates (i) a deadline-aware bundling controller that aggregates sensor frames into MTU-bounded bundles to amortize protocol overhead while bounding additional waiting time, and (ii) a robust multi-path scheduler that prioritizes packets using Weighted Earliest- Deadline-First (W-EDF) with fairness protection and selects backhaul paths via a stability-aware quality metric with hysteresis to avoid flapping under time-varying links. We further formulate an explicit energy–timeliness optimization and show how its outputs parameterize the online bundling and scheduling policies. Extensive simulations with realistic wireless effects, together with baselines and ablations, demonstrate that EcoPath improves energy efficiency and deadline satisfaction for large-scale aggregation.
- 3 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 3850-3864
EcoPath: Energy-Efficient Multi-Path Data Aggregation for Ubiquitous Connectivity Services
Ubiquitous connectivity is a key 6G usage scenario, in which large-scale sensing systems deployed in remote and underserved regions must deliver heterogeneous sensing data under stringent energy budgets and deadline constraints. This paper presents EcoPath, a two-tier data aggregation framework for clustered large-scale sensor networks. EcoPath separates low-power intra-cluster collection from a high-rate multi-interface backhaul operated by cluster heads, where Multipath QUIC (MPQUIC) can be practically deployed to exploit path diversity. At the cluster head, EcoPath jointly integrates (i) a deadline-aware bundling controller that aggregates sensor frames into MTU-bounded bundles to amortize protocol overhead while bounding additional waiting time, and (ii) a robust multi-path scheduler that prioritizes packets using Weighted Earliest- Deadline-First (W-EDF) with fairness protection and selects backhaul paths via a stability-aware quality metric with hysteresis to avoid flapping under time-varying links. We further formulate an explicit energy–timeliness optimization and show how its outputs parameterize the online bundling and scheduling policies. Extensive simulations with realistic wireless effects, together with baselines and ablations, demonstrate that EcoPath improves energy efficiency and deadline satisfaction for large-scale aggregation.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. PP (8) , 1-14
Online Explainable Streaming Feature Selection and Classification via Feature Polarity
Feature selection is a crucial preprocessing step that identifies the most relevant features from a dataset. In practical situations, data is often dynamic, with features generated in real time. As a result, online streaming feature selection methods have been developed to manage the continuous arrival of streaming features. However, most current techniques prioritize accuracy, scalability, and efficiency, frequently neglecting the interpretability of the selected features. To address this shortcoming, we introduce a novel Online Explainable Streaming Feature Selection and Classification method, called OESFSC. Drawing inspiration from the “Yin and Yang” philosophy, we introduce the concept of feature polarity, categorizing features into positive and negative types. Positive features aid in enhancing specific prediction outcomes, while negative features help eliminate certain possibilities. OESFSC dynamically selects individual subsets for each type of polarity and integrates the results. This strategy not only improves accuracy but also enhances model interpretability. We compare OESFSC to five conventional feature selection algorithms and six online streaming feature selection methods across 18 datasets. Comprehensive experimental results confirm the effectiveness of our proposed method, and a real-world case study demonstrates the interpretability of the features selected through OESFSC.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. PP (8) , 1-14
Online Explainable Streaming Feature Selection and Classification via Feature Polarity
Feature selection is a crucial preprocessing step that identifies the most relevant features from a dataset. In practical situations, data is often dynamic, with features generated in real time. As a result, online streaming feature selection methods have been developed to manage the continuous arrival of streaming features. However, most current techniques prioritize accuracy, scalability, and efficiency, frequently neglecting the interpretability of the selected features. To address this shortcoming, we introduce a novel Online Explainable Streaming Feature Selection and Classification method, called OESFSC. Drawing inspiration from the “Yin and Yang” philosophy, we introduce the concept of feature polarity, categorizing features into positive and negative types. Positive features aid in enhancing specific prediction outcomes, while negative features help eliminate certain possibilities. OESFSC dynamically selects individual subsets for each type of polarity and integrates the results. This strategy not only improves accuracy but also enhances model interpretability. We compare OESFSC to five conventional feature selection algorithms and six online streaming feature selection methods across 18 datasets. Comprehensive experimental results confirm the effectiveness of our proposed method, and a real-world case study demonstrates the interpretability of the features selected through OESFSC.
- 21 September 2025
- Published by Springer Nature
- p. 438-447
Multiscale Graph and Multi-step Cross-Frame Mamba for Myocarditis Lesion Segmentation
- 21 September 2025
- Published by Springer Nature
- p. 438-447
Multiscale Graph and Multi-step Cross-Frame Mamba for Myocarditis Lesion Segmentation
- 5 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
Learning diversified features for pulmonary hypertension detection using chest X-ray
- 5 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
Learning diversified features for pulmonary hypertension detection using chest X-ray
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (1) , 705-720
Density-Based Online Concept Evolution Detection in Streaming Features
In practical applications, data are often dynamic, generated, and collected continuously. There are two types of streaming data: streaming samples and streaming features. Online learning from streaming data faces two primary challenges: infinite data length and changing concepts. Much research focuses on concept changes in sample streams, such as concept drift. In contrast, existing methods for streaming feature learning predominantly emphasize feature selection or online classification. However, concept evolution also occurs in feature streams. This paper introduces a novel method for detecting concept evolution in feature streams, termed D-CED-FS. This method comprises an adaptive sliding window, an improved parameter-free clustering algorithm, a density-based concept evolution prediction mechanism, a similarity-based concept evaluation method, and a visualization tool using weighted bipartite graphs. The adaptive sliding window module adjusts the size of detection windows in real time based on concept evolution in adjacent windows. The efficient adaptive clustering module, enhanced through natural neighbor methods, eliminates the need for parameter setting and can automatically generate the optimal concept set for each feature window to accommodate feature streams. The concept evolution prediction module reduces repeated clustering for each window, significantly enhancing the algorithm's detection efficiency. The visualization tool, employing a weighted bipartite graph, intuitively illustrates various types of detected concept evolution. Extensive experiments on synthetic and high-dimensional datasets demonstrate the effectiveness of the clustering algorithm and D-CED-FS's capability to detect concept evolution in feature streams.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (1) , 705-720
Density-Based Online Concept Evolution Detection in Streaming Features
In practical applications, data are often dynamic, generated, and collected continuously. There are two types of streaming data: streaming samples and streaming features. Online learning from streaming data faces two primary challenges: infinite data length and changing concepts. Much research focuses on concept changes in sample streams, such as concept drift. In contrast, existing methods for streaming feature learning predominantly emphasize feature selection or online classification. However, concept evolution also occurs in feature streams. This paper introduces a novel method for detecting concept evolution in feature streams, termed D-CED-FS. This method comprises an adaptive sliding window, an improved parameter-free clustering algorithm, a density-based concept evolution prediction mechanism, a similarity-based concept evaluation method, and a visualization tool using weighted bipartite graphs. The adaptive sliding window module adjusts the size of detection windows in real time based on concept evolution in adjacent windows. The efficient adaptive clustering module, enhanced through natural neighbor methods, eliminates the need for parameter setting and can automatically generate the optimal concept set for each feature window to accommodate feature streams. The concept evolution prediction module reduces repeated clustering for each window, significantly enhancing the algorithm's detection efficiency. The visualization tool, employing a weighted bipartite graph, intuitively illustrates various types of detected concept evolution. Extensive experiments on synthetic and high-dimensional datasets demonstrate the effectiveness of the clustering algorithm and D-CED-FS's capability to detect concept evolution in feature streams.