{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:46:14Z","timestamp":1753875974348,"version":"3.41.2"},"reference-count":58,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T00:00:00Z","timestamp":1677110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Engineering and Physical Sciences Research Council Manchester Centre","award":["EP\/I028099\/1"],"award-info":[{"award-number":["EP\/I028099\/1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,2,23]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network comparison is a widely used tool for analysing complex systems, with applications in varied domains including comparison of protein interactions or highlighting changes in structure of trade networks. In recent years, a number of network comparison methodologies based on the distribution of graphlets (small connected network subgraphs) have been introduced. In particular, NetEmd has recently achieved state of the art performance in undirected networks. In this work, we propose an extension of NetEmd to directed networks and deal with the significant increase in complexity of graphlet structure in the directed case by denoising through linear projections. Simulation results show that our framework is able to improve on the performance of a simple translation of the undirected NetEmd algorithm to the directed case, especially when networks differ in size and density.<\/jats:p>","DOI":"10.1093\/comnet\/cnad006","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T06:04:37Z","timestamp":1677823477000},"source":"Crossref","is-referenced-by-count":2,"title":["Comparing directed networks via denoising graphlet distributions"],"prefix":"10.1093","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4893-5625","authenticated-orcid":false,"given":"Miguel E P","family":"Silva","sequence":"first","affiliation":[{"name":"University of Manchester Department of Computer Science, , Manchester, M13 9L, UK"}]},{"given":"Robert E","family":"Gaunt","sequence":"additional","affiliation":[{"name":"University of Manchester Department of Mathematics, , Manchester, M13 9L, UK"}]},{"given":"Luis","family":"Ospina-Forero","sequence":"additional","affiliation":[{"name":"University of Manchester The Alliance Manchester Business School, , Manchester, M13 9L, UK"}]},{"given":"Caroline","family":"Jay","sequence":"additional","affiliation":[{"name":"University of Manchester Department of Computer Science, , Manchester, M13 9L, UK"}]},{"given":"Thomas","family":"House","sequence":"additional","affiliation":[{"name":"University of Manchester Department of Mathematics, , Manchester, M13 9L, UK"}]}],"member":"286","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"2023030306043044800_","first-page":"151","article-title":"The complexity of theorem-proving procedures","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing","author":"Cook,","year":"1971"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"i430","DOI":"10.1093\/bioinformatics\/btu447","article-title":"Alignment-free protein interaction network comparison","volume":"30","author":"Ali,","year":"2014","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1109\/TCBB.2016.2586046","article-title":"Extending the applicability of graphlets to directed networks","volume":"14","author":"Apar\u00edcio,","year":"2016","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep35098","article-title":"Graphlet-based characterization of directed networks","volume":"6","author":"Sarajli\u0107,","year":"2016","journal-title":"Sci. Rep."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-53708-y","article-title":"Comparing methods for comparing networks","volume":"9","author":"Tantardini,","year":"2019","journal-title":"Sci. Rep."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1093\/comnet\/cny003","article-title":"Identifying networks with common organizational principles","volume":"6","author":"Wegner,","year":"2018","journal-title":"J. Complex Netw."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep04547","article-title":"Revealing the hidden language of complex networks","volume":"4","author":"Yavero\u011flu,","year":"2014","journal-title":"Sci. Rep."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-30831-w","article-title":"From homogeneous to heterogeneous network alignment via colored graphlets","volume":"8","author":"Gu,","year":"2018","journal-title":"Sci. Rep."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","article-title":"Topological network alignment uncovers biological function and phylogeny","volume":"7","author":"Kuchaiev,","year":"2010","journal-title":"J. R. Soc. Interface"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1093\/bioinformatics\/btx090","article-title":"SANA: simulated annealing far outperforms many other search algorithms for biological network alignment","volume":"33","author":"Mamano,","year":"2017","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10115-016-0965-5","article-title":"Graphlet decomposition: framework, algorithms, and applications","volume":"50","author":"Ahmed,","year":"2017","journal-title":"Knowl. Inform. Syst."},{"key":"2023030306043044800_","first-page":"162","article-title":"Deltacon: a principled massive-graph similarity function","volume-title":"Proceedings of the 2013 SIAM International Conference on Data Mining","author":"Koutra,","year":"2013"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1126\/science.1089167","article-title":"Superfamilies of evolved and designed networks","volume":"303","author":"Milo,","year":"2004","journal-title":"Science"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.86.036104","article-title":"Taxonomies of networks from community structure","volume":"86","author":"Onnela,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","article-title":"Biological network comparison using graphlet degree distribution","volume":"23","author":"Pr\u017eulj,","year":"2007","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","first-page":"2539","article-title":"Weisfeiler\u2013Lehman graph kernels","volume":"12","author":"Shervashidze,","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"2023030306043044800_","first-page":"590","article-title":"Triad-based comparison and signatures of directed networks","volume-title":"International Conference on Complex Networks and their Applications","author":"Xu,","year":"2018"},{"journal-title":"The Structure and Dynamics of Networks","author":"Newman,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","article-title":"Modeling interactome: scale-free or geometric?","volume":"20","author":"Pr\u017eulj,","year":"2004","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"026112","DOI":"10.1103\/PhysRevE.67.026112","article-title":"Hierarchical organization in complex networks","volume":"67","author":"Ravasz,","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1080\/15427951.2005.10129111","article-title":"Towards a theory of scale-free graphs: definition, properties, and implications","volume":"2","author":"Li,","year":"2005","journal-title":"Internet Math."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary,","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","article-title":"Defining and evaluating network communities based on ground-truth","volume":"42","author":"Yang,","year":"2015","journal-title":"Knowl. Inform. Syst."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","article-title":"Analysis of a complex of statistical variables into principal components","volume":"24","author":"Hotelling,","year":"1933","journal-title":"J. Educ. Psychol."},{"article-title":"A tutorial on principal component analysis","year":"2014","author":"Shlens,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si,","year":"1999","journal-title":"Science"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1038\/s41467-019-08746-5","article-title":"Scale-free networks are rare","volume":"10","author":"Broido,","year":"2019","journal-title":"Nat. Commun."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0165-1684(94)90029-9","article-title":"Independent component analysis, a new concept?","volume":"36","author":"Comon,","year":"1994","journal-title":"Signal Process."},{"volume-title":"Information Theory, Inference and Learning Algorithms","year":"2003","author":"MacKay,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"2697","DOI":"10.1093\/bioinformatics\/btv170","article-title":"Proper evaluation of alignment-free network comparison methods","volume":"31","author":"Yavero\u011flu,","year":"2015","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3433652","article-title":"A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets","volume":"54","author":"Ribeiro,","year":"2021","journal-title":"ACM Computing Surveys"},{"key":"2023030306043044800_","first-page":"59","article-title":"A metric for distributions with applications to image databases","volume-title":"Sixth International Conference on Computer Vision","author":"Rubner,","year":"1998"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","article-title":"A combinatorial approach to graphlet counting","volume":"30","author":"Ho\u010devar,","year":"2014","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","article-title":"G-tries: a data structure for storing and finding subgraphs","volume":"28","author":"Ribeiro,","year":"2014","journal-title":"Data Mining Knowl. Discov."},{"article-title":"GTScanner - quick discovery of network motifs","year":"2017","author":"Ribeiro,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","article-title":"Reducing the dimensionality of data with neural networks","volume":"313","author":"Hinton,","year":"2006","journal-title":"Science"},{"volume-title":"Principal Component Analysis","author":"Jolliffe,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018647011077","article-title":"The fixed-point algorithm and maximum likelihood estimation for independent component analysis","volume":"10","author":"Hyv\u00e4rinen,","year":"1999","journal-title":"Neural Process. Lett."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/S0893-6080(00)00026-5","article-title":"Independent component analysis: algorithms and applications","volume":"13","author":"Hyv\u00e4rinen,","year":"2000","journal-title":"Neural Netw."},{"key":"2023030306043044800_","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s,","year":"1960","journal-title":"Public. Math. Inst. Hungar. Acad. Sci."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0109045","article-title":"Random plane networks","volume":"9","author":"Gilbert,","year":"1961","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1093\/bioinformatics\/btn079","article-title":"Fitting a geometric graph to a protein\u2013protein interaction network","volume":"24","author":"Higham,","year":"2008","journal-title":"Bioinformatics"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1159\/000067642","article-title":"Modeling of protein interaction networks","volume":"1","author":"V\u00e1zquez,","year":"2003","journal-title":"Complexus"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"061911","DOI":"10.1103\/PhysRevE.71.061911","article-title":"Duplication-divergence model of protein interaction network","volume":"71","author":"Ispolatov,","year":"2005","journal-title":"Phys. Rev. E"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts,","year":"1998","journal-title":"Nature"},{"article-title":"SNAP datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec,","key":"2023030306043044800_"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: densification and shrinking diameters","volume":"1","author":"Leskovec,","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"2023030306043044800_","first-page":"85","article-title":"Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems","volume-title":"Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science","author":"Ripeanu,","year":"2002"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1081870.1081893","article-title":"Graphs over time: densification laws, shrinking diameters and possible explanations","volume-title":"Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining","author":"Leskovec,","year":"2005"},{"key":"2023030306043044800_","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume":"2012","author":"McAuley,","year":"2012","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"2023030306043044800_","first-page":"460","article-title":"Nonlinear ICA of temporally dependent stationary sources","volume-title":"Artificial Intelligence and Statistics","author":"Hyvarinen,","year":"2017"},{"key":"2023030306043044800_","first-page":"859","article-title":"Nonlinear ICA using auxiliary variables and generalized contrastive learning","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Hyvarinen,","year":"2019"},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/aic.690370209","article-title":"Nonlinear principal component analysis using autoassociative neural networks","volume":"37","author":"Kramer,","year":"1991","journal-title":"AIChE J."},{"article-title":"Auto-encoding variational Bayes","year":"2013","author":"Kingma,","key":"2023030306043044800_"},{"article-title":"Variational graph auto-encoders","year":"2016","author":"Kipf,","key":"2023030306043044800_"},{"key":"2023030306043044800_","first-page":"2825","article-title":"Scikit-learn: machine learning in Python","volume":"12","author":"Pedregosa,","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert,","year":"1985","journal-title":"J. Class."},{"key":"2023030306043044800_","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand,","year":"1971","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/2\/cnad006\/49405830\/cnad006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/2\/cnad006\/49405830\/cnad006.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T11:15:11Z","timestamp":1679742911000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnad006\/7067913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,23]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2,23]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnad006","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2023,4,1]]},"published":{"date-parts":[[2023,2,23]]},"article-number":"cnad006"}}