Sequential Recommendation Method Based on Adaptive Bidirectional Information Flow

NAVIGATE

Table of Contents

STATISTICS

Viewed8

Downloads9

Sequential Recommendation Method Based on Adaptive Bidirectional Information Flow

PDF下载 (9)

[1]MA Li,LIU Wenzhe,LI Yuhao.Sequential Recommendation Method Based on Adaptive Bidirectional Information Flow[J].Journal of Zhengzhou University (Engineering Science),2026,47(4):100-107.[doi:10.13705/j. issn.1671-6833.2026.04.003]

Copy

Journal of Zhengzhou University (Engineering Science)[ISSN 1671-6833/CN 41-1339/T] Volume: 47 Number of periods: 2026 Issue 4 Page number: 100-107 Column: Public date: 2026-07-10

Title:: Sequential Recommendation Method Based on Adaptive Bidirectional Information Flow

Author(s):: MA Li^1,2, LIU Wenzhe¹, LI Yuhao¹; 1. College of Information Engineering, Hebei GEO University, Shijiazhuang 052161, China; 2. Intelligent Sensor Network Engineering Research Center of Hebei Province, Hebei GEO University, Shijiazhuang 052161, China

Keywords:: sequential recommendation; adaptive bidirectional information flow; dynamic preference modeling; fre; quency-domain filtering; attention mechanism

CLC:: TP391. 3TP183F724. 6

DOI:: 10.13705/j. issn.1671-6833.2026.04.003

Abstract:: Abstract: To address the challenges of inefficient information fusion and noise interference in sequential recommendation, a novel method based on an adaptive bidirectional information flow was proposed. Built upon a dual‑path encoder architecture, a hierarchical history summarization module was integrated to distill long‑term user preferences, and dynamic frequency‑domain filtering was introduced to suppress data noise. The approach fully considered the dependency and interactivity between past and future information by employing an adaptive bidirectional information flow mechanism. This mechanism dynamically adjusted fusion weights via uncertainty perception, enabling a precise characterization of the evolution of user preferences. To validate its effectiveness, experiments were conducted on four public datasets including Beauty, Sports, Yelp, and ML1M. And a comparative analysis was performed against 10 mainstream methods. The experimental results demonstrated that the proposed method out‑performed the baseline models in three key metrics: NDCG, HR, and MRR. Compared to three leading baseline models of FMLP‑Rec, DualRec, and Oracle4Rec, the proposed method’s HR@20 reached 0.652 0 and 0.913 3 on the Beauty and Yelp datasets, which was 2.08 percentage points and 2.89 percentage points higher than their average performance, respectively. Furthermore, its NDCG@20 on the Beauty and Yelp datasets reached 0.394 4 and 0.564 5, outperforming the average of the three baselines by 2.67 percentage points and 2.72 percentage points, respectively.

References:: [1] Tang Jiaxi, Wang Ke. Personalized top‑N sequential recommendation via convolutional sequence embedding[C]//Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. New York: ACM, 2018: 565‑573.
[2] Hidasi B, Karatzoglou A, Baltrunas L, et al. Session‑based recommendations with recurrent neural networks [PP/OL]. V4. arXiv (2016‑03‑29) [2025‑12‑01]. https://arxiv.org/abs/1511. 06939.
[3] Kang Wangcheng, McAuley J. Self‑attentive sequential recommendation[C]//Proceedings of the 2018 IEEE International Conference on Data Mining (ICDM). Piscataway: IEEE, 2018: 197‑206.
[4] Sun Fei, Liu Jun, Wu Jian, et al. BERT4Rec: sequential recommendation with bidirectional encoder representations from transformer[C]//Proceedings of the 28th ACM International Conference on Information and Knowledge Management. New York: ACM, 2019: 1441‑1450.
[5] Wu Shu, Wu Shu, Tang Yuyuan, et al. Session‑based recommendation with graph neural networks [C]//Proceedings of the Thirty‑Third AAAI Conference on Artificial Intelligence and Thirty‑First Innovative Applications of Artificial Intelligence Symposium on Educational Advances in Artificial Intelligence. New York: ACM, 2019: 346‑353.
[6] Xu Chengfeng, Zhao Pengpeng, Liu Yanchi, et al. Graph contextualized self‑attention network for session‑based recommendation [ C ]//Proceedings of the Twenty‑Eighth International Joint Conference on Artificial Intelligence. New York: ACM, 2019: 3940‑3946.
[7] Zhou Kun, Yu Hui, Zhao W X, et al. Filter‑enhanced MLP is all you need for sequential recommendation[C]//Proceedings of the ACM Web Conference 2022. New York: ACM, 2022: 2338‑2339.
[8] Yao Zhiyu, Chen Xinyang, Wang Sinan, et al. Recommender transformers with behavior pathways [ C ]//Proceedings of the ACM Web Conference 2024. New York: ACM, 2024: 3643‑3654.
[9] Gao Jingtong, Zhao Xiangyu, Li Muyang, et al. SMLP4Rec: an efficient all‑MLP architecture for sequential recommendations[J]. ACM Transactions on Information Systems, 2024, 42(3): 1‑23.
[10] Liu Langming, Cai Liu, Zhang Chi, et al. LinRec: linear attention mechanism for long‑term sequential recommender systems[C]//Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. New York: ACM, 2023: 289‑299.
[11] Yu Junliang, Xia Xin, Chen Tong, et al. XSimGCL: towards extremely simple graph contrastive learning for recommendation[J]. IEEE Transactions on Knowledge and Data Engineering, 2024, 36(2): 913‑926.
[12] Zhang Hengyu, Yuan Enming, Guo Wei, et al. Disentangling past‑future modeling in sequential recommendation via dual networks[C]//Proceedings of the 31st ACM International Conference on Information & Knowledge Management. New York: ACM, 2022: 2549‑2558.
[13] Xia Jiafeng, Li Dongsheng, Gu Hansu, et al. Oracle‑guided dynamic user preference modeling for sequential recommendation[C]//Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining. New York: ACM, 2025: 363‑372.
[14] Siami‑Namini S, Tavakoli N, Namin A S. The performance of LSTM and BiLSTM in forecasting time series[C]//Proceedings of the 2019 IEEE International Conference on Big Data (Big Data). Piscataway: IEEE, 2019: 3285‑3292.
[15] Wang Wenjie, Feng Fuli, He Xiangnan, et al. Denoising implicit feedback for recommendation[C]//Proceedings of the 14th ACM International Conference on Web Search and Data Mining. New York: ACM, 2021: 373‑381.
[16] Bai Jiawang, Yuan Li, Xia Shutao, et al. Improving vision transformers by revisiting high‑frequency components [C]//Computer Vision—ECCV 2022. Cham: Springer, 2022: 1‑18.
[17] Mikhail M, Ouali M S, Yacout S. A data‑driven methodology with a nonparametric reliability method for optimal condition‑based maintenance strategies [ J ]. Reliability Engineering & System Safety, 2024, 241: 109668.
[18] Xu Ling, Ding Feng, Zhang Xiao, et al. Novel parameter estimation method for the systems with colored noises by using the filtering identification idea[J]. Systems & Control Letters, 2024, 186: 105774.
[19] Kang H, Yang M H, Ryu J. Interactive multi‑head self‑attention with linear complexity [ PP/OL ]. V1. arXiv (2024‑02‑27)[2025‑12‑01]. https://arxiv.org/abs/2402. 17507.
[20] Guo Xudong, Guo Xun, Lu Yan. SSAN: separable self‑attention network for video representation learning[C]//Proceedings of the 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). Piscataway: IEEE, 2021: 12613‑12622.
[21] Zhao Rui, Wang Kui, Xiao Yang, et al. Leveraging Monte Carlo dropout for uncertainty quantification in real‑time object detection of autonomous vehicles[J]. IEEE Access, 2024, 12: 33384‑33399.
[22] Huang Yuanxin, Zhi Xiyang, Hu Jianming, et al. FDD‑BA‑NET: frequency domain decoupling bidirectional interactive attention network for infrared small target detection[J]. IEEE Transactions on Geoscience and Remote Sensing, 2024, 62: 5004416.
[23] Mcauley J. Recommender systems and personalized datasets [DS/OL]. [2025‑12‑01]. https://jmcauley.ucsd.edu/data/amazon/.
[24] Yelp. Yelp open dataset[DS/OL]. [2025‑12‑01]. https://business.yelp.com/data/resources/open‑dataset/.
[25] GroupLens. MovieLens datasets[DS/OL]. [2025‑12‑01]. https://grouplens.org/datasets/movielens/.

Similar References:

Memo

Last Update: 2026-09-22