Liu Qingyuan, Yu Ming, Bai Miaoyuan
College of Computer and Control Engineering, Northeast Forestry University, Harbin, Heilongjiang Province, China.
iScience. 2023 Dec 8;27(2):108660. doi: 10.1016/j.isci.2023.108660. eCollection 2024 Feb 16.
With the development of e-commerce, the importance of recommendation algorithms has significantly increased. However, traditional recommendation systems struggle to address issues such as data sparsity and cold start. This article proposes an optimization method for a recommendation system based on spectral clustering (SC) and gated recurrent unit (GRU), named the GRU-KSC algorithm. Firstly, this paper improves the original spectral clustering algorithm by introducing Kmc2, proposing a novel spectral clustering recommendation algorithm (K-means++ SC, KSC) based on the existing SC algorithm. Secondly, building upon the original GRU model, the paper presents a hybrid recommendation algorithm (Hybrid GRU, HGRU) capable of capturing long-term user interests for a more personalized recommendation. Experiments conducted on real datasets demonstrate that our method outperforms existing benchmark methods in terms of accuracy and robustness.
随着电子商务的发展,推荐算法的重要性显著提高。然而,传统推荐系统难以解决数据稀疏和冷启动等问题。本文提出了一种基于谱聚类(SC)和门控循环单元(GRU)的推荐系统优化方法,即GRU-KSC算法。首先,本文通过引入Kmc2改进了原始谱聚类算法,在现有SC算法的基础上提出了一种新颖的谱聚类推荐算法(K-means++ SC,KSC)。其次,在原始GRU模型的基础上,本文提出了一种能够捕捉用户长期兴趣以实现更个性化推荐的混合推荐算法(Hybrid GRU,HGRU)。在真实数据集上进行的实验表明,我们的方法在准确性和鲁棒性方面优于现有的基准方法。