Spectral-Based Graph Neural Networks for Complementary Item Recommendation

Authors

  • Haitong Luo Institute of Computing Technology, Chinese Academy of Sciences University of Chinese Academy of Sciences
  • Xuying Meng Institute of Computing Technology, Chinese Academy of Sciences Purple Mountain Laboratories
  • Suhang Wang Pennsylvania State University
  • Hanyun Cao Institute of Computing Technology, Chinese Academy of Sciences University of Chinese Academy of Sciences
  • Weiyao Zhang Institute of Computing Technology, Chinese Academy of Sciences
  • Yequan Wang BAAI
  • Yujun Zhang Institute of Computing Technology, Chinese Academy of Sciences University of Chinese Academy of Sciences Nanjing Institute of InforSuperBahn

DOI:

https://doi.org/10.1609/aaai.v38i8.28734

Keywords:

DMKM: Recommender Systems, DMKM: Graph Mining, Social Network Analysis & Community

Abstract

Modeling complementary relationships greatly helps recommender systems to accurately and promptly recommend the subsequent items when one item is purchased. Unlike traditional similar relationships, items with complementary relationships may be purchased successively (such as iPhone and Airpods Pro), and they not only share relevance but also exhibit dissimilarity. Since the two attributes are opposites, modeling complementary relationships is challenging. Previous attempts to exploit these relationships have either ignored or oversimplified the dissimilarity attribute, resulting in ineffective modeling and an inability to balance the two attributes. Since Graph Neural Networks (GNNs) can capture the relevance and dissimilarity between nodes in the spectral domain, we can leverage spectral-based GNNs to effectively understand and model complementary relationships. In this study, we present a novel approach called Spectral-based Complementary Graph Neural Networks (SComGNN) that utilizes the spectral properties of complementary item graphs. We make the first observation that complementary relationships consist of low-frequency and mid-frequency components, corresponding to the relevance and dissimilarity attributes, respectively. Based on this spectral observation, we design spectral graph convolutional networks with low-pass and mid-pass filters to capture the low-frequency and mid-frequency components. Additionally, we propose a two-stage attention mechanism to adaptively integrate and balance the two attributes. Experimental results on four e-commerce datasets demonstrate the effectiveness of our model, with SComGNN significantly outperforming existing baseline models.

Published

2024-03-24

How to Cite

Luo, H., Meng, X., Wang, S., Cao, H., Zhang, W., Wang, Y., & Zhang, Y. (2024). Spectral-Based Graph Neural Networks for Complementary Item Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence, 38(8), 8868-8876. https://doi.org/10.1609/aaai.v38i8.28734

Issue

Section

AAAI Technical Track on Data Mining & Knowledge Management