On Applying Meta-path for Network Embedding in Mining Heterogeneous DBLP Network

  • Akash AnilEmail author
  • Uppinder Chugh
  • Sanasam Ranbir Singh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11942)


Unsupervised network embedding using neural networks garnered considerable popularity in generating network features for solving various network-based problems such as link prediction, classification, clustering, etc. As majority of the information networks are heterogeneous in nature (consist of multiple types of nodes and edges), previous approaches for heterogeneous network embedding exploit predefined meta-paths. However, a meta-path guides the model towards a specific sub-structure of the underlying heterogeneous information network, it tends to lose other inherent characteristics. Further, different meta-paths capture proximities of different semantics and may affect the performance of underlying task differently. In this paper, we systematically study the effects of different meta-paths using recently proposed network embedding methods (Metapath2vec, Node2vec, and VERSE) over DBLP bibliographic network and evaluate the performance of embeddings on two applications, namely (i) Co-authorship prediction and (ii) Author’s research area classification. From various experimental observations, it is evident that embeddings exploiting different meta-paths perform differently over different tasks. It shows that meta-path based network embedding is task-specific and can not be generalized for different tasks. We further observe that selecting particular node types in heterogeneous bibliographic network yields better quality of node embeddings in comparison to considering specific meta-path.


Heterogeneous network Meta-path Heterogeneous network embedding DBLP Co-authorship prediction Author classification 


  1. 1.
    Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., Smola, A.J.: Distributed large-scale natural graph factorization. In: WWW, pp. 37–48 (2013)Google Scholar
  2. 2.
    Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, pp. 585–591 (2002)Google Scholar
  3. 3.
    Cao, B., Kong, X., Philip, S.Y.: Collective prediction of multiple types of links in heterogeneous information networks. In: ICDM, pp. 50–59 (2014)Google Scholar
  4. 4.
    Cao, S., Lu, W., Xu, Q.: Grarep: learning graph representations with global structural information. In: CIKM, pp. 891–900 (2015)Google Scholar
  5. 5.
    Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: scalable representation learning for heterogeneous networks. In: SIGKDD, pp. 135–144 (2017)Google Scholar
  6. 6.
    Fu, T.y., Lee, W.C., Lei, Z.: Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management CIKM 2017, pp. 1797–1806. ACM, New York (2017).
  7. 7.
    Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: SIGKDD, pp. 855–864. ACM (2016)Google Scholar
  8. 8.
    Kong, X., Yu, P.S., Ding, Y., Wild, D.J.: Meta path-based collective classification in heterogeneous information networks. In: CIKM, pp. 1567–1571 (2012)Google Scholar
  9. 9.
    Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS, pp. 3111–3119 (2013)Google Scholar
  10. 10.
    Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: SIGKDD, pp. 1105–1114 (2016)Google Scholar
  11. 11.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. In: Proceedings of the 7th International World Wide Web Conference,Brisbane, Australia, pp. 161–172 (1998).
  12. 12.
    Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: SIGKDD, pp. 701–710 (2014)Google Scholar
  13. 13.
    Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)CrossRefGoogle Scholar
  14. 14.
    Sun, Y., Barber, R., Gupta, M., Aggarwal, C.C., Han, J.: Co-author relationship prediction in heterogeneous bibliographic networks. In: ASONAM, pp. 121–128. IEEE (2011)Google Scholar
  15. 15.
    Sun, Y., Han, J.: Mining heterogeneous information networks: principles and methodologies. Synth. Lect. Data Min. Knowl. Discovery 3(2), 1–159 (2012)CrossRefGoogle Scholar
  16. 16.
    Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: WWW, pp. 1067–1077 (2015)Google Scholar
  17. 17.
    Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)CrossRefGoogle Scholar
  18. 18.
    Tsitsulin, A., Mottin, D., Karras, P., Müller, E.: Verse: versatile graph embeddings from similarity measures. In: WWW, pp. 539–548 (2018)Google Scholar
  19. 19.
    Yang, D., Xiao, Y., Xu, B., Tong, H., Wang, W., Huang, S.: Which topic will you follow? In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012. LNCS (LNAI), vol. 7524, pp. 597–612. Springer, Heidelberg (2012). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Akash Anil
    • 1
    Email author
  • Uppinder Chugh
    • 1
  • Sanasam Ranbir Singh
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology GuwahatiGuwahatiIndia

Personalised recommendations