Skip to main content
placeholder image

Pairwise-Based Hierarchical Gating Networks for Sequential Recommendation

Journal Article


Download full-text (Open Access)

Abstract


  • The sequential pattern behind users’ behaviors indicates the importance of exploring the transition relationships among adjacent items in next-item recommendation task. Most existing methods based on Markov Chains or deep learning architecture have demonstrated their superiority in sequential recommendation scenario, but they have not been well-studied at a range of problems: First, the influence strength of items that the user just access might be different since not all items are equally important for modeling user’s preferences. Second, the user might assign various interests to certain parts of items, as what often attracts users is a specific feature or aspect of an item. Third, many methods ignore the complex item relations in user’s previous actions. In this paper, we present a novel recommendation approach with gating mechanism and encoding module to address above problems. Specifically, the pair-wise encoding layer is first introduced to build 3-way tensor for modeling the relationships among items in user interact histories. We also apply two gating layers to filter useful information and capture user’s short-term preference from aspect-level and item-level. We also follow the similar sprits to model user’s long-term preference by integrating user latent embeddings. Empirical results on three public datasets show that our method achieves effective improvements over the state-of-the-art sequence-based models.

UOW Authors


  •   Huang, Kexin (external author)
  •   Du, Ye (external author)
  •   Li, Li (external author)
  •   Shen, Jun
  •   Sun, Geng (external author)

Publication Date


  • 2020

Citation


  • Huang, K., Du, Y., Li, L., Shen, J. & Sun, G. (2020). Pairwise-Based Hierarchical Gating Networks for Sequential Recommendation. Lecture Notes in Computer Science, 12275 64-75.

Scopus Eid


  • 2-s2.0-85090096782

Ro Full-text Url


  • https://ro.uow.edu.au/cgi/viewcontent.cgi?article=5365&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/4336

Number Of Pages


  • 11

Start Page


  • 64

End Page


  • 75

Volume


  • 12275

Place Of Publication


  • Germany

Abstract


  • The sequential pattern behind users’ behaviors indicates the importance of exploring the transition relationships among adjacent items in next-item recommendation task. Most existing methods based on Markov Chains or deep learning architecture have demonstrated their superiority in sequential recommendation scenario, but they have not been well-studied at a range of problems: First, the influence strength of items that the user just access might be different since not all items are equally important for modeling user’s preferences. Second, the user might assign various interests to certain parts of items, as what often attracts users is a specific feature or aspect of an item. Third, many methods ignore the complex item relations in user’s previous actions. In this paper, we present a novel recommendation approach with gating mechanism and encoding module to address above problems. Specifically, the pair-wise encoding layer is first introduced to build 3-way tensor for modeling the relationships among items in user interact histories. We also apply two gating layers to filter useful information and capture user’s short-term preference from aspect-level and item-level. We also follow the similar sprits to model user’s long-term preference by integrating user latent embeddings. Empirical results on three public datasets show that our method achieves effective improvements over the state-of-the-art sequence-based models.

UOW Authors


  •   Huang, Kexin (external author)
  •   Du, Ye (external author)
  •   Li, Li (external author)
  •   Shen, Jun
  •   Sun, Geng (external author)

Publication Date


  • 2020

Citation


  • Huang, K., Du, Y., Li, L., Shen, J. & Sun, G. (2020). Pairwise-Based Hierarchical Gating Networks for Sequential Recommendation. Lecture Notes in Computer Science, 12275 64-75.

Scopus Eid


  • 2-s2.0-85090096782

Ro Full-text Url


  • https://ro.uow.edu.au/cgi/viewcontent.cgi?article=5365&context=eispapers1

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/4336

Number Of Pages


  • 11

Start Page


  • 64

End Page


  • 75

Volume


  • 12275

Place Of Publication


  • Germany