Yiji Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yiji Zhao has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Hao Wu
School of Information Science and Engineering, Yunnan University, Kunming, China
13 shared publications - Lei Zhang
School of Electrical and Automation Engineering, Nanjing Normal University, Nanjing, China
9 shared publications - Huaiyu Wan
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China and Beijing Key Laboratory of Traffic Data Mining and Embodied Intelligence, Beijing, China
6 shared publications - Haomin Wen
Shanghai Innovation Institute, Shanghai, China
4 shared publications - Haomin Wen
Carnegie Mellon University
3 shared publications - Ming Jin
Griffith University
3 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (8) , 1-33
FAESRec: Frequency Adaptive Encoder for Sequential Recommendation
Sequential recommender systems predominantly focus on time-domain modeling, overlooking rich seasonal and periodic structures revealed in the frequency domain. While recent frequency-aware methods leverage Fourier transforms, their reliance on fixed filters introduces two critical limitations: (i) inadequate sequence encoding due to indiscriminate spectral suppression, causing information degradation, and (ii) semantic-degrading contrastive augmentations that compromise critical frequency components essential for behavioral semantics. To address these challenges, we propose FAESRec, a Frequency Adaptive Encoder with three synergistic innovations: First, a Frequency Adaptive Mixture-of-Experts (FAMoE) layer decomposes sequences into non-overlapping spectral bands with end-to-end learned boundaries, enabling dynamic weighting of heterogeneous frequency drivers. Second, a Filter-Enhanced module (FAFe) employs learnable global/local filters with adaptive thresholds to denoise spectral components while preserving energy-concentrated bands. The filtered spectral features are projected back to the time domain and encoded by a Mamba block. Third, a Frequency Semantic-aware Contrastive Learner (FSaCL) synthesizes semantically coherent views through probabilistic frequency masking, theoretically guaranteeing mutual information conservation between original and augmented sequences. Extensive experiments on six benchmarks from Amazon, Movielens, and LastFM demonstrate FAESRec’s consistent superiority over 13 SOTA baselines. It achieves significant improvements of 2.74–67.69% HR@1 and 3.95–20.38% NDCG@5, particularly under extreme sparsity. Theoretical analysis proves that FSaCL preserves minimal sufficient semantics, establishing a new paradigm for frequency-aware sequential recommendation. Code is available at: https://github.com/0-1user/FAESRec .
- 13 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (8) , 1-33
Open AccessFAESRec: Frequency Adaptive Encoder for Sequential Recommendation
Sequential recommender systems predominantly focus on time-domain modeling, overlooking rich seasonal and periodic structures revealed in the frequency domain. While recent frequency-aware methods leverage Fourier transforms, their reliance on fixed filters introduces two critical limitations: (i) inadequate sequence encoding due to indiscriminate spectral suppression, causing information degradation, and (ii) semantic-degrading contrastive augmentations that compromise critical frequency components essential for behavioral semantics. To address these challenges, we propose FAESRec, a Frequency Adaptive Encoder with three synergistic innovations: First, a Frequency Adaptive Mixture-of-Experts (FAMoE) layer decomposes sequences into non-overlapping spectral bands with end-to-end learned boundaries, enabling dynamic weighting of heterogeneous frequency drivers. Second, a Filter-Enhanced module (FAFe) employs learnable global/local filters with adaptive thresholds to denoise spectral components while preserving energy-concentrated bands. The filtered spectral features are projected back to the time domain and encoded by a Mamba block. Third, a Frequency Semantic-aware Contrastive Learner (FSaCL) synthesizes semantically coherent views through probabilistic frequency masking, theoretically guaranteeing mutual information conservation between original and augmented sequences. Extensive experiments on six benchmarks from Amazon, Movielens, and LastFM demonstrate FAESRec’s consistent superiority over 13 SOTA baselines. It achieves significant improvements of 2.74–67.69% HR@1 and 3.95–20.38% NDCG@5, particularly under extreme sparsity. Theoretical analysis proves that FSaCL preserves minimal sufficient semantics, establishing a new paradigm for frequency-aware sequential recommendation. Code is available at: https://github.com/0-1user/FAESRec .
- 27 May 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 124
Deep Autoencoder Augmented with Memory and Prediction for heartbeat anomaly detection
- 27 May 2026
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 124
Deep Autoencoder Augmented with Memory and Prediction for heartbeat anomaly detection
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1975-1986
FaST: Efficient and Effective Long-Horizon Forecasting for Large-Scale Spatial-Temporal Graphs via Mixture-of-Experts
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1975-1986
Open AccessFaST: Efficient and Effective Long-Horizon Forecasting for Large-Scale Spatial-Temporal Graphs via Mixture-of-Experts
- Open Access
FaST: Efficient and Effective Long-Horizon Forecasting for Large-Scale Spatial-Temporal Graphs via Mixture-of-Experts
Spatial-Temporal Graph (STG) forecasting on large-scale networks has garnered significant attention. However, existing models predominantly focus on short-horizon predictions and suffer from notorious computational costs and memory consumption when scaling to long-horizon predictions and large graphs. Targeting the above challenges, we present FaST, an effective and efficient framework based on heterogeneity-aware Mixture-of-Experts (MoEs) for long-horizon and large-scale STG forecasting, which unlocks one-week-ahead (672 steps at a 15-minute granularity) prediction with thousands of nodes. FaST is underpinned by two key innovations. First, an adaptive graph agent attention mechanism is proposed to alleviate the computational burden inherent in conventional graph convolution and self-attention modules when applied to large-scale graphs. Second, we propose a new parallel MoE module that replaces traditional feed-forward networks with Gated Linear Units (GLUs), enabling an efficient and scalable parallel structure. Extensive experiments on real-world datasets demonstrate that FaST not only delivers superior long-horizon predictive accuracy but also achieves remarkable computational efficiency compared to state-of-the-art baselines. Our source code is available at: https://github.com/yijizhao/FaST.
Open AccessFaST: Efficient and Effective Long-Horizon Forecasting for Large-Scale Spatial-Temporal Graphs via Mixture-of-Experts
Spatial-Temporal Graph (STG) forecasting on large-scale networks has garnered significant attention. However, existing models predominantly focus on short-horizon predictions and suffer from notorious computational costs and memory consumption when scaling to long-horizon predictions and large graphs. Targeting the above challenges, we present FaST, an effective and efficient framework based on heterogeneity-aware Mixture-of-Experts (MoEs) for long-horizon and large-scale STG forecasting, which unlocks one-week-ahead (672 steps at a 15-minute granularity) prediction with thousands of nodes. FaST is underpinned by two key innovations. First, an adaptive graph agent attention mechanism is proposed to alleviate the computational burden inherent in conventional graph convolution and self-attention modules when applied to large-scale graphs. Second, we propose a new parallel MoE module that replaces traditional feed-forward networks with Gated Linear Units (GLUs), enabling an efficient and scalable parallel structure. Extensive experiments on real-world datasets demonstrate that FaST not only delivers superior long-horizon predictive accuracy but also achieves remarkable computational efficiency compared to state-of-the-art baselines. Our source code is available at: https://github.com/yijizhao/FaST.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (4) , 1-14
STF: Steady and Transient Factorization for Sparse Time-Aware QoS Prediction
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (4) , 1-14
STF: Steady and Transient Factorization for Sparse Time-Aware QoS Prediction
- 19 November 2025
- Published by Elsevier in Information Processing & Management
- Vol. 63 (2)
TASeqRec: Learning users’ topical interests for sequential recommendation
- 19 November 2025
- Published by Elsevier in Information Processing & Management
- Vol. 63 (2)
TASeqRec: Learning users’ topical interests for sequential recommendation
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 5208-5216
T2S: High-resolution Time Series Generation with Text-to-Series Diffusion Models
Text-to-Time Series generation holds significant potential to address challenges such as data sparsity, imbalance, and limited availability of multimodal time series data across domains. While diffusion models have achieved remarkable success in Text-to-X (e.g., vision and audio data) generation, their use in time series generation remains limit. Existing approaches face two critical limitations: (1) reliance on domain-specific captions that generalize poorly, and (2) inability to generate time series of arbitrary length, limiting real-world use. In this work, we first introduce a new multimodal dataset containing over 600,000 high-resolution text-time series pairs. Second, we propose Text-to-Series (T2S), a diffusion-based framework that bridges the gap between natural language and time series in a domain-agnostic manner. It employs a length-adaptive VAE to encode time series of varying lengths into consistent latent embeddings. On top of that, T2S effectively aligns textual representations with latent embeddings by utilizing Flow Matching and employing DiT as the denoiser. We train T2S in an interleaved paradigm across multiple lengths, allowing it to generate sequences of arbitrary lengths. Extensive evaluations demonstrate that T2S achieves state-of-the-art performance across 13 datasets spanning 12 domains.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 5208-5216
Open AccessT2S: High-resolution Time Series Generation with Text-to-Series Diffusion Models
Text-to-Time Series generation holds significant potential to address challenges such as data sparsity, imbalance, and limited availability of multimodal time series data across domains. While diffusion models have achieved remarkable success in Text-to-X (e.g., vision and audio data) generation, their use in time series generation remains limit. Existing approaches face two critical limitations: (1) reliance on domain-specific captions that generalize poorly, and (2) inability to generate time series of arbitrary length, limiting real-world use. In this work, we first introduce a new multimodal dataset containing over 600,000 high-resolution text-time series pairs. Second, we propose Text-to-Series (T2S), a diffusion-based framework that bridges the gap between natural language and time series in a domain-agnostic manner. It employs a length-adaptive VAE to encode time series of varying lengths into consistent latent embeddings. On top of that, T2S effectively aligns textual representations with latent embeddings by utilizing Flow Matching and employing DiT as the denoiser. We train T2S in an interleaved paradigm across multiple lengths, allowing it to generate sequences of arbitrary lengths. Extensive evaluations demonstrate that T2S achieves state-of-the-art performance across 13 datasets spanning 12 domains.
- Open Access
T2S: High-resolution Time Series Generation with Text-to-Series Diffusion Models
Text-to-Time Series generation holds significant potential to address challenges such as data sparsity, imbalance, and limited availability of multimodal time series datasets across domains. While diffusion models have achieved remarkable success in Text-to-X (e.g., vision and audio data) generation, their use in time series generation remains in its nascent stages. Existing approaches face two critical limitations: (1) the lack of systematic exploration of general-proposed time series captions, which are often domain-specific and struggle with generalization; and (2) the inability to generate time series of arbitrary lengths, limiting their applicability to real-world scenarios. In this work, we first categorize time series captions into three levels: point-level, fragment-level, and instance-level. Additionally, we introduce a new fragment-level dataset containing over 600,000 high-resolution time series-text pairs. Second, we propose Text-to-Series (T2S), a diffusion-based framework that bridges the gap between natural language and time series in a domain-agnostic manner. T2S employs a length-adaptive variational autoencoder to encode time series of varying lengths into consistent latent embeddings. On top of that, T2S effectively aligns textual representations with latent embeddings by utilizing Flow Matching and employing Diffusion Transformer as the denoiser. We train T2S in an interleaved paradigm across multiple lengths, allowing it to generate sequences of any desired length. Extensive evaluations demonstrate that T2S achieves state-of-the-art performance across 13 datasets spanning 12 domains.
Open AccessT2S: High-resolution Time Series Generation with Text-to-Series Diffusion Models
Text-to-Time Series generation holds significant potential to address challenges such as data sparsity, imbalance, and limited availability of multimodal time series datasets across domains. While diffusion models have achieved remarkable success in Text-to-X (e.g., vision and audio data) generation, their use in time series generation remains in its nascent stages. Existing approaches face two critical limitations: (1) the lack of systematic exploration of general-proposed time series captions, which are often domain-specific and struggle with generalization; and (2) the inability to generate time series of arbitrary lengths, limiting their applicability to real-world scenarios. In this work, we first categorize time series captions into three levels: point-level, fragment-level, and instance-level. Additionally, we introduce a new fragment-level dataset containing over 600,000 high-resolution time series-text pairs. Second, we propose Text-to-Series (T2S), a diffusion-based framework that bridges the gap between natural language and time series in a domain-agnostic manner. T2S employs a length-adaptive variational autoencoder to encode time series of varying lengths into consistent latent embeddings. On top of that, T2S effectively aligns textual representations with latent embeddings by utilizing Flow Matching and employing Diffusion Transformer as the denoiser. We train T2S in an interleaved paradigm across multiple lengths, allowing it to generate sequences of any desired length. Extensive evaluations demonstrate that T2S achieves state-of-the-art performance across 13 datasets spanning 12 domains.
- 3 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (7) , 5360-5370
Harnessing the Power of Large Language Model for Effective Web API Recommendation
Various Web API Recommendation (AR) techniques have assisted developers in efficiently identifying suitable APIs for mashup creation. With the emergence of large language models (LLMs), there has been increasing interest in leveraging LLMs for recommender systems. Although several approaches have attempted to utilize LLMs by framing recommendations as prompts, this approach is not ideally suited for AR due to fundamental differences in the training processes of LLMs and AR models. Consequently, it's crucial to conduct further research to identify effective applications of LLMs in AR. To this end, we propose a novel LLM-based generative solution for API Recommendation (LLMAR) that combines instruction learning of multitask and multistage Low-Rank Adaptation fine-tuning based on LLaMA models. Experimental results on the ProgrammableWeb dataset show that LLMAR significantly outperforms representative methods in regular and data-limited scenarios.
- 3 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (7) , 5360-5370
Harnessing the Power of Large Language Model for Effective Web API Recommendation
Various Web API Recommendation (AR) techniques have assisted developers in efficiently identifying suitable APIs for mashup creation. With the emergence of large language models (LLMs), there has been increasing interest in leveraging LLMs for recommender systems. Although several approaches have attempted to utilize LLMs by framing recommendations as prompts, this approach is not ideally suited for AR due to fundamental differences in the training processes of LLMs and AR models. Consequently, it's crucial to conduct further research to identify effective applications of LLMs in AR. To this end, we propose a novel LLM-based generative solution for API Recommendation (LLMAR) that combines instruction learning of multitask and multistage Low-Rank Adaptation fine-tuning based on LLaMA models. Experimental results on the ProgrammableWeb dataset show that LLMAR significantly outperforms representative methods in regular and data-limited scenarios.
- 11 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 3513-3526
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction
Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.
- 11 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 3513-3526
Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction
Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.