Skip to main content

Advertisement

Springer Nature Link
Log in

DNETC: dynamic network embedding preserving both triadic closure evolution and community structures

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Network embedding, a central issue of deep learning preprocessing on social networks, aims to transform network elements (vertices) into low-dimensional latent vector space while preserving the topology and properties of the network. However, most of the existing methods mainly focus on static networks, neglecting the dynamic characteristics of real social networks. The explanation for the fundamental dynamic mechanism of social network evolution is still lacking. We design a novel dynamic network embedding approach preserving both triadic closure evolution and community structures (DNETC). First, three factors, the popularity of vertices, the proximity of vertices, and the community structures, are incorporated relying on the triadic closure principle in social networks. Second, the triadic closure loss function, the community loss function, and the temporal smoothness loss function are constructed and incorporated to optimize DNETC. Finally, the low-dimensional cognition presentation of a dynamic social network can be achieved, which can save both the evolution patterns of microscopic vertices and the structure information of macroscopic communities. Experiments on the classical tasks of link prediction, link reconstruction, and changed link reconstruction and prediction demonstrate the superiority of DNETC over state-of-the-art methods. The first experimental results validate the effectiveness of adopting triadic closure progress and community structures to improve the quality of the learned low-dimensional vectors. The last experimental results further verify the parameter sensitivity of DNETC to the analysis task. It provides a new idea for dynamic network embedding to reflect the real evolution characteristics of networks and enhance the effect of network analysis tasks. The code is available at https://github.com/YangMin-10/DNETC.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Code availability

The code is available at https://github.com/YangMin-10/DNETC.

References

  1. Ma J, Gao W, Wong K-F (2019) Detect Rumors on Twitter by Promoting Information Campaigns with Generative Adversarial Learning. In: Proceedings of the World Wide Web Conference, San Francisco, CA, USA, 2019, pp 3049–3055

  2. Wan J, Chen X, Du Y, Jia M (2019) Information propagation model based on hybrid social factors of opportunity, trust and motivation. Neurocomputing 333:169–184

    Article  Google Scholar 

  3. Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, Melbourne, Victoria, Australia: Association for Computing Machinery, 2015, pp 1539–1554

  4. Jin Z, Zhao X, Liu Y (2021) Heterogeneous graph network embedding for sentiment analysis on social media. Cogn Comput 13:81–95

    Article  Google Scholar 

  5. Lvd M, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605

    MATH  Google Scholar 

  6. Shi C, Hu B, Zhao W, Yu P (2019) Heterogeneous information network embedding for recommendation. IEEE Trans Knowl Data Eng 31(2):357–370

    Article  Google Scholar 

  7. Wang X, Cui P, Wang J, Pei J, Zhu W, Yang S (2017) Community preserving network embedding. In: Proceedings of the 31st AAAI conference on artificial intelligence, AAAI, San Francisco, California, USA, 2017

  8. Chen J, Zhang Q, Huang X (2016) Incorporate Group Information to Enhance Network Embedding. In: Proceedings of the 25th ACM international on conference on information and knowledge management, Indianapolis, Indiana, USA, 2017, pp 1901–1904

  9. Ren F, Chen X, Hao F, Du Y, Zheng J (2020) OFNE: a framework of opinion features regulated network embedding. J Supercomput 76(7):5486–5500

    Article  Google Scholar 

  10. Xue G, Zhong M, Li J, Chen J, Zhai C, Kong R (2020) Dynamic network embedding survey. Neurocomputing 472:212–223

    Article  Google Scholar 

  11. Roweis S, Saul L (2001) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326

    Article  Google Scholar 

  12. Belkin M, Niyogi P (2001) Laplacian Eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic, Vancouver, British Columbia, Canada, 2001

  13. Tang L, Liu H (2011) Leveraging social media networks for classification. Data Min Knowl Disc 23(3):447–478

    Article  MathSciNet  MATH  Google Scholar 

  14. Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, New York, USA 2014, pp 701–710

  15. Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: large-scale information network embedding. In: Proceedings of the 24th international conference on World Wide Web, New York, 2015, pp 1067–1077

  16. Cao S, Lu W, Xu Q (2015) GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management, 2015, pp 891–900

  17. Yang C, Liu Z, Zhao D, Sun M, Chang EY (2015) Network representation learning with rich text information. In: Proceedings of the 24th international joint conference on artificial intelligence, 2015

  18. Yang C, Sun M, Liu Z, Tu C (2017) Fast network embedding enhancement via high order proximity approximation. In: Proceedings of the 26th international joint conference on artificial intelligence, 2017, pp 3894–3900

  19. Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, 2016, pp 1225–1234

  20. Chen B, Chen X (2022) MAUIL: Multilevel attribute embedding for semisupervised user identity linkage. Inf Sci 593:527–545

    Article  Google Scholar 

  21. Li J, Dani H, Hu X, Tang J, Chang Y, Liu H (2017) Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 2017 ACM international on conference on information and knowledge management, 2017, pp 387–396

  22. Zhu L, Guo D, Yin J, Steeg GV, Galstyan A (2016) Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans Knowl Data Eng 28(10):2765–2777

    Article  Google Scholar 

  23. Goyal P, Kamra N, He X, Liu Y (2018) DynGEM: Deep embedding method for dynamic graphs. arXiv preprint arXiv:1805.11273

  24. Coleman JS (1994) Foundations of social theory. Harvard University Press, Cambridge

    Google Scholar 

  25. Gamst FC (1991) Foundations of social theory. Anthropol Work Rev 12(3):19–25

    Article  Google Scholar 

  26. Huang H, Tang J, Liu L, Luo JD, Fu X (2015) Triadic closure pattern analysis and prediction in social networks. IEEE Trans Knowl Data Eng 27(12):3374–3389

    Article  Google Scholar 

  27. Bianconi G, Darst RK, Iacovacci J, Fortunato S (2014) Triadic closure as a basic generating mechanism of communities in complex networks. Phys Rev E Stat Nonlin, Soft Matter Phys 90(4):042806

    Article  Google Scholar 

  28. Zhou L, Yang Y, Ren X, Wu F, Zhuang Y (2018) Dynamic network embedding by modeling triadic closure process. In: Proceedings of the 32nd AAAI conference on artificial intelligence, 2018, 32(1)

  29. Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781

  30. Grover A, Leskovec J, Assoc Comp M (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, New York, 2016, pp 855–864.

  31. Gong M, Chen C, Xie Y, Wang S (2018) Community preserving network embedding based on memetic algorithm. IEEE Trans Emerging Top Comput Intell 4(2):108–118

    Article  Google Scholar 

  32. Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of the 6th ACM international conference on web search and data mining, 2013, pp

  33. Tu C, Liu H, Liu Z, Sun M (2017) Cane: context-aware network embedding for relation modeling. In: Proceedings of the 55th annual meeting of the association for computational linguistics (Volume 1: Long Papers), 2017, pp 1722–1731

  34. Tu C, Zhang W, Liu Z, Sun M (2016) Max-Margin DeepWalk: discriminative learning of network representation. In: Proceedings of international joint conference on artificial intelligence, New York, 2016, pp 3889–3895

  35. Li J, Zhu J, Zhang B (2016) Discriminative deep random walk for network classification. In: Proceedings of the 54th annual meeting of the association for computational linguistics (Volume 1: Long Papers), 2016, pp 1004–1013

  36. Tu C, Zhang Z, Liu Z, Sun M (2017) TransNet: translation-based network representation learning for social relation extraction. In: Proceedings of international joint conference on artificial intelligence, Melbourne, 2017, pp 2864-2870

  37. Zhu D, Cui P, Zhang Z, Pei J, Zhu W (2018) High-order proximity preserved embedding for dynamic networks. IEEE Trans Knowl Data Eng 30(11):2134–2144

    Google Scholar 

  38. Du L, Wang Y, Song G, Lu Z, Wang J (2018) Dynamic network embedding: an extended approach for skip-gram based network embedding. In: Proceedings of international joint conference on artificial intelligence, 2018, pp 2086–2092

  39. Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: Companion proceedings of the the web conference 2018, 2018, pp 969–976

  40. Zuo Y, Liu G, Lin H, Guo J, Hu X, Wu J (eds). Embedding temporal network via neighborhood formation. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, 2018, pp 2857–2866

  41. Yu W, Cheng W, Aggarwal CC, Zhang K, Chen H, Wang W (eds) NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining; 2018.

  42. Ma L, Zhang Y, Li J, Lin Q, Bao Q, Wang S, Gong M (2020) Community-aware dynamic network embedding by using deep autoencoder. Inf Sci 519:22–42

    Article  Google Scholar 

  43. Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: Capturing network dynamics using dynamic graph representation learning. Knowl-Based Syst 187:104816

    Article  Google Scholar 

  44. Sankar A, Wu Y, Gou L, Zhang W, Yang H (2020) Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, 2020, pp 519–527

  45. Rossi E, Chamberlain B, Frasca F, Eynard D, Monti F, Bronstein M (2020) Temporal graph networks for deep learning on dynamic graphs. ICML 2020 Workshop on Graph Representation Learning ,2020

  46. Chen J, Wang X, Xu X (2022) GC-LSTM: Graph convolution embedded LSTM for dynamic link prediction. Appl Intell 52(7):7513–7528

    Article  Google Scholar 

  47. Wen Z, Fang Y (2022) TREND: TempoRal Event and Node Dynamics for Graph Representation Learning. Proceedings of the ACM Web Conference 2022:1159–1169

    Google Scholar 

  48. Xie L, Shen H, Feng D (2022) Structural-Temporal embedding of large-scale dynamic networks with parallel implementation. Comput Electr Eng 100:107835

    Article  Google Scholar 

  49. Fang Y, Zhao X, Huang P, Xiao W, de Rijke M (2022) Scalable Representation Learning for Dynamic Heterogeneous Information Networks via Metagraphs. ACM Transactions on Information Systems (TOIS) 40(4):1–27

    Article  Google Scholar 

  50. Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H et al. (2020). "Evolvegcn: Evolving graph convolutional networks for dynamic graphs." In: Proceedings of the AAAI Conference on Artificial Intelligence 34(04): 5363–5370

  51. Cordasco G, Gargano L (2010) Community detection via semi-synchronous label propagation algorithms. In: 2010 IEEE international workshop on: business applications of social network analysis (BASNA), IEEE, 2010:1–8

  52. Dempster AP, Laird NM, Rubin DB (1977) Maximum Likelihood from Incomplete Data Via the EM Algorithm. J Roy Stat Soc: Ser B (Methodol) 39(1):1–22

    MathSciNet  MATH  Google Scholar 

  53. Duchi J, Hazan E, Singer Y (2011) Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. J Mach Learn Res 12(7):2121–2159

    MathSciNet  MATH  Google Scholar 

  54. Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2015

Download references

Funding

This work is supported by the National Natural Science Foundation of China (Grant Numbers 61902324, 11426179, and 61872298), the Science and Technology Program of Sichuan Province (Grant Numbers 2023ZDYF2732, 2021YFQ0008, 2020JDRC0067).

Author information

Authors and Affiliations

  1. School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China

    Min Yang, Xiaoliang Chen & Yajun Du

  2. Department of Computer Science and Operations Research, University of Montreal, Montreal, QC, H3C3J7, Canada

    Xiaoliang Chen & Peng Lu

  3. College of Computer Science, Sichuan University, Chengdu, 610065, China

    Baiyang Chen

Authors
  1. Min Yang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xiaoliang Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Baiyang Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Peng Lu
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Yajun Du
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

MY involved in conceptualization; MY involved in data curation; XLC involved in formal analysis; PL involved in funding acquisition; MY involved in investigation; XLC involved in methodology; YD involved in project administration; XLC involved in resources; MY involved in software; XLC involved in supervision; BYC involved in validation; MY involved in visualization; MY involved in writing—original draft; and XLC involved in writing—review and editing.

Corresponding author

Correspondence to Xiaoliang Chen.

Ethics declarations

Conflict of interest

The authors have no competing interests to declare that are relevant to the content of this article.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, M., Chen, X., Chen, B. et al. DNETC: dynamic network embedding preserving both triadic closure evolution and community structures. Knowl Inf Syst 65, 1129–1157 (2023). https://doi.org/10.1007/s10115-022-01792-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-022-01792-4

Keywords