skip to main content
10.1145/3341161.3342876acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Knowledge embedding towards the recommendation with sparse user-item interactions

Published:15 January 2020Publication History

ABSTRACT

Recently, many researchers in recommender systems have realized that encoding user-item interactions based on deep neural networks (DNNs) promotes collaborative-filtering (CF)'s performance. Nonetheless, those DNN-based models' performance is still limited when observed user-item interactions are very less because the training samples distilled from these interactions are critical for deep learning models. To address this problem, we resort to plenty features distilled from knowledge graphs (KGs), to profile users and items precisely and sufficiently rather than observed user-item interactions. In this paper, we propose a knowledge embedding based recommendation framework to alleviate the problem of sparse user-item interactions in recommendation. In our framework, each user and each item are both represented by the combination of an item embedding and a tag embedding at first. Specifically, item embeddings are learned by Metapath2Vec which is a graph embedding model qualified to embedding heterogeneous information networks. Tag embeddings are learned by a Skip-gram model similar to word embedding. We regarded these embeddings as knowledge embeddings because they both indicate knowledge about the latent relationships of movie-movie and user-movie. At last, a target user's representation and a candidate movie's representation are both fed into a multi-layer perceptron to output the probability that the user likes the item. The probability can be further used to achieve top-n recommendation. The extensive experiments on a movie recommendation dataset demonstrate our framework's superiority over some state-of-the-art recommendation models, especially in the scenario of sparse user-movie interactions.

References

  1. T. Hofmann, "Collaborative filtering via gaussian probabilistic latent semantic analysis," in Proc. of SIGIR, 2003.Google ScholarGoogle Scholar
  2. T. HoFann, "Latent semantic models for collaborative filtering," ACM Transactions on Information Systems, vol. 2, pp. 89 -- 115, 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. I. Cantador, A. Bellogin, and D. Vallet, "Content-based recommendation in social tagging systems," in Proc. of Recommender System, 2010.Google ScholarGoogle Scholar
  4. S. Aciar, D. Zhang, S. Simoff, and J. Debenham, "Recommender system based on consumer product reviews," in Proc. of WI, 2006.Google ScholarGoogle Scholar
  5. A. Elkahky, Y. Song, and X. He, "A multi-view deep learning approach for cross domain user modeling in recommendation systems," in Proc. of WWW, 2015.Google ScholarGoogle Scholar
  6. X. He and T. S. Chua, "Neural factorization machines for sparse predictive analytics," in Proc. of SIGIR, 2017.Google ScholarGoogle Scholar
  7. X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T. S. Chua, "Neural collaborative filtering," in Proc. of WWW, 2017.Google ScholarGoogle Scholar
  8. N. T. D, M. R, O. V. C, R. D, and Z. M, "Linked open data to support content-based recommender systems," in Proc. of ICSS, 2012.Google ScholarGoogle Scholar
  9. X. Yu, X. Ren, Y. Sun, Q. Gu, B. Sturt, U. Khandelwal, B. Norick, and J. Han, "Personalized entity recommendation: A heterogeneous information network approach," in Proc. of WSDM, 2014.Google ScholarGoogle Scholar
  10. A. Swami, A. Swami, and A. Swami, "metapath2vec: Scalable representation learning for heterogeneous networks," in Proc. of KDD, 2017.Google ScholarGoogle Scholar
  11. B. Xu, Y. Xu, J. Liang, C. Xie, B. Liang, W. Cui, and Y. Xiao., "Cn-dbpedia: A never-ending chinese knowledge extraction system," in Proc. of ICIEA, 2017.Google ScholarGoogle Scholar
  12. T. Mikolov, K. Chen, G. Corrado, and J. Dean, "Efficient estimation of word representations in vector space," in arXiv:1301.3781, 2013.Google ScholarGoogle Scholar
  13. X. Glorot, A. Bordes, and Y. Bengio, "Deep sparse rectifier neural networks," AISTATS, pp. 315 -- 323, 2011.Google ScholarGoogle Scholar
  14. J. Kingma and J. Ba, "Adam: A method for stochastic optimization," in Proc. of ICLR, 2015.Google ScholarGoogle Scholar
  15. J. H. Friedman, "Stochastic gradient boosting," Computational Statistics & Data Analysis, vol. 38, no. 4, pp. 367 -- 378, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. X. He, Z. He, J. Song, Z. Liu, Y.-G. Jiang, and T.-S. Chua, "Nais: Neural attentive item similarity model for recommendation," IEEE TKDE, 2018.Google ScholarGoogle Scholar
  17. D. Yang, L. Chen, J. Liang, Y. Xiao, and W. Wang, "Social tag embedding for the recommendation with sparse user-item interactions," in Proc. of ASONAM, 2018.Google ScholarGoogle Scholar
  18. S. Rendle, "Factorization machines," in Proc. of ICDM, 2010.Google ScholarGoogle Scholar
  19. F. Zhang, N. J. Yuan, D. Lian, X. Xie, and W. Y. Ma, "Collaborative knowledge base embedding for recommender systems," in Proc. of KDD, 2016.Google ScholarGoogle Scholar
  20. E. Palumbo, G. Rizzo, and R. Troncy, "entity2rec: Learning user-item relatedness from knowledge graphs for top-n item recommendation," in Proc. of RecSys., 2017.Google ScholarGoogle Scholar
  21. A. Grover and J. Leskovec, "node2vec: Scalable feature learning for networks," in Proc. of KDD, 2016.Google ScholarGoogle Scholar
  22. H. Wang, F. Zhang, X. Xie, and M. Guo, "Dkn: Deep knowledge-aware network for news recommendation," 2018.Google ScholarGoogle Scholar
  23. R. Salakhutdinov, A. Mnih, and G. Hinton, "Restricted boltzmann machines for collaborative filtering," in Proc. of ICML, 2007.Google ScholarGoogle Scholar
  24. X. Dong, L. Yu, Zhonghuo Wu, Y. Sun, L. Yuan, and F. Zhang, "A hybrid collaborative filtering model with deep structure for recommender systems," in Proc. of AAAI, 2017.Google ScholarGoogle Scholar
  25. P. Vincent, H. Larochelle, Y. B. I. Lajoie, and P.-A. Manzagol, "Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion," JMLR, vol. 11, pp. 3371 -- 3408, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. A. V. den Oord, S. Dieleman, and B. Schrauwen, "Deep content-based music recommendation," in Proc. of NIPS, 2013.Google ScholarGoogle Scholar
  27. S. Sedhain, A. K. Menon, S. Sanner, and L. Xie, "Autorec: Autoencoders meet collaborative filtering," in Proc. of WWW, 2015.Google ScholarGoogle Scholar
  28. H. J. Xue, X. Y. Dai, J. Zhang, S. Huang, and J. Chen, "Deep matrix factorization models for recommender systems," in Proc. of IJCAI, 2017.Google ScholarGoogle Scholar
  29. W. L. Hamilton, R. Ying, and J. Leskovec, "Representation learning on graphs: Methods and applications," arXiv:1709.05584v2[cs.SI], Sep. 2017.Google ScholarGoogle Scholar
  30. S. Yan, D. Xu, B. Zhang, H.-J. Zhang, Q. Yang, and S. Lin, "Graph embedding and extensions: A general framework for dimensionality reduction," TPAMI, vol. 29, no. 1, 2007.Google ScholarGoogle Scholar
  31. T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, "Distributed representations of words and phrases and their compositionality," in Proc. of NIPS, 2013.Google ScholarGoogle Scholar
  32. T. Y. Fu, W. C. Lee, and Z. Lei, "Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning," in Proc. of CIKM, 2017.Google ScholarGoogle Scholar
  1. Knowledge embedding towards the recommendation with sparse user-item interactions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
        August 2019
        1228 pages
        ISBN:9781450368681
        DOI:10.1145/3341161

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 January 2020

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        ASONAM '19 Paper Acceptance Rate41of286submissions,14%Overall Acceptance Rate116of549submissions,21%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader