{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:41Z","timestamp":1740160301746,"version":"3.37.3"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Royal Academy of Engineering and the Office of the Chief Science Advisor for National Security"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Techniques for learning vectorial representations of graphs (<jats:italic>graph embeddings<\/jats:italic>) have recently emerged as an effective approach to facilitate machine learning on graphs. Some of the most popular methods involve sophisticated features such as graph kernels or convolutional networks. In this work, we introduce two straightforward supervised learning algorithms based on small-size graphlet counts, combined with a dimension reduction step. The first relies on a classic feature extraction method powered by principal component analysis (PCA). The second is a feature selection procedure also based on PCA. Despite their conceptual simplicity, these embeddings are arguably more meaningful than some popular alternatives and at the same time are competitive with state-of-the-art methods. We illustrate this second point on a downstream classification task. We then use our algorithms in a novel setting, namely to conduct an analysis of author relationships in Wikipedia articles, for which we present an original dataset. Finally, we provide empirical evidence suggesting that our methods could also be adapted to unsupervised learning algorithms.<\/jats:p>","DOI":"10.1007\/s13278-021-00846-9","type":"journal-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T10:03:33Z","timestamp":1639562613000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning network embeddings using small graphlets"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2666-0405","authenticated-orcid":false,"given":"Luce","family":"le Gorrec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip A.","family":"Knight","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Auguste","family":"Caen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"issue":"4","key":"846_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/wics.101","volume":"2","author":"H Abdi","year":"2010","unstructured":"Abdi H, Williams LJ (2010) Principal component analysis. Wiley Interdiscip Rev Comput Stat 2(4):433\u2013459","journal-title":"Wiley Interdiscip Rev Comput Stat"},{"key":"846_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed A, Shervashidze N, Narayanamurthy S, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: International conference on world wide web, pp 37\u201348","DOI":"10.1145\/2488388.2488393"},{"issue":"6","key":"846_CR3","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon U (2007) Network motifs: theory and experimental approaches. Nat Rev Genet 8(6):450\u2013461","journal-title":"Nat Rev Genet"},{"key":"846_CR4","unstructured":"Annamalai N, Mahinthan C, Rajasekar V, Lihui C, Yang L, Shantanu J (2017) graph2vec: learning distributed representations of graphs. In: International workshop on mining and learning with graphs"},{"issue":"5687","key":"846_CR5","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1126\/science.1099334","volume":"305","author":"Y Artzy-Randrup","year":"2004","unstructured":"Artzy-Randrup Y, Fleishman S, Ben-Tal N, Stone L (2004) Comment on network motifs: simple building blocks of complex networks and superfamilies of evolved and designed networks. Science 305(5687):1107\u20131107","journal-title":"Science"},{"key":"846_CR6","volume-title":"Logics of Conversation","author":"N Asher","year":"2003","unstructured":"Asher N, Lascarides A (2003) Logics of Conversation. Cambridge University Press, Cambridge"},{"key":"846_CR7","unstructured":"Asher N, Hunter J, Morey M, Benamara F, Afantenos S (2016) Discourse structure and dialogue acts in multiparty dialogue: the STAC corpus. In: LREC 2721\u20132727"},{"key":"846_CR8","unstructured":"Attardi G, Fuschetto A, Souza L, Caicedo JM, Pereira H, Gevatter S-A (2013) https:\/\/gist.github.com\/baojie\/5294784"},{"key":"846_CR9","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/. Accessed Mar 2020"},{"issue":"6295","key":"846_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"A Benson","year":"2016","unstructured":"Benson A, Gleich D, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"key":"846_CR11","unstructured":"Borgwardt KM, Kriegel H-P (2005) Shortest-path kernels on graphs. In: IEEE international conference on data mining, p 8"},{"key":"846_CR12","doi-asserted-by":"crossref","unstructured":"Borra E, Weltevrede E, Ciuccarelli P, Kaltenbrunner A, Laniado D, Magni G, Mauri M, Rogers R, Venturini T et al (2014) Contropedia-the analysis and visualization of controversies in wikipedia articles. In: OpenSym 34-1","DOI":"10.1145\/2641580.2641622"},{"issue":"1","key":"846_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"846_CR14","doi-asserted-by":"crossref","unstructured":"Brglez F, Bryan D, Kozminski K (1989) Combinational profiles of sequential benchmark circuits. In: IEEE international symposium on circuits and systems, pp 1929\u20131934","DOI":"10.1109\/ISCAS.1989.100747"},{"issue":"4","key":"846_CR15","doi-asserted-by":"publisher","first-page":"046119","DOI":"10.1103\/PhysRevE.64.046119","volume":"64","author":"IRF Cancho","year":"2001","unstructured":"Cancho IRF, Janssen C, Sol\u00e9 RV (2001) Topology of technology graphs: small world patterns in electronic circuits. Phys Rev E 64(4):046119","journal-title":"Phys Rev E"},{"key":"846_CR16","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: AAAI conference on artificial intelligence, pp 1145\u20131152","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"846_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14:210\u2013223","journal-title":"SIAM J Comput"},{"key":"846_CR18","unstructured":"Clauset A, Tucker E, Sainz M (2016) The Colorado index of complex networks. https:\/\/icon.colorado.edu\/. Accessed Feb 2020"},{"issue":"3","key":"846_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/54.867894","volume":"17","author":"F Corno","year":"2000","unstructured":"Corno F, Reorda MS, Squillero G (2000) RT-level ITC 99 benchmarks and first ATPG results. IEEE Des Test comput 17(3):44\u201353","journal-title":"IEEE Des Test comput"},{"issue":"2","key":"846_CR20","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"AK Debnath","year":"1991","unstructured":"Debnath AK, Lopez\u00a0de Compadre RL, Debnath G, Shusterman AJ, Hansch C (1991) Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity. J Med Chem 34(2):786\u2013797","journal-title":"J Med Chem"},{"key":"846_CR21","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"},{"issue":"6","key":"846_CR22","doi-asserted-by":"publisher","first-page":"e1001579","DOI":"10.1371\/journal.pbio.1001579","volume":"11","author":"J Dunne","year":"2013","unstructured":"Dunne J, Lafferty K, Dobson A, Hechinger R, Kuris A, Martinez N, McLaughlin EA (2013) Parasites affect food web structure primarily through increased diversity and complexity. PLoS Biol 11(6):e1001579","journal-title":"PLoS Biol"},{"key":"846_CR23","volume-title":"A first course in network theory","author":"E Estrada","year":"2015","unstructured":"Estrada E, Knight P (2015) A first course in network theory. Oxford University Press, Oxford"},{"key":"846_CR24","unstructured":"Felmlee D, McMillan C, Towsley D, Whitaker R (2018) Social network motifs: a comparison of building blocks across multiple social networks. In: Annual meetings of the ASA"},{"key":"846_CR25","unstructured":"Freeman LC (2020) http:\/\/moreno.ss.uci.edu\/data.html. Accessed Feb 2020. Out-of-date"},{"key":"846_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1140\/epjds\/s13688-016-0088-y","volume":"5","author":"F Gargiulo","year":"2016","unstructured":"Gargiulo F, Caen A, Lambiotte R, Carletti T (2016) The classical origin of modern mathematics. EPJ Data Sci 5:26","journal-title":"EPJ Data Sci"},{"key":"846_CR27","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner T, Flach P, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. In: Learning theory and kernel machines. Springer, pp 129\u2013143","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"846_CR28","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"846_CR29","unstructured":"Hamilton WL, Ying R, Leskovec J (2017a) Inductive representation learning on large graphs. In: Advances in neural information processing systems"},{"key":"846_CR30","unstructured":"Hamilton WL, Ying R, Leskovec J (2017b) Representation learning on graphs: methods and applications. In: IEEE data engineering bulletin"},{"key":"846_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.gde.2016.02.002","volume":"37","author":"B He","year":"2016","unstructured":"He B, Tan K (2016) Understanding transcriptional regulatory networks using computational models. Curr Opin Genet Dev 37:101\u2013108","journal-title":"Curr Opin Genet Dev"},{"key":"846_CR32","doi-asserted-by":"crossref","unstructured":"Head A, Eisenberg M (2010) How todays college students use wikipedia for course-related research. First Monday 15(3)","DOI":"10.5210\/fm.v15i3.2830"},{"key":"846_CR33","unstructured":"Jenihhin M (2020) http:\/\/pld.ttu.ee\/~maksim\/benchmarks\/iscas89\/bench\/. Accessed Feb 2020"},{"issue":"7","key":"846_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0068073","volume":"8","author":"S Khakabimamaghani","year":"2013","unstructured":"Khakabimamaghani S, Sharafuddin I, Dichter N, Koch I, Masoudi-Nejad A (2013) Quatexelero: an accelerated exact network motif detection algorithm. PLoS ONE 8(7):1\u201315","journal-title":"PLoS ONE"},{"key":"846_CR35","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning (Representations)"},{"key":"846_CR36","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80:016118","journal-title":"Phys Rev E"},{"key":"846_CR37","doi-asserted-by":"crossref","unstructured":"Lascarides A, Asher N (2007) Segmented discourse representation theory: dynamic semantics with discourse structure. Springer, pp 87\u2013124","DOI":"10.1007\/978-1-4020-5958-2_5"},{"key":"846_CR38","doi-asserted-by":"crossref","unstructured":"le\u00a0Gorrec L, Knight PA (2020) A simple embedding for classifying networks with a few graphlets. In: 2020 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE, pp 635\u2013642","DOI":"10.1109\/ASONAM49781.2020.9381337"},{"key":"846_CR39","doi-asserted-by":"crossref","unstructured":"le Gorrec L, Mouysset S, Duff IS, Knight PA, Ruiz D (2020) Uncovering hidden block structure for clustering. In: Machine learning and knowledge discovery in databases, pp 140\u2013155","DOI":"10.1007\/978-3-030-46150-8_9"},{"key":"846_CR40","doi-asserted-by":"crossref","unstructured":"le\u00a0Gorrec L, Knight PA, Caen A (2021) Supplementary material for embeddings of networks using small-size graphlets: comparisons and analysis. http:\/\/github.com\/luleg\/DiscriminantMotifs","DOI":"10.1007\/s13278-021-00846-9"},{"key":"846_CR41","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2011.12.006","volume":"426\u2013427","author":"MC Lin","year":"2012","unstructured":"Lin MC, Soulignac FJ, Szwarcfiter JL (2012) Arboricity, h-index, and dynamic algorithms. Theoret Comput Sci 426\u2013427:75\u201390","journal-title":"Theoret Comput Sci"},{"issue":"5","key":"846_CR42","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TCBB.2014.2321150","volume":"11","author":"LA Meira","year":"2014","unstructured":"Meira LA, M\u00e1ximo VR, Fazenda \u00c1L, Da Concei\u00e7\u00e3o AF (2014) Acc-motif: accelerated network motif detection. IEEE\/ACM Trans Comput Biol Bioinf 11(5):853\u2013862","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"846_CR43","doi-asserted-by":"crossref","unstructured":"Mesgar M, Strube M (2015) Graph-based coherence modeling for assessing readability. In: Joint conference on lexical and computational semantics, pp 309\u2013318","DOI":"10.18653\/v1\/S15-1036"},{"issue":"5594","key":"846_CR44","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"846_CR45","unstructured":"Milo R, Kashtan N, Itzkovitz S, Newman ME, Alon U (2003) On the uniform generation of random graphs with prescribed degree sequences"},{"issue":"5663","key":"846_CR46","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"key":"846_CR47","unstructured":"Niepert M, Ahmed M, Kutzkov K (2016) Learning convolutional neural networks for graphs. In: International conference on machine learning, pp 2014\u20132023"},{"issue":"4","key":"846_CR48","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1080\/19331680903577822","volume":"7","author":"A Oboler","year":"2010","unstructured":"Oboler A, Steinberg G, Stern R (2010) The framing of political NGOs in wikipedia through criticism elimination. J Inf Technol Polit 7(4):284\u2013299","journal-title":"J Inf Technol Polit"},{"key":"846_CR49","doi-asserted-by":"crossref","unstructured":"Ou M, Cui P, Pei J, Zhang Z, Zhu W (2016) Asymmetric transitivity preserving graph embedding. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 1105\u20131114","DOI":"10.1145\/2939672.2939751"},{"key":"846_CR50","unstructured":"Peng H, Li J, Gong Q, Wang S, Ning Y, Yu PS (2018) Graph convolutional neural networks via motif-based attention. arXiv:1811.08270"},{"key":"846_CR51","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"846_CR52","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro P, Silva F (2014) G-tries: a data structure for storing and finding subgraphs. Data Min Knowl Discov 28:337\u2013377","journal-title":"Data Min Knowl Discov"},{"key":"846_CR53","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"issue":"2","key":"846_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433652","volume":"54","author":"P Ribeiro","year":"2021","unstructured":"Ribeiro P, Paredes P, Silva ME, Aparicio D, Silva F (2021) A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Comput Surv (CSUR) 54(2):1\u201336","journal-title":"ACM Comput Surv (CSUR)"},{"key":"846_CR55","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Kiss O, Sarkar R (2020) Karate club: an API oriented open-source python framework for unsupervised learning on graphs. In: ACM international on conference on information and knowledge management","DOI":"10.1145\/3340531.3412757"},{"issue":"1","key":"846_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41597-019-0325-x","volume":"6","author":"P Sapiezynski","year":"2019","unstructured":"Sapiezynski P, Stopczynski A, David Dreyer L, Lehmann S (2019) Interaction data from the Copenhagen networks study. Sci Data 6(1):1\u201310","journal-title":"Sci Data"},{"key":"846_CR57","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":"846_CR58","unstructured":"Shervashidze N, Vishwanathan S, Petri T, Mehlhorn K, Borgwardt K (2009) Efficient graphlet kernels for large graph comparison. In: International conference on artificial intelligence and statistics, pp 488\u2013495"},{"issue":"9","key":"846_CR59","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze N, Schweitzer P, Van Leeuwen EJ, Mehlhorn K, Borgwardt KM (2011) Weisfeiler\u2013lehman graph kernels. J Mach Learn Res 12(9):2539\u20132561","journal-title":"J Mach Learn Res"},{"issue":"1621","key":"846_CR60","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1098\/rspb.2007.0571","volume":"274","author":"DB Stouffer","year":"2007","unstructured":"Stouffer DB, Camacho J, Jiang W, Nunes Amaral LA (2007) Evidence for the existence of a robust pattern of prey selection in food webs. Proc R Soc B Biol Sci 274(1621):1931\u20131940","journal-title":"Proc R Soc B Biol Sci"},{"key":"846_CR61","volume-title":"Machine learning: a Bayesian and optimization perspective","author":"s Theodoridis","year":"2015","unstructured":"Theodoridis s (2015) Machine learning: a Bayesian and optimization perspective. Academic Press, London"},{"issue":"3","key":"846_CR62","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/bib\/bbu021","volume":"16","author":"NTL Tran","year":"2015","unstructured":"Tran NTL, Mohan S, Xu Z, Huang C-H (2015) Current innovations and future challenges of network motif detection. Brief Bioinform 16(3):497\u2013525","journal-title":"Brief Bioinform"},{"key":"846_CR63","unstructured":"Tu K (2018) https:\/\/github.com\/kuntu\/JGraphlet-JMotif. Accessed June 2020"},{"key":"846_CR64","doi-asserted-by":"crossref","unstructured":"Tu K, Li J, Towsley D, Braines D, Turner LD (2019) Gl2vec: learning feature representation using graphlets for directed networks. In: IEEE\/ACM international conference on advances in social networks analysis and mining, pp 216\u2013221","DOI":"10.1145\/3341161.3342908"},{"issue":"1","key":"846_CR65","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1162\/jocn.1991.3.1.71","volume":"3","author":"M Turk","year":"1991","unstructured":"Turk M, Pentland A (1991) Eigenfaces for recognition. J Cogn Neurosci 3(1):71\u201386","journal-title":"J Cogn Neurosci"},{"key":"846_CR66","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks. In: International conference on learning (Representations)"},{"key":"846_CR67","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan SVN, Schraudolph NN, Kondor R, Borgwardt KM (2010) Graph kernels. J Mach Learn Res 11:1201\u20131242","journal-title":"J Mach Learn Res"},{"key":"846_CR68","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: ACM workshop on online social networks, pp 37\u201342","DOI":"10.1145\/1592665.1592675"},{"key":"846_CR69","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International conference on learning (Representations)"},{"issue":"6","key":"846_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0038869","volume":"7","author":"T Yasseri","year":"2012","unstructured":"Yasseri T, Sumi R, Rung A, Kornai A, Kert\u00e9sz J (2012) Dynamics of conflicts in wikipedia. PLoS ONE 7(6):1\u201312","journal-title":"PLoS ONE"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00846-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00846-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00846-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T13:41:03Z","timestamp":1672666863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00846-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["846"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00846-9","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2021,12,15]]},"assertion":[{"value":"14 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"20"}}