Skip to main content

Enhancing Network Role Modeling: Introducing Attributed Multiplex Structural Role Embedding for Complex Networks

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2024)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14646))

Included in the following conference series:

  • 121 Accesses

Abstract

Numerous studies have focused on defining node roles within networks, producing network embeddings that maintain the structural role proximity of nodes. Yet, these approaches often fall short when applied to complex real-world networks, such as Twitter, where nodes have varying types of relationships (e.g., following, retweeting, replying) and possess relevant attributes impacting their network role (e.g., user profiles). To address these limitations, this study presents a novel method for attributed (for dealing with attributed nodes) multiplex (for dealing with networks with different types of edges) structural role embedding. This approach uses an autoencoder mechanism to concurrently encode node structure, relationships, and attributes, thus successfully modeling nodes’ roles within networks. Our method’s effectiveness is shown through quantitative and qualitative analyses conducted on synthetic networks, outperforming established benchmarks in identifying node roles within multiplex and attributed networks. Additionally, we have assembled a robust real-world multiplex network composed of almost all verified Twitter users comprised of retweet, reply, and followership interactions between these users, representing three different layers in our multiplex network. This network serves as a practical environment to evaluate our method’s capability to map the structural roles of users within real-world attributed multiplex networks. Using a verified dataset of influential users as a reference, we show our method excels over the existing benchmarks in learning structural roles on large-scale, real-world attributed multiplex networks, exemplified by our Twitter network.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

References

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

    Google Scholar 

  2. Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: Scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD (2017)

    Google Scholar 

  3. Donnat, C., Zitnik, M., Hallac, D., Leskovec, J.: Learning structural node embeddings via diffusion wavelets. In: Proceedings of the 24th KDD (2018)

    Google Scholar 

  4. Forman, R.: Discrete and computational geometry (2003)

    Google Scholar 

  5. Fu, T., 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, pp. 1797–1806 (2017)

    Google Scholar 

  6. Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd KDD, pp. 855–864. ACM (2016)

    Google Scholar 

  7. Huang, C., Wang, L., Cao, X., Ma, W., Vosoughi, S.: Learning dynamic graph embeddings using random walk with temporal backtracking. In: NeurIPS 2022 Temporal Graph Learning Workshop (2022)

    Google Scholar 

  8. Hussein, R., Yang, D., Cudré-Mauroux, P.: Are meta-paths necessary? Revisiting heterogeneous graph embeddings. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 437–446 (2018)

    Google Scholar 

  9. Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)

  10. Le, Q., Mikolov, T.: Distributed representations of sentences and documents. In: International Conference on Machine Learning, pp. 1188–1196. PMLR (2014)

    Google Scholar 

  11. Nikolentzos, G., Vazirgiannis, M.: Learning structural node representations using graph kernels. IEEE TKDE 33(5), 2045–2056 (2019)

    Google Scholar 

  12. Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: 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 

  13. Park, C., Kim, D., Han, J., Yu, H.: Unsupervised attributed multiplex network embedding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5371–5378 (2020)

    Google Scholar 

  14. Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th KDD, pp. 701–710. ACM (2014)

    Google Scholar 

  15. Qu, M., Tang, J., Shang, J., Ren, X., Zhang, M., Han, J.: An attention-based collaboration framework for multi-view network representation learning. In: Proceedings of the 2017 CIKM (2017)

    Google Scholar 

  16. Ribeiro, L.F., Saverese, P.H., Figueiredo, D.R.: struc2vec: learning node representations from structural identity. In: the 23rd KDD, pp. 385–394 (2017)

    Google Scholar 

  17. Sreejith, R., Mohanraj, K., Jost, J., Saucan, E., Samal, A.: Forman curvature for complex networks. J. Stat. Mech. Theory Exp. 2016(6), 063206 (2016)

    Article  MathSciNet  Google Scholar 

  18. Statista: Most popular influential twitter users in 2020. https://www.statista.com/statistics/1100266/top-influential-twitter-users/ (2022)

  19. Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067–1077. International World Wide Web Conferences Steering Committee (2015)

    Google Scholar 

  20. Tu, K., Cui, P., Wang, X., Yu, P.S., Zhu, W.: Deep recursive network embedding with regular equivalence. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2357–2366 (2018)

    Google Scholar 

  21. Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234. ACM (2016)

    Google Scholar 

  22. Wang, L., Gao, C., Huang, C., Liu, R., Ma, W., Vosoughi, S.: Embedding heterogeneous networks into hyperbolic space without meta-path. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 10147–10155 (2021)

    Google Scholar 

  23. Wang, L., Huang, C., Cao, X., Ma, W., Vosoughi, S.: Graph-level embedding for time-evolving graphs. In: Companion Proceedings of the ACM Web Conference 2023, pp. 5–8 (2023)

    Google Scholar 

  24. Wang, L., Huang, C., Lu, Y., Ma, W., Liu, R., Vosoughi, S.: Dynamic structural role node embedding for user modeling in evolving networks. ACM Trans. Inf. Syst. 40, 1–21 (2021)

    Google Scholar 

  25. Wang, L., Huang, C., Ma, W., Cao, X., Vosoughi, S.: Graph embedding via diffusion-wavelets-based node feature distribution characterization. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 3478–3482 (2021)

    Google Scholar 

  26. Wang, L., Huang, C., Ma, W., Liu, R., Vosoughi, S.: Hyperbolic node embedding for temporal networks. Data Mining Knowl. Disc. 35, 1–35 (2021)

    Article  MathSciNet  Google Scholar 

  27. Wang, L., Huang, C., Ma, W., Lu, Y., Vosoughi, S.: Embedding node structural role identity using stress majorization. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 3473–3477 (2021)

    Google Scholar 

  28. Wang, L., Lu, Y., Huang, C., Vosoughi, S.: Embedding node structural role identity into hyperbolic space. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 2253–2256 (2020)

    Google Scholar 

  29. Zhang, H., Qiu, L., Yi, L., Song, Y.: Scalable multiplex network embedding. IJCAI 18, 3082–3088 (2018)

    Google Scholar 

  30. Zhang, R., Zimek, A., Schneider-Kamp, P.: Unsupervised representation learning on attributed multiplex network. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 2610–2619 (2022)

    Google Scholar 

  31. Zhang, W., Guo, X., Wang, W., Tian, Q., Pan, L., Jiao, P.: Role-based network embedding via structural features reconstruction with degree-regularized constraint. Knowl. Based Syst. 218, 106872 (2021)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lili Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, L., Huang, C., Yao, R., Gao, C., Ma, W., Vosoughi, S. (2024). Enhancing Network Role Modeling: Introducing Attributed Multiplex Structural Role Embedding for Complex Networks. In: Yang, DN., Xie, X., Tseng, V.S., Pei, J., Huang, JW., Lin, J.CW. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2024. Lecture Notes in Computer Science(), vol 14646. Springer, Singapore. https://doi.org/10.1007/978-981-97-2253-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-2253-2_24

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-2252-5

  • Online ISBN: 978-981-97-2253-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics