A study on a recommendation algorithm based on spectral clustering and GRU

Abstract

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.