Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Recommendation on Heterogeneous Information Network with Type-Sensitive Sampling

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12114))

Included in the following conference series:

  • 2419 Accesses

Abstract

Most entities and relations for recommendation tasks in the real world are of multiple types, large-scale, and power-law. The heterogeneous information network (HIN) based approaches are widely used in recommendations to model the heterogeneous data. However, most HIN based approaches learn the latent representation of entities through meta-path, which is predefined by prior knowledge and thus limits the combinatorial generalization of HIN. Graph neural networks (GNNs) collect and generalize the information of nodes on the receptive field, but most works focus on homogeneous graphs and fail to scale up with regard to power-law graphs. In this paper, we propose a HIN based framework for recommendation tasks, where we utilize GNNs with a type-sensitive sampling to handle the heterogeneous and power-law graphs. For each layer, we adopt schema-based attention to output the distribution of sampling over types, and then we use the importance sampling inside each type to output the sampled neighbors. We conduct extensive experiments on four public datasets and one private dataset, and all datasets are selected carefully for covering the different scales of the graph. In particular, on the largest heterogeneous graph with 0.4 billion edges, we improve the square error by 2.5% while yielding a 26% improvement of convergence time during training, which verifies the effectiveness and scalability of our method regarding the industrial recommendation tasks .

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

Notes

  1. 1.

    We omit the edge aggregation for convenience, while the conclusions in this paper can be generalized to the standard GNNs.

  2. 2.

    https://github.com/librahu/HIN-Datasets-for-Recommendation-and-Network-Embedding.

  3. 3.

    https://www.yelp.com/dataset.

  4. 4.

    https://www.taobao.com.

  5. 5.

    https://github.com/librahu/HERec.

  6. 6.

    https://github.com/zyz282994112/GraphInception.

  7. 7.

    https://github.com/Jhy1993/HAN.

References

  1. Bai, J., Zhou, C., et al.: Personalized bundle list recommendation. In: Proceedings of the 2019 WWW (2019)

    Google Scholar 

  2. Battaglia, P.W., Hamrick, J.B., et al.: Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261 (2018)

  3. Chen, J., Ma, T., Xiao, C.: Fastgcn: fast learning with graph convolutional networks via importance sampling. In: International Conference on Learning Representations (ICLR) (2018)

    Google Scholar 

  4. Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 1263–1272. JMLR. org (2017)

    Google Scholar 

  5. Greathouse, J.L., Daga, M.: Efficient sparse matrix-vector multiplication on GPUs using the CSR storage format. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 769–780. IEEE Press (2014)

    Google Scholar 

  6. Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in NIPS, pp. 1024–1034 (2017)

    Google Scholar 

  7. Huang, W., Zhang, T., Rong, Y., Huang, J.: Adaptive sampling towards fast graph representation learning. In: Advances in NIPS, pp. 4563–4572 (2018)

    Google Scholar 

  8. Jiang, H., Song, Y., Wang, C., Zhang, M., Sun, Y.: Semi-supervised learning over heterogeneous information networks by ensemble of meta-graph guided random walks. In: IJCAI, pp. 1944–1950 (2017)

    Google Scholar 

  9. Li, Z., Zhenpeng, L., et al.: Addgraph: anomaly detection in dynamic graph using attention-based temporal GCN. In: IJCAI (2018)

    Google Scholar 

  10. Ma, H., Zhou, D., Liu, C., Lyu, M.R., King, I.: Recommender systems with social regularization. In: Proceedings of WSDM, pp. 287–296. ACM (2011)

    Google Scholar 

  11. Mnih, A., Salakhutdinov, R.R.: Probabilistic matrix factorization. In: Advances in NIPS, pp. 1257–1264 (2008)

    Google Scholar 

  12. Shi, C., Hu, B., Zhao, W.X., Philip, S.Y.: Heterogeneous information network embedding for recommendation. IEEE Trans. Knowl. Data Eng. 31(2), 357–370 (2019)

    Article  Google Scholar 

  13. Sun, Y., Han, J.: Mining heterogeneous information networks: a structural analysis approach. ACM SIGKDD Explor. Newsl. 14(2), 20–28 (2013)

    Article  Google Scholar 

  14. Walker, A.J.: New fast method for generating discrete random numbers with arbitrary frequency distributions. Electron. Lett. 10(8), 127–128 (1974)

    Article  Google Scholar 

  15. Wang, J., et al.: Billion-scale commodity embedding for e-commerce recommendation in Alibaba. In: Proceedings of the 24th ACM SIGKDD. ACM (2018)

    Google Scholar 

  16. Wang, X., Ji, H., et al.: Heterogeneous graph attention network. In: The World Wide Web Conference, pp. 2022–2032 (2019)

    Google Scholar 

  17. Zhang, Y., Xiong, Y., et al.: Deep collective classification in heterogeneous information networks. In: Proceedings of the 2018 WWW (2018)

    Google Scholar 

  18. Zhao, H., et al.: Meta-graph based recommendation fusion over heterogeneous information networks. In: Proceedings of the 23rd ACM SIGKDD. ACM (2017)

    Google Scholar 

  19. Zheng, J., Liu, J., Shi, C., Zhuang, F., Li, J., Wu, B.: Recommendation in heterogeneous information network via dual similarity regularization. Int. J. Data Sci. Anal. 3(1), 35–48 (2016). https://doi.org/10.1007/s41060-016-0031-0

    Article  Google Scholar 

  20. Zhou, C., Bai, J., et al.: Atrank: an attention-based user behavior modeling framework for recommendation. In: AAAI (2018)

    Google Scholar 

  21. Zhou, J., Cui, G., Zhang, Z., Yang, C., Liu, Z., Sun, M.: Graph neural networks: a review of methods and applications. arXiv preprint arXiv:1812.08434 (2018)

Download references

Acknowledgement

This work was partially supported by the National Key Research and Development Plan of China (No. 2019YFB2102100), NSFC under Grant No. 61832001, Alibaba-PKU Joint Program, and Zhejiang Lab (No. 2019KB0AB06).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Zhao Li or Jun Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bai, J. et al. (2020). Recommendation on Heterogeneous Information Network with Type-Sensitive Sampling. In: Nah, Y., Cui, B., Lee, SW., Yu, J.X., Moon, YS., Whang, S.E. (eds) Database Systems for Advanced Applications. DASFAA 2020. Lecture Notes in Computer Science(), vol 12114. Springer, Cham. https://doi.org/10.1007/978-3-030-59419-0_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59419-0_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59418-3

  • Online ISBN: 978-3-030-59419-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics