Neuro-symbolic representation learning on biological knowledge graphs
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Motivation: Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge. Results: We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of Semantic Web based knowledge bases in biology to use in machine learning and data analytics. Availability and implementation: https://github.com/bio-ontology-research-group/walking-rdf-and-owl Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
The FAIR Guiding Principles for scientific data management and stewardship
Wilkinson, M. D., Dumontier, M., Aalbersberg, I. J., Appleton, G., Axton, M., Baak, A., Blomberg, N., Boiten, J.-W., da Silva Santos, L. B., Bourne, P. E., et al. (2016) · Scientific Data · doi:10.1038/sdata.2016.18 · Cited by 18,423
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
PubChem Substance and Compound databases
Kim, S., Thiessen, P. A., Bolton, E. E., Chen, J., Fu, G., Gindulyte, A., Han, L., He, J., He, S., Shoemaker, B. A., et al. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv951 · Cited by 5,436 · cited 2×
“OWL provides three profiles [Motik et al.(2009)] that facilitate polynomial time inferences, and multiple RDF stores implement different subsets of OWL to facilitate inferences and improve querying.”
MethodLamb, J., Crawford, E. D., Peck, D., Modell, J. W., Blat, I. C., Wrobel, M. J., Lerner, J., Brunet, J.-P., Subramanian, A., Ross, K. N., et al. (2006) · Science · doi:10.1126/science.1132939 · Cited by 5,257
Gene Ontology Consortium: going forward
The Gene Ontology Consortium (2015) · Nucleic Acids Research · doi:10.1093/nar/gku1179 · Cited by 3,492
Drug target identification using side-effect similarity
Campillos, M., Kuhn, M., Gavin, A.-C., Jensen, L. J., & Bork, P. (2008) · Science · doi:10.1126/science.1158140 · Cited by 1,248
DisGeNET: a discovery platform for the dynamical exploration of human diseases and their genes
Pinero, J., Queralt-Rosinach, N., Bravo, A., Deu-Pons, J., Bauer-Mehren, A., Baron, M., Sanz, F., & Furlong, L. I. (2015) · Database · doi:10.1093/database/bav028 · Cited by 1,124 · cited 1×
“• Genes and disease associations from DisGeNET [Piñero et al.(2015)], downloaded on 28 August 2016, consisting of 236,259 associations.”
BackgroundA large-scale evaluation of computational protein function prediction
Radivojac, P., Clark, W. T., Oron, T. R., Schnoes, A. M., Wittkop, T., Sokolov, A., Graim, K., Funk, C., Verspoor, K., Ben-Hur, A., et al. (2013) · Nature Methods · doi:10.1038/nmeth.2340 · Cited by 1,028
Data-driven prediction of drug effects and interactions
Tatonetti, N. P., Ye, P. P., Daneshjou, R., & Altman, R. B. (2012) · Science Translational Medicine · doi:10.1126/scitranslmed.3003377 · Cited by 936
Cited by
Kulmanov, M., Khan, M. A., & Hoehndorf, R. (2018) · Bioinformatics · doi:10.1093/bioinformatics/btx624 · Cited by 558
Self-citationGraph embedding on biomedical networks: methods, applications and evaluations
Yue, X., Wang, Z., Huang, J., Parthasarathy, S., Moosavinasab, S., Huang, Y., Lin, S. M., Zhang, W., Zhang, P., & Sun, H. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz718 · Cited by 386
Machine learning and integrative analysis of biomedical big data
Mirza, B., Wang, W., Wang, J., Choi, H., Chung, N. C., & Ping, P. (2019) · Genes · doi:10.3390/genes10020087 · Cited by 380
Current progress and open challenges for applying deep learning across the biosciences
Sapoval, N., Aghazadeh, A., Nute, M. G., Antunes, D. A., Balaji, A., Baraniuk, R., Barberan, C. J., Dannenfelser, R., Dun, C., Edrisi, M., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-29268-7 · Cited by 359
Constructing knowledge graphs and their biomedical applications
Nicholson, D. N., & Greene, C. S. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2020.05.017 · Cited by 299
Metadata
- Authors
- Alshahrani, M., Khan, M. A., Maddouri, O., Kinjo, A. R., Queralt-Rosinach, N., & Hoehndorf, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2017-04-25
- Volume
- 33
- Issue
- 17
- Pages
- 2723-2730
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2562531153
- Cited by
- 150
- References
- 12
- FWCI
- 9.84
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Neuro-symbolic representation learning on biological knowledge graphs. https://app.cochat.ai/papers/10.1093/bioinformatics/btx275
- The paper
- Alshahrani, M., Khan, M. A., Maddouri, O., Kinjo, A. R., Queralt-Rosinach, N., & Hoehndorf, R. (2017). Neuro-symbolic representation learning on biological knowledge graphs. Bioinformatics. https://doi.org/10.1093/bioinformatics/btx275
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.