{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T01:25:54Z","timestamp":1784769954415,"version":"3.55.0"},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:00:00Z","timestamp":1683158400000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Summary<\/jats:title>\n                  <jats:p>Heterogeneous knowledge graphs (KGs) have enabled the modeling of complex systems, from genetic interaction graphs and protein-protein interaction networks to networks representing drugs, diseases, proteins, and side effects. Analytical methods for KGs rely on quantifying similarities between entities, such as nodes, in the graph. However, such methods must consider the diversity of node and edge types contained within the KG via, for example, defined sequences of entity types known as meta-paths. We present metapaths, the first R software package to implement meta-paths and perform meta-path-based similarity search in heterogeneous KGs. The metapaths package offers various built-in similarity metrics for node pair comparison by querying KGs represented as either edge or adjacency lists, as well as auxiliary aggregation methods to measure set-level relationships. Indeed, evaluation of these methods on an open-source biomedical KG recovered meaningful drug and disease-associated relationships, including those in Alzheimer\u2019s disease. The metapaths framework facilitates the scalable and flexible modeling of network similarities in KGs with applications across KG learning.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>The metapaths R package is available via GitHub at https:\/\/github.com\/ayushnoori\/metapaths and is released under MPL 2.0 (Zenodo DOI: 10.5281\/zenodo.7047209). Package documentation and usage examples are available at https:\/\/www.ayushnoori.com\/metapaths.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btad297","type":"journal-article","created":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T14:37:39Z","timestamp":1683211059000},"source":"Crossref","is-referenced-by-count":8,"title":["<tt>Metapaths<\/tt>: similarity search in heterogeneous knowledge graphs via meta-paths"],"prefix":"10.1093","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1420-1236","authenticated-orcid":false,"given":"Ayush","family":"Noori","sequence":"first","affiliation":[{"name":"Harvard College , Cambridge, MA 02138, United States"},{"name":"Department of Biomedical Informatics, Harvard Medical School , Boston, MA 02115, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0223-7485","authenticated-orcid":false,"given":"Michelle M","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Biomedical Informatics, Harvard Medical School , Boston, MA 02115, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amelia L M","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Biomedical Informatics, Harvard Medical School , Boston, MA 02115, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8530-7228","authenticated-orcid":false,"given":"Marinka","family":"Zitnik","sequence":"additional","affiliation":[{"name":"Department of Biomedical Informatics, Harvard Medical School , Boston, MA 02115, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"key":"2023052504595820300_btad297-B1","first-page":"8017","volume-title":"Advances in Neural Information Processing Systems","author":"Alsentzer","year":"2020"},{"key":"2023052504595820300_btad297-B2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1186\/s12859-016-1005-x","article-title":"Predicting drug target interactions using meta-path-based semantic network analysis","volume":"17","author":"Fu","year":"2016","journal-title":"BMC Bioinformatics"},{"key":"2023052504595820300_btad297-B3","doi-asserted-by":"crossref","first-page":"e1004259","DOI":"10.1371\/journal.pcbi.1004259","article-title":"Heterogeneous network edge prediction: a data integration approach to prioritize disease-associated genes","volume":"11","author":"Himmelstein","year":"2015","journal-title":"PLoS Comput Biol"},{"key":"2023052504595820300_btad297-B4","doi-asserted-by":"crossref","first-page":"e26726","DOI":"10.7554\/eLife.26726","article-title":"Systematic integration of biomedical knowledge prioritizes drugs for repurposing","volume":"6","author":"Himmelstein","year":"2017","journal-title":"eLife"},{"key":"2023052504595820300_btad297-B5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3447772","article-title":"Knowledge graphs","volume":"54","author":"Hogan","year":"2022","journal-title":"ACM Comput Surv"},{"key":"2023052504595820300_btad297-B6","first-page":"22118","volume-title":"Advances in Neural Information Processing Systems","author":"Hu","year":"2020"},{"key":"2023052504595820300_btad297-B7","doi-asserted-by":"crossref","first-page":"4206","DOI":"10.1609\/aaai.v35i5.16544","article-title":"GraphMSE: efficient meta-path selection in semantically aligned feature space for graph neural networks","volume":"35","author":"Li","year":"2021","journal-title":"AAAI"},{"key":"2023052504595820300_btad297-B8","first-page":"121","author":"Sun","year":"2011"},{"key":"2023052504595820300_btad297-B9","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","article-title":"PathSim: meta path-based top-K similarity search in heterogeneous information networks","volume":"4","author":"Sun","year":"2011","journal-title":"Proc VLDB Endow"},{"key":"2023052504595820300_btad297-B10","doi-asserted-by":"crossref","first-page":"6094","DOI":"10.1609\/aaai.v34i04.6073","article-title":"Reinforcement learning based meta-path discovery in large-scale heterogeneous information networks","volume":"34","author":"Wan","year":"2020","journal-title":"AAAI"},{"key":"2023052504595820300_btad297-B11","first-page":"2022","author":"Wang","year":"2019"},{"key":"2023052504595820300_btad297-B12","doi-asserted-by":"crossref","first-page":"5556","DOI":"10.1038\/s41467-021-25725-x","article-title":"Leveraging the cell ontology to classify unseen cell types","volume":"12","author":"Wang","year":"2021","journal-title":"Nat Commun"},{"key":"2023052504595820300_btad297-B13","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1007\/s10618-018-0581-y","article-title":"Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks","volume":"32","author":"Wang","year":"2018","journal-title":"Data Min Knowl Disc"},{"key":"2023052504595820300_btad297-B14","first-page":"793","author":"Zhang","year":"2019"},{"key":"2023052504595820300_btad297-B15","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1186\/s12859-020-03765-2","article-title":"Predicting MiRNA-disease associations by multiple meta-paths fusion graph embedding model","volume":"21","author":"Zhang","year":"2020","journal-title":"BMC Bioinformatics"},{"key":"2023052504595820300_btad297-B16","first-page":"1470","author":"Zhu","year":"2018"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btad297\/50202958\/btad297.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/39\/5\/btad297\/50449666\/btad297.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/39\/5\/btad297\/50449666\/btad297.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T05:00:16Z","timestamp":1684990816000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/doi\/10.1093\/bioinformatics\/btad297\/7152274"}},"subtitle":[],"editor":[{"given":"Zhiyong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5,4]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btad297","relation":{},"ISSN":["1367-4811"],"issn-type":[{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,5,1]]},"published":{"date-parts":[[2023,5,1]]},"article-number":"btad297"}}