乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T15:23:22Z","timestamp":1709220202922},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["2022-0-00871","2019-0-00075"],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10618-023-00940-w","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T13:02:49Z","timestamp":1690376569000},"page":"2139-2191","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm"],"prefix":"10.1007","volume":"37","author":[{"given":"Fanchen","family":"Bu","sequence":"first","affiliation":[]},{"given":"Shinhwan","family":"Kang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"issue":"3","key":"940_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"issue":"3","key":"940_CR2","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s10618-020-00673-0","volume":"34","author":"F Adriaens","year":"2020","unstructured":"Adriaens F, De Bie T, Gionis A et al (2020) Relaxing the strong triadic closure problem for edge strength inference. Data Min Knowl Disc 34(3):611\u2013651","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"940_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-56847-4","volume":"10","author":"I Ahmad","year":"2020","unstructured":"Ahmad I, Akhtar MU, Noor S et al (2020) Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci Rep 10(1):1\u20139","journal-title":"Sci Rep"},{"issue":"2","key":"940_CR4","first-page":"221","volume":"3","author":"C Aicher","year":"2015","unstructured":"Aicher C, Jacobs AZ, Clauset A (2015) Learning latent block structure in weighted networks. J Comp Netw 3(2):221\u2013248","journal-title":"J Comp Netw"},{"issue":"3","key":"940_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/bib\/bbl022","volume":"7","author":"T Aittokallio","year":"2006","unstructured":"Aittokallio T, Schwikowski B (2006) Graph-based methods for analysing networks in cell biology. Brief Bioinform 7(3):243\u2013255","journal-title":"Brief Bioinform"},{"issue":"3","key":"940_CR6","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Min Knowl Disc 29(3):626\u2013688","journal-title":"Data Min Knowl Disc"},{"key":"940_CR7","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2008) Rtm: Laws and a recursive generator for weighted time-evolving graphs. In: ICDM","DOI":"10.1109\/ICDM.2008.123"},{"issue":"1","key":"940_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"issue":"6","key":"940_CR9","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.70.066149","volume":"70","author":"A Barrat","year":"2004","unstructured":"Barrat A, Barth\u00e9lemy M, Vespignani A (2004) Modeling the evolution of weighted networks. Phys. Rev. E 70(6):066149","journal-title":"Phys. Rev. E"},{"issue":"6295","key":"940_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J (2016) Higher-order organization of complex networks. Science 353(6295):163\u2013166","journal-title":"Science"},{"issue":"48","key":"940_CR10","doi-asserted-by":"crossref","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT et al (2018) Simplicial closure and higher-order link prediction. PNAS 115(48):E11221\u2013E11230","journal-title":"PNAS"},{"key":"940_CR12","unstructured":"Berlingerio M, Koutra D, Eliassi-Rad T, et\u00a0al (2012) Netsimile: A scalable approach to size-independent network similarity. arXiv:1209.2684"},{"issue":"5","key":"940_CR13","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry JW, Hendrickson B, LaViolette RA et al (2011) Tolerating the community detection resolution limit with edge weighting. Phys. Rev. E 83(5):056119","journal-title":"Phys. Rev. E"},{"key":"940_CR14","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R et al (2008) Fast unfolding of communities in large networks. J Stat Mech Theor Experiment 10:P10008","journal-title":"J Stat Mech Theor Experiment"},{"issue":"5","key":"940_CR15","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich P (1987) Power and centrality: a family of measures. Am J Sociol 92(5):1170\u20131182","journal-title":"Am J Sociol"},{"issue":"1","key":"940_CR16","doi-asserted-by":"crossref","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":"940_CR17","unstructured":"Bu F, Kang S, Shin K (2022) Code, datasets, and online appendix. https:\/\/github.com\/bokveizen\/topology-edge-weight-interplay"},{"key":"940_CR18","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) Grarep: Learning graph representations with global structural information. In: CIKM","DOI":"10.1145\/2806416.2806512"},{"key":"940_CR19","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti D, Faloutsos C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv (CSUR). https:\/\/doi.org\/10.1145\/1132952.1132954","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"940_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/714000425","volume":"14","author":"F Cleaver","year":"2002","unstructured":"Cleaver F (2002) Reinventing institutions: bricolage and the social embeddedness of natural resource management. Eur J Develop Res 14(2):11\u201330","journal-title":"Eur J Develop Res"},{"issue":"5","key":"940_CR21","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1068\/b32128","volume":"34","author":"A De Montis","year":"2007","unstructured":"De Montis A, Barth\u00e9lemy M, Chessa A et al (2007) The structure of interurban traffic: a weighted network analysis. Environ Plann B Plann Des 34(5):905\u2013924","journal-title":"Environ Plann B Plann Des"},{"key":"940_CR22","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with pytorch geometric. arXiv preprint arXiv:1903.02428"},{"key":"940_CR23","doi-asserted-by":"crossref","unstructured":"Fire M, Tenenboim L, Lesser O, et\u00a0al (2011) Link prediction in social networks using computationally efficient topological features. In: PASSAT\/SocialCom","DOI":"10.1109\/PASSAT\/SocialCom.2011.20"},{"issue":"3\u20135","key":"940_CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"940_CR25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"8","key":"940_CR26","first-page":"1507","volume":"30","author":"C Fu","year":"2018","unstructured":"Fu C, Zhao M, Fan L et al (2018) Link weight prediction using supervised learning methods and its application to yelp layered network. TKDE 30(8):1507\u20131518","journal-title":"TKDE"},{"issue":"3","key":"940_CR27","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02289132","volume":"21","author":"WR Garner","year":"1956","unstructured":"Garner WR, McGill WJ (1956) The relation between information and variance analyses. Psychometrika 21(3):219\u2013228","journal-title":"Psychometrika"},{"issue":"12","key":"940_CR28","doi-asserted-by":"crossref","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. PNAS 99(12):7821\u20137826","journal-title":"PNAS"},{"key":"940_CR29","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: KDD","DOI":"10.1145\/2939672.2939754"},{"key":"940_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10618-015-0407-0","volume":"30","author":"I Gunes","year":"2016","unstructured":"Gunes I, Gunduz-Oguducu S, Cataltepe Z (2016) Link prediction using time series of neighborhood-based node similarity scores. Data Min Knowl Discov 30:147\u2013180","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"940_CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02854581","volume":"9","author":"F Harary","year":"1960","unstructured":"Harary F, Norman RZ (1960) Some properties of line digraphs. Rendiconti del circolo matematico di palermo 9(2):161\u2013168","journal-title":"Rendiconti del circolo matematico di palermo"},{"issue":"1","key":"940_CR32","doi-asserted-by":"crossref","first-page":"20304","DOI":"10.1038\/s41598-021-99175-2","volume":"11","author":"Z He","year":"2021","unstructured":"He Z, Chen W, Wei X et al (2021) On the statistical significance of communities from weighted graphs. Sci Rep 11(1):20304","journal-title":"Sci Rep"},{"issue":"23\u201324","key":"940_CR33","doi-asserted-by":"crossref","first-page":"4577","DOI":"10.1016\/j.physa.2011.06.052","volume":"390","author":"LS Heath","year":"2011","unstructured":"Heath LS, Parikh N (2011) Generating random graphs with tunable clustering coefficients. Physica A 390(23\u201324):4577\u20134587","journal-title":"Physica A"},{"key":"940_CR34","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2003) Scaling personalized web search. In: TheWebConf (WWW)","DOI":"10.1145\/775152.775191"},{"issue":"3","key":"940_CR35","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1007\/s10586-021-03511-0","volume":"25","author":"B K\u0131l\u0131\u00e7","year":"2022","unstructured":"K\u0131l\u0131\u00e7 B, \u00d6zturan C, \u015een A (2022) Parallel analysis of ethereum blockchain transaction data using cluster computing. Clust Comput 25(3):1885\u20131898","journal-title":"Clust Comput"},{"key":"940_CR36","doi-asserted-by":"crossref","unstructured":"K\u0131l\u0131\u00e7 B, \u00d6zturan C, \u015een A (2022a) Analyzing large-scale blockchain transaction graphs for fraudulent activities. In: Big Data and Artificial Intelligence in Digital Finance. Springer, p 253\u2013267","DOI":"10.1007\/978-3-030-94590-9_14"},{"key":"940_CR37","doi-asserted-by":"crossref","unstructured":"Kumar R, Liu P, Charikar M, et\u00a0al (2020) Retrieving top weighted triangles in graphs. In: WSDM","DOI":"10.1145\/3336191.3371823"},{"key":"940_CR38","doi-asserted-by":"crossref","unstructured":"Kumar S, Spezzano F, Subrahmanian V, et\u00a0al (2016) Edge weight prediction in weighted signed networks. In: ICDM","DOI":"10.1109\/ICDM.2016.0033"},{"issue":"2","key":"940_CR39","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E 73(2):026120","journal-title":"Phys Rev E"},{"key":"940_CR40","doi-asserted-by":"crossref","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, et\u00a0al (2005) Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: ECML PKDD","DOI":"10.1007\/11564126_17"},{"issue":"5323","key":"940_CR41","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1038\/234034a0","volume":"234","author":"M Levandowsky","year":"1971","unstructured":"Levandowsky M, Winter D (1971) Distance between sets. Nature 234(5323):34\u201335","journal-title":"Nature"},{"issue":"4","key":"940_CR42","doi-asserted-by":"crossref","first-page":"48007","DOI":"10.1209\/0295-5075\/96\/48007","volume":"96","author":"Z Liu","year":"2011","unstructured":"Liu Z, Zhang QM, L\u00fc L et al (2011) Link prediction in complex networks: a local na\u00efve bayes model. EPL 96(4):48007","journal-title":"EPL"},{"key":"940_CR43","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.procs.2014.05.248","volume":"31","author":"R Liu","year":"2014","unstructured":"Liu R, Feng S, Shi R et al (2014) Weighted graph clustering for community detection of large social networks. Procedia Comput Sci 31:85\u201394","journal-title":"Procedia Comput Sci"},{"key":"940_CR44","doi-asserted-by":"crossref","unstructured":"Liu J, Shang M, Chen D (2009) Personal recommendation based on weighted bipartite networks. In: FSKD","DOI":"10.1109\/FSKD.2009.469"},{"issue":"4","key":"940_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez V, Berzal F, Cubero JC (2016) A survey of link prediction in complex networks. CSUR 49(4):1\u201333","journal-title":"CSUR"},{"key":"940_CR46","doi-asserted-by":"crossref","unstructured":"McGlohon M, Akoglu L, Faloutsos C (2008) Weighted graphs and disconnected components: patterns and a generator. In: KDD","DOI":"10.1145\/1401890.1401955"},{"issue":"5","key":"940_CR47","volume":"70","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Analysis of weighted networks. Phys Rev E 70(5):056131","journal-title":"Phys Rev E"},{"key":"940_CR48","unstructured":"Opsahl T (2011) Why anchorage is not (that) important: Binary ties and sample selection. https:\/\/toreopsahl.com\/2011\/08\/12\/why-anchorage-is-not-that-important-binary-ties-and-sample-selection\/"},{"issue":"2","key":"940_CR49","doi-asserted-by":"crossref","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":"940_CR50","volume-title":"The pagerank citation ranking: Bringing order to the web","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R et al (1999) The pagerank citation ranking: Bringing order to the web. Stanford InfoLab, California"},{"key":"940_CR51","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: WSDM","DOI":"10.1145\/3018661.3018731"},{"key":"940_CR52","unstructured":"Pei H, Wei B, Chang KCC, et\u00a0al (2020) Geom-gcn: Geometric graph convolutional networks. In: ICLR"},{"issue":"5586","key":"940_CR53","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E Ravasz","year":"2002","unstructured":"Ravasz E, Somera AL, Mongru DA et al (2002) Hierarchical organization of modularity in metabolic networks. Science 297(5586):1551\u20131555","journal-title":"Science"},{"key":"940_CR54","doi-asserted-by":"crossref","unstructured":"Rotabi R, Kamath K, Kleinberg J, et\u00a0al (2017) Detecting strong ties using network motifs. In: Proceedings of the 26th international conference on world wide web companion","DOI":"10.1145\/3041021.3055139"},{"key":"940_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: CIKM","DOI":"10.1145\/3340531.3412757"},{"key":"940_CR56","volume-title":"Introduction to modern information retrieval","author":"G Salton","year":"1983","unstructured":"Salton G, McGill MJ (1983) Introduction to modern information retrieval. McGraw-Hill, New York"},{"key":"940_CR57","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri SV, Sariyuce AE, Tirthapura S (2018) Butterfly counting in bipartite networks. In: KDD","DOI":"10.1145\/3219819.3220097"},{"key":"940_CR58","doi-asserted-by":"crossref","unstructured":"Satuluri V, Parthasarathy S, Ruan Y (2011) Local graph sparsification for scalable clustering. SIGMOD","DOI":"10.1145\/1989323.1989399"},{"issue":"3","key":"940_CR59","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"issue":"3","key":"940_CR60","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M et al (2008) Collective classification in network data. AI Mag 29(3):93\u201393","journal-title":"AI Mag"},{"key":"940_CR61","unstructured":"Shchur O, Mumme M, Bojchevski A, et\u00a0al (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868"},{"issue":"2","key":"940_CR62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3375392","volume":"14","author":"K Shin","year":"2020","unstructured":"Shin K, Oh S, Kim J et al (2020) Fast, accurate and provable triangle counting in fully dynamic graph streams. TKDD 14(2):1\u201339","journal-title":"TKDD"},{"key":"940_CR63","doi-asserted-by":"crossref","unstructured":"Shuai HH, Yang DN, Philip SY, et\u00a0al (2013) On pattern preserving graph generation. In: ICDM","DOI":"10.1109\/ICDM.2013.14"},{"key":"940_CR64","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, et\u00a0al (2015) An overview of microsoft academic service (mas) and applications. In: TheWebConf (WWW)","DOI":"10.1145\/2740908.2742839"},{"key":"940_CR65","doi-asserted-by":"crossref","unstructured":"Sintos S, Tsaparas P (2014) Using strong triadic closure to characterize ties in social networks. In: KDD","DOI":"10.1145\/2623330.2623664"},{"key":"940_CR66","doi-asserted-by":"crossref","unstructured":"Skarkala ME, Maragoudakis M, Gritzalis S, et\u00a0al (2012) Privacy preservation by k-anonymization of weighted social networks. In: ASONAM","DOI":"10.1109\/ASONAM.2012.75"},{"issue":"4","key":"940_CR67","first-page":"1","volume":"5","author":"TA Sorensen","year":"1948","unstructured":"Sorensen TA (1948) A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on danish commons. Biologiske Skrifter 5(4):1\u201334","journal-title":"Biologiske Skrifter"},{"key":"940_CR68","doi-asserted-by":"crossref","unstructured":"Starnini M, Lepri B, Baronchelli A, et\u00a0al (2017) Robust modeling of human contact networks across different scales and proximity-sensing techniques. In: SocInfo 2017","DOI":"10.1007\/978-3-319-67217-5_32"},{"key":"940_CR69","unstructured":"Steinhaeuser K, Chawla NV (2008) Community detection in a large real-world social network. In: Social computing, behavioral modeling, and prediction"},{"issue":"3","key":"940_CR70","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1214\/aoms\/1177728730","volume":"25","author":"RF Tate","year":"1954","unstructured":"Tate RF (1954) Correlation between a discrete and a continuous variable point-biserial correlation. Ann Math Stat 25(3):603\u2013607","journal-title":"Ann Math Stat"},{"key":"940_CR71","doi-asserted-by":"crossref","unstructured":"Thottan M, Liu G, Ji C (2010) Anomaly detection approaches for communication networks. In: Algorithms for next generation networks","DOI":"10.1007\/978-1-84882-765-3_11"},{"key":"940_CR72","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: Algorithms and laws. In: ICDM","DOI":"10.1109\/ICDM.2008.72"},{"key":"940_CR73","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Pachocki J, Mitzenmacher M (2017) Scalable motif-aware graph clustering. In: TheWebConf (WWW)","DOI":"10.1145\/3038912.3052653"},{"issue":"1","key":"940_CR74","first-page":"1","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B, Wu Y et al (2015) Link prediction in social networks: the state-of-the-art. Sci China Inf Sci 58(1):1\u201338","journal-title":"Sci China Inf Sci"},{"issue":"6684","key":"940_CR75","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"issue":"2","key":"940_CR76","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0228728","volume":"15","author":"P Wills","year":"2020","unstructured":"Wills P, Meyer FG (2020) Metrics for graph comparison: a practitioner\u2019s guide. Plos one 15(2):e0228728","journal-title":"Plos one"},{"issue":"1","key":"940_CR77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s42005-020-00504-0","volume":"4","author":"R Yang","year":"2021","unstructured":"Yang R, Sala F, Bogdan P (2021) Hidden network generating rules from partially observed complex networks. Commun Phys 4(1):1\u201312","journal-title":"Commun Phys"},{"key":"940_CR78","doi-asserted-by":"crossref","unstructured":"Zhang Z, Cui P, Li H, et\u00a0al (2018) Billion-scale network embedding with iterative random projection. In: ICDM","DOI":"10.1109\/ICDM.2018.00094"},{"issue":"1","key":"940_CR79","first-page":"1","volume":"5","author":"J Zhao","year":"2015","unstructured":"Zhao J, Miao L, Yang J et al (2015) Prediction of links and weights in networks by reliable routes. Sci Rep 5(1):1\u201315","journal-title":"Sci Rep"},{"issue":"4","key":"940_CR80","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang YC (2009) Predicting missing links via local information. Eur Phys J B 71(4):623\u2013630","journal-title":"Eur Phys J B"},{"issue":"2","key":"940_CR81","volume":"11","author":"B Zhu","year":"2016","unstructured":"Zhu B, Xia Y (2016) Link prediction in weighted networks: a weighted mutual information model. PloS one 11(2):e0148265","journal-title":"PloS one"},{"issue":"1","key":"940_CR82","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0001-8","volume":"6","author":"B Zhu","year":"2016","unstructured":"Zhu B, Xia Y, Zhang XJ (2016) Weight prediction in complex networks based on neighbor set. Sci Rep 6(1):1\u201310","journal-title":"Sci Rep"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00940-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-023-00940-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-023-00940-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T09:22:13Z","timestamp":1697188933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-023-00940-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":82,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["940"],"URL":"https:\/\/doi.org\/10.1007\/s10618-023-00940-w","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,26]]},"assertion":[{"value":"24 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2023","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}