Skip to main content

Multi-intent Compatible Transformer Network for Recommendation

  • Conference paper
  • First Online:
Pattern Recognition and Computer Vision (PRCV 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13534))

Included in the following conference series:

  • 3109 Accesses

Abstract

The core of recommendation systems is to explore users’ preferences from users’ historical records and accordingly recommend items to meet users’ interests. Previous works explore interaction graph to capture multi-order collaborative signals and derive high-quality representations of users and items, which effectively alleviates the interaction sparsity issue. Recent works extend the scope with a fine-grained perspective and achieve a great success in modeling users’ diverse intents. Although these works distinguish intents, they ignore the hidden correlation among users’ intents resulting in suboptimal recommendation performance. We argue that a user’s interest is made up of multiple intents and these intents are compatible on the interest composition of the user. To this point, we propose multi-intent compatible transformer network (MCTN) to explore the correlation between intents on modeling users’ interests for recommendation. Users and items are embedded into multiple intent spaces through disentangled graph convolution network to disentangle users’ intents. MCTN conducts embedding propagation in each intent space to capture the multi-order collaborative signals on the specific intent. We introduce a transformer network to capture the dependence between intents and derive multi-intent compatible embeddings of users and items for recommendation. The experiments achieves state-of-the-art performance, which demonstrates the effectiveness of the proposed MCTN on modeling multi-intent compatibility into embeddings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. He, X., Liao, L., Zhang, H., Nie, L., Hu, X., Chua, T.: Neural collaborative filtering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 173–182 (2017)

    Google Scholar 

  2. He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., Wang, M.: Lightgcn: simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 639–648 (2020)

    Google Scholar 

  3. Wang, X., He, X., Wang, M., Feng, F., Chua, T.: Neural graph collaborative filtering. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 165–174 (2019)

    Google Scholar 

  4. Wang, X., Jin, H., Zhang, A., He, X., Xu, T., Chua, T.: Disentangled graph collaborative filtering. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1001–1010 (2020)

    Google Scholar 

  5. Koren, Y., Bell, R.M., Volinsky, C.: Matrix factorization techniques for recommender systems. IEEE Comput. 42(8), 30–37 (2009)

    Article  Google Scholar 

  6. Berg, R.V.D., Kipf, T.N., Welling, M.: Graph convolutional matrix completion. In: KDD (2017)

    Google Scholar 

  7. Zheng, Y., Gao, C., Li, X., He, X., Jin, D., Li, Y.: Disentangling user interest and conformity for recommendation with casual embedding. In Proceedings of the 30th International Conference on World Wide Web, pp. 2980–2991 (2021)

    Google Scholar 

  8. Cen, Y., Zhang, J., Zou, X., Zhou, C., Yang, H., Tang, J.: Controllable multi-interest framework for recommendation. In: KDD (2020)

    Google Scholar 

  9. Wang, Y., Tang, S., Lei, Y., Song, W., Wang, S., Zhang, M.: DisenHAN: disentangled heterogeneous graph attention network for recommendation. In: ACM International Conference on Information and Knowledge Management, pp. 1606–1614 (2020)

    Google Scholar 

  10. Ma, J., Cui, P., Kuang, K., Wang, X., Zhu, W.: Disentangled graph convolutional networks. In: International Conference on Machine Learning, pp. 4212–4221 (2019)

    Google Scholar 

  11. Ma, J., Zhou, C., Cui, P., Yang, H., Zhu, W.: Learning disentangled representation for recommendation. In: 33rd Conference on Neural Information Processing Systems (2019)

    Google Scholar 

  12. Yang, R., Jian, M., Shi, G., Wu, L., Xiang, Y.: Attribute-Level interest matching network for personalized recommendation. In: Chinese Conference on Pattern Recognition and Computer Vision, pp. 486–497 (2021)

    Google Scholar 

  13. Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735–1780 (1997)

    Article  Google Scholar 

  14. Vaswani, A., et al.: Attention is all you need. In: 31st Conference on Neural Information Processing Systems, pp. 5998–6008 (2017)

    Google Scholar 

  15. He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: International Conference on Computer Vision and Pattern Recognition, pp. 770–778 (2016)

    Google Scholar 

  16. Dosovitskiy, A., et al.: An image is worth 16\(\times \)16 words: transformers for image recognition at scale. arXiv preprint arXiv:2010.11929 (2010)

  17. Kabbur, S., Ning, X., Karypis, G.: Fism: factored item similarity models for top-n recommender systems. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 659–667(2013)

    Google Scholar 

  18. Li, H., Wang, X., Zhang, Z., Yuan, Z., Li, H., Zhu, W.: Disentangled contrastive learning on graphs. In: 35th Conference on Neural Information Processing Systems (2021)

    Google Scholar 

  19. Yang, Y., Feng, Z., Song, M., Wang, X.: Factorized graph convolutional networks. arXiv preprint arXiv:2010.05421 (2010)

  20. Zhu, T., Sun L., Chen, G.: Embedding disentanglement in graph convolutional networks for recommendation. IEEE Trans. Knowl. Data Eng. 99, 1 (2021)

    Google Scholar 

  21. Liang, D., Krishnan, R.G., Hoffman, M.D., Jebara, T.: Variantional autoencoders for collaborative filtering. In: Proceedings of the 2018 World Wide Conference, pp. 689–698 (2018)

    Google Scholar 

  22. Wang, X., He, X., Cao, Y., Liu, M., Chua, S.: KGAT: knowledge graph attention network for recommendation. In: ACM SIGIR, pp. 950–958 (2019)

    Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China under Grant NO. 62176011, NO. 61976010, and NO. 62106010, Inner Mongolia Autonomous Region Science and Technology Foundation under Grant NO. 2021GG0333, and Beijing Postdoctoral Research Foundation under Grant NO. Q6042001202101.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lifang Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, T., Jian, M., Shi, G., Fu, X., Wu, L. (2022). Multi-intent Compatible Transformer Network for Recommendation. In: Yu, S., et al. Pattern Recognition and Computer Vision. PRCV 2022. Lecture Notes in Computer Science, vol 13534. Springer, Cham. https://doi.org/10.1007/978-3-031-18907-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18907-4_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18906-7

  • Online ISBN: 978-3-031-18907-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy