{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:51:11Z","timestamp":1767034271416},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"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":["EPJ Data Sci."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link prediction can be used to extract missing information, identify spurious interactions as well as forecast network evolution. Network embedding is a methodology to assign coordinates to nodes in a low-dimensional vector space. By embedding nodes into vectors, the link prediction problem can be converted into a similarity comparison task. Nodes with similar embedding vectors are more likely to be connected. Classic network embedding algorithms are random-walk-based. They sample trajectory paths via random walks and generate node pairs from the trajectory paths. The node pair set is further used as the input for a Skip-Gram model, a representative language model that embeds nodes (which are regarded as words) into vectors. In the present study, we propose to replace random walk processes by a spreading process, namely the susceptible-infected (SI) model, to sample paths. Specifically, we propose two susceptible-infected-spreading-based algorithms, i.e.,<jats:italic>S<\/jats:italic>usceptible-<jats:italic>I<\/jats:italic>nfected<jats:italic>N<\/jats:italic>etwork<jats:italic>E<\/jats:italic>mbedding (<jats:italic>SINE<\/jats:italic>) on static networks and<jats:italic>T<\/jats:italic>emporal<jats:italic>S<\/jats:italic>usceptible-<jats:italic>I<\/jats:italic>nfected<jats:italic>N<\/jats:italic>etwork<jats:italic>E<\/jats:italic>mbedding (<jats:italic>TSINE<\/jats:italic>) on temporal networks. The performance of our algorithms is evaluated by the missing link prediction task in comparison with state-of-the-art static and temporal network embedding algorithms. Results show that<jats:italic>SINE<\/jats:italic>and<jats:italic>TSINE<\/jats:italic>outperform the baselines across all six empirical datasets. We further find that the performance of<jats:italic>SINE<\/jats:italic>is mostly better than<jats:italic>TSINE<\/jats:italic>, suggesting that temporal information does not necessarily improve the embedding for missing link prediction. Moreover, we study the effect of the sampling size, quantified as the total length of the trajectory paths, on the performance of the embedding algorithms. The better performance of<jats:italic>SINE<\/jats:italic>and<jats:italic>TSINE<\/jats:italic>requires a smaller sampling size in comparison with the baseline algorithms. Hence, SI-spreading-based embedding tends to be more applicable to large-scale networks.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-020-00248-5","type":"journal-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T13:07:18Z","timestamp":1603112838000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Susceptible-infected-spreading-based network embedding in static and temporal networks"],"prefix":"10.1140","volume":"9","author":[{"given":"Xiu-Xiu","family":"Zhan","sequence":"first","affiliation":[]},{"given":"Ziyu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Masuda","sequence":"additional","affiliation":[]},{"given":"Petter","family":"Holme","sequence":"additional","affiliation":[]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,16]]},"reference":[{"issue":"2","key":"248_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"248_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.07.002","volume":"651","author":"Z-K Zhang","year":"2016","unstructured":"Zhang Z-K, Liu C, Zhan X-X, Lu X, Zhang C-X, Zhang Y-C (2016) Dynamics of information diffusion and its applications on complex networks. Phys Rep 651:1\u201334","journal-title":"Phys Rep"},{"issue":"3","key":"248_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"LdF Costa","year":"2011","unstructured":"Costa LdF, Oliveira ON Jr, Travieso G, Rodrigues FA, Villas Boas PR, Antiqueira L, Viana MP, Correa Rocha LE (2011) Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv Phys 60(3):329\u2013412","journal-title":"Adv Phys"},{"issue":"3","key":"248_CR4","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/prot.20865","volume":"63","author":"Y Qi","year":"2006","unstructured":"Qi Y, Bar-Joseph Z, Klein-Seetharaman J (2006) Evaluation of different biological data and computational classification methods for use in protein interaction prediction. Proteins, Struct Funct Bioinform 63(3):490\u2013500","journal-title":"Proteins, Struct Funct Bioinform"},{"issue":"12","key":"248_CR5","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"key":"248_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/2556195.2556225","volume-title":"Proceedings of the 7th ACM international conference on web search and data mining","author":"Y Jacob","year":"2014","unstructured":"Jacob Y, Denoyer L, Gallinari P (2014) Learning latent representations of nodes for classifying in heterogeneous social networks. In: Proceedings of the 7th ACM international conference on web search and data mining. ACM, New York, pp\u00a0373\u2013382"},{"issue":"16","key":"248_CR7","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of Facebook networks. Phys A, Stat Mech Appl 391(16):4165\u20134180","journal-title":"Phys A, Stat Mech Appl"},{"issue":"2","key":"248_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.022801","volume":"88","author":"H Wang","year":"2013","unstructured":"Wang H, Li Q, D\u2019Agostino Gregorio, Havlin S, Stanley HE, Van Mieghem P (2013) Effect of the interconnected network structure on the epidemic threshold. Phys Rev E 88(2):022801","journal-title":"Phys Rev E"},{"issue":"7","key":"248_CR9","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 Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"6","key":"248_CR10","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A, Stat Mech Appl 390(6):1150\u20131170","journal-title":"Phys A, Stat Mech Appl"},{"issue":"1","key":"248_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2012.02.006","volume":"519","author":"L L\u00fc","year":"2012","unstructured":"L\u00fc L, Medo M, Yeung CH, Zhang Y-C, Zhang Z-K, Zhou T (2012) Recommender systems. Phys Rep 519(1):1\u201349","journal-title":"Phys Rep"},{"issue":"4","key":"248_CR12","doi-asserted-by":"publisher","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez V, Berzal F, Cubero J-C (2017) A survey of link prediction in complex networks. ACM Comput Surv 49(4):69","journal-title":"ACM Comput Surv"},{"key":"248_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2019.12.004","volume":"846","author":"C Liu","year":"2020","unstructured":"Liu C, Ma Y, Zhao J, Nussinov R, Zhang Y-C, Cheng F, Zhang Z-K (2020) Computational network biology: data, model, and applications. Phys Rep 846:1\u201366","journal-title":"Phys Rep"},{"issue":"2","key":"248_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1117454.1117456","volume":"7","author":"L Getoor","year":"2005","unstructured":"Getoor L, Diehl CP (2005) Link mining: a survey. ACM SIGKDD Explor Newsl 7(2):3\u201312","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"5","key":"248_CR15","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2019","unstructured":"Cui P, Wang X, Pei J, Zhu W (2019) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"248_CR16","volume-title":"Thirty-first AAAI conference on artificial intelligence","author":"X Wang","year":"2017","unstructured":"Wang X, Cui P, Wang J, Pei J, Zhu W, Yang S (2017) Community preserving network embedding. In: Thirty-first AAAI conference on artificial intelligence"},{"key":"248_CR17","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/3152494.3152512","volume-title":"Proceedings of the ACM India joint international conference on data science and management of data","author":"S Pandhre","year":"2018","unstructured":"Pandhre S, Mittal H, Gupta M, Balasubramanian VN (2018) Stwalk: learning trajectory representations in temporal graphs. In: Proceedings of the ACM India joint international conference on data science and management of data, pp\u00a0210\u2013219"},{"issue":"1","key":"248_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0169-5","volume":"4","author":"F B\u00e9res","year":"2019","unstructured":"B\u00e9res F, Kelen DM, P\u00e1lovics R, Bencz\u00far AA (2019) Node embeddings in dynamic graphs. Appl Netw Sci 4(1):64","journal-title":"Appl Netw Sci"},{"key":"248_CR19","unstructured":"Sato K, Oka M, Barrat A, Cattuto C (2019) Dyane: dynamics-aware node embedding for temporal networks. arXiv preprint. arXiv:1909.05976"},{"issue":"1","key":"248_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-63221-2","volume":"10","author":"M Torricelli","year":"2020","unstructured":"Torricelli M, Karsai M, Gauvin L (2020) weg2vec: event embedding for temporal networks. Sci Rep 10(1):1\u201311","journal-title":"Sci Rep"},{"issue":"5500","key":"248_CR21","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, De Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319\u20132323","journal-title":"Science"},{"issue":"5500","key":"248_CR22","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323\u20132326","journal-title":"Science"},{"key":"248_CR23","first-page":"585","volume-title":"Advances in neural information processing systems","author":"M Belkin","year":"2002","unstructured":"Belkin M, Niyogi P (2002) Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in neural information processing systems, pp\u00a0585\u2013591"},{"key":"248_CR24","doi-asserted-by":"crossref","unstructured":"Golub GH, Reinsch C (1971) Singular value decomposition and least squares solutions pp\u00a0134\u2013151","DOI":"10.1007\/978-3-662-39778-7_10"},{"key":"248_CR25","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/2623330.2623732","volume-title":"Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining","author":"B Perozzi","year":"2014","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. ACM, New York, pp\u00a0701\u2013710"},{"key":"248_CR26","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/2736277.2741093","volume-title":"Proceedings of the 24th international conference on world wide web","author":"J Tang","year":"2015","unstructured":"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, pp\u00a01067\u20131077. International World Wide Web Conferences Steering Committee"},{"key":"248_CR27","first-page":"3111","volume-title":"Advances in neural information processing systems","author":"T Mikolov","year":"2013","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems, pp\u00a03111\u20133119"},{"key":"248_CR28","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1145\/2939672.2939754","volume-title":"Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","author":"A Grover","year":"2016","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. ACM, New York, pp\u00a0855\u2013864"},{"key":"248_CR29","volume-title":"Proceedings of the 32nd AAAI conference on artificial intelligence (AAAI 2018)","author":"Z Cao","year":"2018","unstructured":"Cao Z, Wang L, de Melo G (2018) Link prediction via subgraph embedding-based convex matrix completion. In: Proceedings of the 32nd AAAI conference on artificial intelligence (AAAI 2018). AAAI Press, Menlo Park"},{"key":"248_CR30","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.future.2019.05.033","volume":"100","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Shi Z, Feng D, Zhan X-X (2019) Degree-biased random walk for large-scale network embedding. Future Gener Comput Syst 100:198\u2013209","journal-title":"Future Gener Comput Syst"},{"key":"248_CR31","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1145\/3184558.3191526","volume-title":"Companion of the web conference 2018 on the web conference 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. In: Companion of the web conference 2018 on the web conference 2018, pp\u00a0969\u2013976. International World Wide Web Conferences Steering Committee"},{"key":"248_CR32","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-57529-2_15","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"S Yuan","year":"2017","unstructured":"Yuan S, Wu X, Xiang Y (2017) Sne: signed network embedding. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, pp\u00a0183\u2013195"},{"key":"248_CR33","first-page":"119","volume-title":"International conference on complex networks and their applications","author":"A Bagavathi","year":"2018","unstructured":"Bagavathi A, Krishnan S (2018) Multi-net: a scalable multiplex network embedding framework. In: International conference on complex networks and their applications. Springer, Berlin, pp\u00a0119\u2013131"},{"issue":"3","key":"248_CR34","doi-asserted-by":"publisher","DOI":"10.1063\/1.5086059","volume":"29","author":"C Qu","year":"2019","unstructured":"Qu C, Zhan X-X, Wang G, Wu J, Zhang Z-K (2019) Temporal information gathering process for node ranking in time-varying networks. Chaos, Interdiscip J Nonlinear Sci 29(3):033116","journal-title":"Chaos, Interdiscip J Nonlinear Sci"},{"issue":"1","key":"248_CR35","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton J-F, Van den Broeck W (2011) What\u2019s in a crowd? Analysis of face-to-face behavioral networks. J Theor Biol 271(1):166\u2013180","journal-title":"J Theor Biol"},{"key":"248_CR36","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","volume-title":"International conference on business information systems","author":"R Michalski","year":"2011","unstructured":"Michalski R, Palus S, Kazienko P (2011) Matching organizational structure and social network extracted from email communication. In: International conference on business information systems. Springer, Berlin, pp\u00a0197\u2013206"},{"key":"248_CR37","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/TMC.2007.1060","volume":"6","author":"A Chaintreau","year":"2007","unstructured":"Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2007) Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans Mob Comput 6:606\u2013620","journal-title":"IEEE Trans Mob Comput"},{"issue":"2","key":"248_CR38","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159\u2013167","journal-title":"Soc Netw"},{"key":"248_CR39","unstructured":"DNC emails network dataset\u2014KONECT (2017) http:\/\/konect.uni-koblenz.de\/networks\/dnc-temporalGraph"},{"issue":"2","key":"248_CR40","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2):155\u2013163","journal-title":"Soc Netw"},{"key":"248_CR41","doi-asserted-by":"crossref","unstructured":"Singer U, Guy I, Radinsky K (2019) Node embedding over temporal graphs. arXiv preprint. arXiv:1903.08889","DOI":"10.24963\/ijcai.2019\/640"},{"key":"248_CR42","doi-asserted-by":"publisher","first-page":"2857","DOI":"10.1145\/3219819.3220054","volume-title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining","author":"Y Zuo","year":"2018","unstructured":"Zuo Y, Liu G, Lin H, Guo J, Hu X, Wu J (2018) Embedding temporal network via neighborhood formation. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. ACM, New York, pp\u00a02857\u20132866"},{"key":"248_CR43","volume-title":"Thirty-second AAAI conference on artificial intelligence","author":"L Zhou","year":"2018","unstructured":"Zhou L, Yang Y, Ren X, Wu F, Zhuang Y (2018) Dynamic network embedding by modeling triadic closure process. In: Thirty-second AAAI conference on artificial intelligence"},{"key":"248_CR44","first-page":"715","volume-title":"The 41st international ACM SIGIR conference on research & development in information retrieval","author":"M Gao","year":"2018","unstructured":"Gao M, Chen L, He X, Zhou A (2018) Bine: bipartite network embedding. In: The 41st international ACM SIGIR conference on research & development in information retrieval, pp\u00a0715\u2013724"},{"issue":"1","key":"248_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-09177-y","volume":"10","author":"IA Kov\u00e1cs","year":"2019","unstructured":"Kov\u00e1cs IA, Luck K, Spirohn K, Wang Y, Pollis C, Schlabach S, Bian W, Kim D-K, Kishore N, Hao T et al. (2019) Network-based prediction of protein interactions. Nat Commun 10(1):1\u20138","journal-title":"Nat Commun"},{"issue":"10","key":"248_CR46","doi-asserted-by":"publisher","DOI":"10.1063\/1.5120724","volume":"29","author":"R-M Cao","year":"2019","unstructured":"Cao R-M, Liu S-Y, Xu X-K (2019) Network embedding for link prediction: the pitfall and improvement. Chaos, Interdiscip J Nonlinear Sci 29(10):103102","journal-title":"Chaos, Interdiscip J Nonlinear Sci"},{"key":"248_CR47","first-page":"887","volume-title":"Advances in neural information processing systems","author":"Z Yin","year":"2018","unstructured":"Yin Z, Shen Y (2018) On the dimensionality of word embedding. In: Advances in neural information processing systems, pp\u00a0887\u2013898"},{"issue":"1","key":"248_CR48","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43029-5","volume":"9","author":"X-X Zhan","year":"2019","unstructured":"Zhan X-X, Hanjalic A, Wang H (2019) Information diffusion backbones in temporal networks. Sci Rep 9(1):6798","journal-title":"Sci Rep"},{"key":"248_CR49","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.amc.2018.03.050","volume":"332","author":"X-X Zhan","year":"2018","unstructured":"Zhan X-X, Liu C, Zhou G, Zhang Z-K, Sun G-Q, Zhu JJ, Jin Z (2018) Coupling dynamics of epidemic spreading and information diffusion on complex networks. Appl Math Comput 332:437\u2013448","journal-title":"Appl Math Comput"},{"key":"248_CR50","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/1.9781611974973.37","volume-title":"Proceedings of the 2017 SIAM international conference on data mining","author":"S Wang","year":"2017","unstructured":"Wang S, Tang J, Aggarwal C, Chang Y, Liu H (2017) Signed network embedding in social media. In: Proceedings of the 2017 SIAM international conference on data mining. SIAM, Philadelphia, pp\u00a0327\u2013335"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-020-00248-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-020-00248-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-020-00248-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T20:01:00Z","timestamp":1698264060000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-020-00248-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,16]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-020-00248-5","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,16]]},"assertion":[{"value":"15 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}