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

Weighted Meta-Path Embedding Learning for Heterogeneous Information Networks

  • Conference paper
  • First Online:
Web Information Systems Engineering – WISE 2020 (WISE 2020)

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

Included in the following conference series:

  • 1499 Accesses

Abstract

A low-dimensional embedding can be easily applied in the downstream tasks for network mining and analysis. In the meantime, the popular models of random walk-based network embedding are viewed as the form of matrix factorization, whose computational cost is very expensive. Moreover, mapping different types of nodes into one metric space may result in incompatibility. To cope with the two challenges above, a weighted meta-path embedding framework (WMPE) is proposed in this paper. On one hand, a nearly-linear approximate embedding approach is leveraged to reduce the computational cost. On the other hand, the meta-path and its weight are learned to integrate the incompatible semantics in the form of weighted combination. Experiment results show that WMPE is effective and outperforms the state-of-the-art baselines on two real-world datasets.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Lee, G., Kang, S., Whang, J.: Hyperlink classification via structured graph embedding. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1017–1020 (2019)

    Google Scholar 

  2. Fan, S., et al.: One2Multi graph autoencoder for multi-view graph clustering. In: WWW’20: Proceedings of The Web Conference 2020, pp. 3070–3076 (2020)

    Google Scholar 

  3. Rosso, P., Yang, D., Philippe, C.M.: Beyond triplets: hyper-relational knowledge graph embedding for link prediction. In: WWW’20: Proceedings of The Web Conference 2020, pp 1885–1896 (2020)

    Google Scholar 

  4. Wen, Y., et al.: Network embedding based recommendation method in social networks. In: Companion of the Web Conference 2018, pp. 11–12 (2018)

    Google Scholar 

  5. Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, pp. 849–856 (2002)

    Google Scholar 

  6. Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)

    Google Scholar 

  7. Tang, J., et al.: LINE: large-scale information network embedding. In: Proceedings of 24th International Conference on World Wide Web, pp. 1067–1077 (2015)

    Google Scholar 

  8. Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864 (2016)

    Google Scholar 

  9. Qiu, J., et al.: Network embedding as matrix factorization: unifying DeepWalk, LINE, PTE, and node2vec. In: Proceedings of the 11th ACM International Conference on Web Search and Data Mining, pp. 459–467 (2018)

    Google Scholar 

  10. Sun, Y., et al.: Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endow, pp. 992–1003 (2011)

    Google Scholar 

  11. Sun, Y., et al.: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: Proceedings of 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 723–724 (2012)

    Google Scholar 

  12. Shi, C., et al.: HeteSim: a general framework for relevance measure in heterogeneous networks. IEEE Trans. Knowl. Data Eng. 26, 2479–2492 (2014)

    Google Scholar 

  13. Agarwal, A., Phillips, J.M., Venkatasubramanian, S.: Universal multi-dimensional scaling. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1149–1158 (2010)

    Google Scholar 

  14. Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems, pp. 585–591 (2002)

    Google Scholar 

  15. Cao, S., Lu, W., Xu, Q.: GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM International Conference on Information and Knowledge Management, pp. 891–900 (2015)

    Google Scholar 

  16. Ou, M., et al.: Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1105–1114 (2016)

    Google Scholar 

  17. Wang, X., et al.: Community preserving network embedding. In: 31st AAAI Conference on Artificial Intelligence, pp. 203–209 (2017)

    Google Scholar 

  18. Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: Scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 135–144 (2017)

    Google Scholar 

  19. Fu, T., Lee, W., Lei, Z.: HIN2Vec: explore meta-paths in heterogeneous information networks for representation learning. In: Proceedings of the 26th ACM on Conference on Information and Knowledge Management, pp. 1797–1806 (2017)

    Google Scholar 

  20. Hu, Z., et al.: Heterogeneous graph transformer. In: Proceedings of the World Wide Web Conference (2020)

    Google Scholar 

  21. Wang, X., et al.: Heterogeneous graph attention network. In: Proceedings of the World Wide Web Conference, pp. 2022–2032 (2019)

    Google Scholar 

  22. Hu, B., Fang, Y., Shi, C.: Adversarial learning on heterogeneous information networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 120–129 (2019)

    Google Scholar 

  23. Shi, Y., et al.: Easing embedding learning by comprehensive transcription of heterogeneous information networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2190–2199 (2018)

    Google Scholar 

  24. Khoa, N.L.D., Chawla, S.: Large scale spectral clustering using resistance distance and Spielman-Teng solvers. In: International Conference on Discovery Science, pp. 7–21 (2012)

    Google Scholar 

  25. Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 563–568 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongjun Zhang .

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

Zhang, Y., Yang, X., Wang, L. (2020). Weighted Meta-Path Embedding Learning for Heterogeneous Information Networks. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2020. WISE 2020. Lecture Notes in Computer Science(), vol 12342. Springer, Cham. https://doi.org/10.1007/978-3-030-62005-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62005-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62004-2

  • Online ISBN: 978-3-030-62005-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics