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

Enshuo Yan

dblp:391/5214 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0006-5843-4890ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Artificial intelligence
1 paper
Time series and sequential data · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Time series and sequential data › time series analysis
time series classification
0.912025
Temporal Streaming Batch Principal Component Analysis for Time Series Classification (Student Abstract) · AAAI 2025
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.912025
Temporal Streaming Batch Principal Component Analysis for Time Series Classification (Student Abstract) · AAAI 2025
Algorithms and data structures › numerical linear algebra › dimensionality reduction
principal component analysis
0.912025
Temporal Streaming Batch Principal Component Analysis for Time Series Classification (Student Abstract) · AAAI 2025

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

temporal compression · 1.7streaming PCA · 1.7
YearPublicationVenuePosition
2025 Temporal Streaming Batch Principal Component Analysis for Time Series Classification (Student Abstract)
abstract
In multivariate time series classification, although current sequence analysis models have excellent classification capabilities, they show significant shortcomings when dealing with long sequence multivariate data. This paper focuses on optimizing model performance for long-sequence multivariate data by mitigating the impact of extended time series and multiple variables on the model. We propose a principal component analysis (PCA)-based temporal streaming compression and dimensionality reduction algorithm for time series data (temporal streaming batch PCA, TSBPCA), which continuously updates the compact representation of the entire sequence through streaming PCA time estimation with time block updates, enhancing the data representation capability of a range of sequence analysis models.We evaluated this method using various models on five datasets, and the experimental results show that our method demonstrates outstanding performance in both classification accuracy and time efficiency.
Enshuo Yan, Huachuan Wang, Weihao Xia 0002
AAAI1
2025 Reshaping Cross-Entropy Non-Convex Properties through Normalized Risk-Averse Loss
abstract
Non-convex optimization poses significant challenges in training deep neural networks, often leading to suboptimal solutions by converging to local rather than global minima. To address this, we propose the Normalized Risk-Averse Cross-Entropy (NRACE) loss function, specifically designed to improve generalization and convergence behavior. NRACE extends the Cross-Entropy loss by introducing a normalized risk-averse term, enhancing the model’s robustness against suboptimal solutions. This term encourages the model to prioritize regions of the parameter space associated with lower risk, thereby guiding optimization toward improved approximations of global optima. Our theoretical analysis demonstrates that NRACE’s convexity region expands monotonically with its risk sensitivity index, providing stronger optimization guarantees than traditional loss functions. Empirical experiments across various benchmark datasets and neural network architectures validate NRACE’s effectiveness. Comparative analysis with the traditional Cross-Entropy loss demonstrates that NRACE improves generalization performance and accelerates convergence, leading to higher-quality solutions.
Weihao Xia 0002, Huachuan Wang, Enshuo Yan, James Lo
IJCNN4