{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T08:50:51Z","timestamp":1771231851745,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T00:00:00Z","timestamp":1617062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T00:00:00Z","timestamp":1617062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graph convolutional network (GCN) has made remarkable progress in learning good representations from graph-structured data. The layer-wise propagation rule of conventional GCN is designed in such a way that the feature aggregation at each node depends on the features of the one-hop neighbouring nodes. Adding an attention layer over the GCN can allow the network to provide different importance within various one-hop neighbours. These methods can capture the properties of static network, but is not well suited to capture the temporal patterns in time-varying networks. In this work, we propose a temporal graph attention network (TempGAN), where the aim is to learn representations from continuous-time temporal network by preserving the temporal proximity between nodes of the network. First, we perform a temporal walk over the network to generate a positive pointwise mutual information matrix (PPMI) which denote the temporal correlation between the nodes. Furthermore, we design a TempGAN architecture which uses both adjacency and PPMI information to generate node embeddings from temporal network. Finally, we conduct link prediction experiments by designing a TempGAN autoencoder to evaluate the quality of the embedding generated, and the results are compared with other state-of-the-art methods.<\/jats:p>","DOI":"10.1007\/s40747-021-00332-x","type":"journal-article","created":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T06:02:28Z","timestamp":1617084148000},"page":"13-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Temporal network embedding using graph attention network"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1044-9368","authenticated-orcid":false,"given":"Anuraj","family":"Mohan","sequence":"first","affiliation":[]},{"given":"K V","family":"Pramod","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,30]]},"reference":[{"issue":"4","key":"332_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein MM, Bruna J, LeCun Y, Szlam A, Vandergheynst P (2017) Geometric deep learning: going beyond Euclidean data. IEEE Signal Process Mag 34(4):18\u201342","journal-title":"IEEE Signal Process Mag"},{"issue":"2","key":"332_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ipm.2016.12.003","volume":"53","author":"C Musto","year":"2017","unstructured":"Musto C, Basile P, Lops P, de Gemmis M, Semeraro G (2017) Introducing linked open data in graph-based recommender systems. Inf Process Manag 53(2):405\u2013435","journal-title":"Inf Process Manag"},{"key":"332_CR3","doi-asserted-by":"crossref","unstructured":"Mason W, Vaughan JW, Wallach H(2014) Special issue: Computational social science and social computing, Mach Learn 96:257\u2013469","DOI":"10.1007\/s10994-013-5426-8"},{"key":"332_CR4","doi-asserted-by":"crossref","unstructured":"Yadav CS, Sharan A, Joshi ML (2014) Semantic graph based approach for text mining. In: 2014 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT). IEEE, pp 596\u2013601","DOI":"10.1109\/ICICICT.2014.6781348"},{"issue":"10","key":"332_CR5","doi-asserted-by":"publisher","first-page":"3177","DOI":"10.1007\/s00521-017-2910-2","volume":"30","author":"RS Bhadoria","year":"2018","unstructured":"Bhadoria RS, Chaudhari NS, Samanta S (2018) Uncertainty in sensor data acquisition for SOA system. Neural Comput Appl 30(10):3177\u20133187","journal-title":"Neural Comput Appl"},{"key":"332_CR6","doi-asserted-by":"crossref","unstructured":"Srivastav MK, Bhadoria RS, Pramanik T (2020) Integration of multiple cache server scheme for user-based fuzzy logic in content delivery networks. In: Handbook of research on advanced applications of graph theory in modern society. IGI Global, pp 386\u2013396","DOI":"10.4018\/978-1-5225-9380-5.ch016"},{"key":"332_CR7","doi-asserted-by":"crossref","unstructured":"Ma\u2019ayan A (2011) Introduction to network analysis in systems biology. Sci Signaling 4(190):tr5","DOI":"10.1126\/scisignal.2001965"},{"key":"332_CR8","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: Methods and applications. arXiv:1709.05584"},{"issue":"5","key":"332_CR9","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui P, Wang X, Pei J, Zhu W (2018) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"332_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78\u201394","journal-title":"Knowl Based Syst"},{"issue":"9","key":"332_CR11","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"332_CR12","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. In: Advances in neural information processing systems, pp 3844\u20133852"},{"key":"332_CR13","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv:1609.02907"},{"key":"332_CR14","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. arXiv:1706.02216."},{"issue":"1","key":"332_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s40649-019-0069-y","volume":"6","author":"S Zhang","year":"2019","unstructured":"Zhang S, Tong H, Xu J, Maciejewski R (2019) Graph convolutional networks: a comprehensive review. Comput Soc Netw 6(1):11","journal-title":"Comput Soc Netw"},{"issue":"10","key":"332_CR16","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TKDE.2016.2591009","volume":"28","author":"L Zhu","year":"2016","unstructured":"Zhu L, Guo D, Yin J, Ver Steeg G, Galstyan A (2016) Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans Knowl Data Eng 28(10):2765\u20132777","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"332_CR17","unstructured":"Goyal P, Kamra N, He X, Liu Y (2018) Dyngem: deep embedding method for dynamic graphs. arXiv:1805.11273"},{"key":"332_CR18","doi-asserted-by":"crossref","unstructured":"Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H, Kaler T, Leisersen CE (2019) Evolvegcn: evolving graph convolutional networks for dynamic graphs. arXiv:1902.10191","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"332_CR19","first-page":"969","volume":"2018","author":"GH Nguyen","year":"2018","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. Companion Proc Web Conf 2018:969\u2013976","journal-title":"Companion Proc Web Conf"},{"key":"332_CR20","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv:1710.10903"},{"key":"332_CR21","doi-asserted-by":"crossref","unstructured":"Deng L, Hinton G, Kingsbury B (2013) New types of deep neural network learning for speech recognition and related applications: An overview. In: 2013 IEEE international conference on acoustics, speech and signal processing. IEEE, pp 8599\u20138603","DOI":"10.1109\/ICASSP.2013.6639344"},{"key":"332_CR22","doi-asserted-by":"publisher","first-page":"19143","DOI":"10.1109\/ACCESS.2019.2896880","volume":"7","author":"AB Nassif","year":"2019","unstructured":"Nassif AB, Shahin I, Attili I, Azzeh M, Shaalan K (2019) Speech recognition using deep neural networks: a systematic review. IEEE Access 7:19143\u201319165","journal-title":"IEEE Access"},{"issue":"2","key":"332_CR23","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10489-013-0461-5","volume":"40","author":"DM Ram\u00edk","year":"2014","unstructured":"Ram\u00edk DM, Sabourin C, Moreno R, Madani K (2014) A machine learning based intelligent vision system for autonomous object detection and recognition. Appl Intell 40(2):358\u2013375","journal-title":"Appl Intell"},{"key":"332_CR24","doi-asserted-by":"crossref","unstructured":"Praneel AV, Rao TS, Murty MR (2020) A survey on accelerating the classifier training using various boosting schemes within cascades of boosted ensembles. In: Intelligent Manufacturing and Energy Sustainability. Springer, pp 809\u2013825","DOI":"10.1007\/978-981-15-1616-0_79"},{"issue":"1","key":"332_CR25","first-page":"4","volume":"1","author":"A Khan","year":"2010","unstructured":"Khan A, Baharudin B, Lee LH, Khan K (2010) A review of machine learning algorithms for text-documents classification. J Adv Inf Technol 1(1):4\u201320","journal-title":"J Adv Inf Technol"},{"key":"332_CR26","unstructured":"Allahyari M, Pouriyeh S, Assefi M, Safaei S, Trippe ED, Gutierrez JB, Kochut K (2017) A brief survey of text mining: Classification, clustering and extraction techniques. arXiv:1707.02919"},{"key":"332_CR27","doi-asserted-by":"crossref","unstructured":"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, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"332_CR28","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"332_CR29","doi-asserted-by":"crossref","unstructured":"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, pp 1225\u20131234","DOI":"10.1145\/2939672.2939753"},{"key":"332_CR30","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: Thirtieth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"332_CR31","doi-asserted-by":"crossref","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","DOI":"10.1109\/TNNLS.2020.2978386"},{"issue":"3","key":"332_CR32","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"DI Shuman","year":"2013","unstructured":"Shuman DI, Narang SK, Frossard P, Ortega A, Vandergheynst P (2013) The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process Mag 30(3):83\u201398","journal-title":"IEEE Signal Process Mag"},{"key":"332_CR33","unstructured":"Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv:1312.6203"},{"key":"332_CR34","unstructured":"Henaff M, Bruna J, LeCun Y (2015) Deep convolutional networks on graph-structured data. arXiv:1506.05163"},{"issue":"2","key":"332_CR35","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.acha.2010.04.005","volume":"30","author":"DK Hammond","year":"2011","unstructured":"Hammond DK, Vandergheynst P, Gribonval R (2011) Wavelets on graphs via spectral graph theory. Appl Comput Harmon Anal 30(2):129\u2013150","journal-title":"Appl Comput Harmon Anal"},{"key":"332_CR36","first-page":"7370","volume":"33","author":"L Yao","year":"2019","unstructured":"Yao L, Mao C, Luo Y (2019) Graph convolutional networks for text classification, Proceedings of the AAAI Conference on. Artif Intell 33:7370\u20137377","journal-title":"Artif Intell"},{"key":"332_CR37","doi-asserted-by":"crossref","unstructured":"Ying R, He R, Chen K, Eksombatchai P, Hamilton WL, Leskovec J (2018) Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 974\u2013983","DOI":"10.1145\/3219819.3219890"},{"key":"332_CR38","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: European Semantic Web Conference. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"332_CR39","doi-asserted-by":"crossref","unstructured":"Chen Z-M, Wei X-S, Wang P, Guo Y (2019) Multi-label image recognition with graph convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 5177\u20135186","DOI":"10.1109\/CVPR.2019.00532"},{"issue":"13","key":"332_CR40","doi-asserted-by":"publisher","first-page":"i457","DOI":"10.1093\/bioinformatics\/bty294","volume":"34","author":"M Zitnik","year":"2018","unstructured":"Zitnik M, Agrawal M, Leskovec J (2018) Modeling polypharmacy side effects with graph convolutional networks. Bioinformatics 34(13):i457\u2013i466","journal-title":"Bioinformatics"},{"issue":"3","key":"332_CR41","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1093\/bib\/bbz042","volume":"21","author":"M Sun","year":"2020","unstructured":"Sun M, Zhao S, Gilvary C, Elemento O, Zhou J, Wang F (2020) Graph convolutional networks for computational drug development and discovery. Brief Bioinform 21(3):919\u2013935","journal-title":"Brief Bioinform"},{"key":"332_CR42","unstructured":"Chen J, Ma T, Xiao C (2018) Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247"},{"key":"332_CR43","doi-asserted-by":"crossref","unstructured":"Yang C, Sun M, Liu Z, Tu C (2017) Fast network embedding enhancement via high order proximity approximation. In: IJCAI, pp 3894\u20133900","DOI":"10.24963\/ijcai.2017\/544"},{"key":"332_CR44","doi-asserted-by":"publisher","first-page":"123002","DOI":"10.1109\/ACCESS.2019.2938039","volume":"7","author":"Z Liu","year":"2019","unstructured":"Liu Z, Liu W, Chen P-Y, Zhuang C, Song C (2019) hpgat: high-order proximity informed graph attention network. IEEE Access 7:123002\u2013123012","journal-title":"IEEE Access"},{"key":"332_CR45","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: The World Wide Web Conference, pp 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"332_CR46","unstructured":"Yun S, Jeong M, Kim R, Kang J, Kim HJ (2019) Graph transformer networks. In: Advances in neural information processing systems, pp 11983\u201311993"},{"key":"332_CR47","doi-asserted-by":"crossref","unstructured":"Huang J, Shen H, Hou L, Cheng X (2019) Signed graph attention networks, in: International conference on artificial neural networks. Springer, pp 566\u2013577","DOI":"10.1007\/978-3-030-30493-5_53"},{"key":"332_CR48","unstructured":"Yadati N, Nimishakavi M, Yadav P, Nitin V, Louis A, Talukdar P (2019) Hypergcn: A new method for training graph convolutional networks on hypergraphs. In: Advances in neural information processing systems, pp 1511\u20131522"},{"key":"332_CR49","doi-asserted-by":"crossref","unstructured":"Haddad M, Bothorel C, Lenca P, Bedart D (2019) Temporalnode2vec: Temporal node embedding in temporal networks. In: International conference on complex networks and their applications. Springer, pp 891\u2013902","DOI":"10.1007\/978-3-030-36687-2_74"},{"key":"332_CR50","doi-asserted-by":"crossref","unstructured":"Mahdavi S, Khoshraftar S, An A (2018) dynnode2vec: scalable dynamic network embedding. In: 2018 IEEE International Conference on Big Data (Big Data). IEEE, pp 3762\u20133765","DOI":"10.1109\/BigData.2018.8621910"},{"key":"332_CR51","unstructured":"Trivedi R, Farajtabar M, Biswal P, Zha H (2019) Dyrep: learning representations over dynamic graphs. In: International Conference on Learning Representations"},{"key":"332_CR52","doi-asserted-by":"publisher","first-page":"107000","DOI":"10.1016\/j.patcog.2019.107000","volume":"97","author":"F Manessi","year":"2020","unstructured":"Manessi F, Rozza A, Manzo M (2020) Dynamic graph convolutional networks. Pattern Recogn 97:107000","journal-title":"Pattern Recogn"},{"key":"332_CR53","doi-asserted-by":"crossref","unstructured":"Skarding J, Gabrys B, Musial K (2020) Foundations and modelling of dynamic networks using dynamic graph neural networks: a survey. arXiv:2005.07496","DOI":"10.1109\/ACCESS.2021.3082932"},{"issue":"3","key":"332_CR54","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"issue":"6366","key":"332_CR55","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"A Li","year":"2017","unstructured":"Li A, Cornelius SP, Liu Y-Y, Wang L, Barab\u00e1si A-L (2017) The fundamental advantages of temporal networks. Science 358(6366):1042\u20131046","journal-title":"Science"},{"key":"332_CR56","doi-asserted-by":"crossref","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Dynamic network embeddings: From random walks to temporal random walks. In: 2018 IEEE International Conference on Big Data (Big Data). IEEE, pp 1085\u20131092","DOI":"10.1109\/BigData.2018.8622109"},{"issue":"5","key":"332_CR57","doi-asserted-by":"publisher","first-page":"056115","DOI":"10.1103\/PhysRevE.85.056115","volume":"85","author":"M Starnini","year":"2012","unstructured":"Starnini M, Baronchelli A, Barrat A, Pastor-Satorras R (2012) Random walks on temporal networks. Phys Rev E 85(5):056115","journal-title":"Phys Rev E"},{"key":"332_CR58","unstructured":"Levy O, Goldberg Y (2014) Neural word embedding as implicit matrix factorization. In: Advances in neural information processing systems, pp 2177\u20132185"},{"key":"332_CR59","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.patcog.2017.06.025","volume":"71","author":"X Ma","year":"2017","unstructured":"Ma X, Sun P, Qin G (2017) Nonnegative matrix factorization algorithms for link prediction in temporal networks using graph communicability. Pattern Recogn 71:361\u2013374","journal-title":"Pattern Recogn"},{"issue":"1","key":"332_CR60","doi-asserted-by":"publisher","first-page":"19","DOI":"10.26599\/BDMA.2017.9020002","volume":"1","author":"NM Ahmed","year":"2018","unstructured":"Ahmed NM, Chen L, Wang Y, Li B, Li Y, Liu W (2018) Deepeye: link prediction in dynamic networks based on non-negative matrix factorization. Big Data Min Anal 1(1):19\u201333","journal-title":"Big Data Min Anal"},{"key":"332_CR61","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1016\/j.physa.2017.11.134","volume":"492","author":"Y Yasami","year":"2018","unstructured":"Yasami Y, Safaei F (2018) A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks. Phys A 492:2166\u20132197","journal-title":"Phys A"},{"key":"332_CR62","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. In: Advances in neural information processing systems, pp 5165\u20135175"},{"key":"332_CR63","doi-asserted-by":"publisher","first-page":"29219","DOI":"10.1109\/ACCESS.2018.2839770","volume":"6","author":"T Li","year":"2018","unstructured":"Li T, Zhang J, Philip SY, Zhang Y, Yan Y (2018) Deep dynamic network embedding for link prediction. IEEE Access 6:29219\u201329230","journal-title":"IEEE Access"},{"key":"332_CR64","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv:1611.07308"},{"key":"332_CR65","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"issue":"7","key":"332_CR66","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inform Sci Technol"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00332-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00332-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00332-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T21:17:49Z","timestamp":1671743869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00332-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,30]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["332"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00332-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,30]]},"assertion":[{"value":"9 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}