A two‐phase knowledge distillation model for graph convolutional network‐based recommendation. Issue 9 (12th January 2022)

• Record Type: Journal Article
• Authors: Huang, Zhenhua; Lin, Zuorui; Gong, Zheng; Chen, Yunwen; Tang, Yong
• Is Part Of: International journal of intelligent systems. Volume 37:Issue 9(2022)
• Page Start: 5902
• Page End: 5923
• Publication Date: 2022-01-12
• Subjects: deep learning -- graph convolutional network -- knowledge distillation -- neural network -- recommender system; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligence artificielle -- Périodiques; Systèmes experts (Informatique) -- Périodiques; 006.3
• DOI: 10.1002/int.22819
• Languages: English
• ISSNs: 0884-8173

Abstract

Abstract: Graph convolutional network (GCN)‐based recommendation has recently attracted significant attention in the recommender system community. Although current studies propose various GCNs to improve recommendation performance, existing methods suffer from two main limitations. First, user–item interaction data is generally sparse in practice, highlighting these methods' ineffectiveness in learning user and item feature representations. Second, they usually perform a dot‐product operation to model and calculate user preferences on items, leading to inaccurate user preference learning. To address these limitations, this study adopts a design idea that sharply differs from existing works. Specifically, we introduce the knowledge distillation concept into GCN‐based recommendation and propose a two‐phase knowledge distillation model (TKDM) improving recommendation performance. In Phase I, a self‐distillation method on a graph auto‐encoder learns the user and item feature representations. This auto‐encoder employs a simple two‐layer GCN as an encoder and a fully connected layer as a decoder. On this basis, in Phase II, a mutual‐distillation method on a fully connected layer is introduced to learn user preferences on items with triple‐based Bayesian personalized ranking. Extensive experiments on three real‐world data sets demonstrate that TKDM outperforms classic and state‐of‐the‐art methods related to GCN‐based recommendation problems.