skip to main content
10.1145/3592686.3592718acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbicConference Proceedingsconference-collections
research-article

Predicting Synthetic Lethality in Human Cancers via Knowledge Graph Summarization

Published: 31 May 2023 Publication History

Abstract

Synthetic lethality (SL) is of great significance for the development of anticancer drugs. Thanks to the increasing richness of biomedical knowledge graph (KG), machine learning algorithm combined with knowledge graph has been used for SL prediction and achieved good performance. However, how to effectively utilize biomedical KG to learn stronger gene feature representation is an open problem. Therefore, a self-attention based graph summarization scheme is introduced to delete unimportant nodes and edges in the graph. Firstly, the knowledge graph is used to construct the subgraph of the target gene node, and then the self-attention mechanism is used to calculate the edge signal intensities score in the subgraph, so as to remove the entities that are not important to the target gene in the subgraph. Finally, latent features of gene node are learned by graph neural network for SL prediction. The experimental findings demonstrate that our method performs better than the best baseline method, demonstrating the viability of our method.

References

[1]
Alan Ashworth, Christopher J.Lord, and Jorge S. Reis-Filho. 2011. Genetic interactions in cancer progression and treatment. J. Cell 145, 1 (April 2011), 30-38. https://doi.org/10.1016/j.cell.2011.03.020
[2]
Sri R Paladugu, Shan Zhao, Animesh Ray and Alpan Raval. 2008. Mining protein networks for synthetic genetic Interactions. J. BMC Bioinformatics 9, 426 (October 2008). https://doi.org/10.1016/j.cell.2011.03.020
[3]
Shaoli Das, Xiang Deng, Kevin Camphausen and Uma Shankavaram. 2019. Discoversl: an r package for multi-omic data driven prediction of synthetic lethality in cancers. J. Bioinformatics 35, 4 (February 2019), 701-702. https://doi.org/10.1016/j.cell.2011.03.020
[4]
Graeme Benstead-Hume; Xiangrong Chen; Suzanna R Hopkins; Karen A Lane; Jessica A Downs; Frances M G Pearl. 2019. Predicting synthetic lethal interactions using conserved patterns in protein interaction networks. J. PLOS computational biology 15, 4 (April 2019), e1006888. https://doi.org/10.1016/j.cell.2011.03.020
[5]
Yong Liu, Min Wu, Chenghao Liu, Xiao-Li Li, and Jie Zheng. 2018. SL2MF: predicting Synthetic Lethality in Human Cancers via Logistic Matrix Factorization. J. IEEE/ACM Transactions on Computational Biology and Bioinformatics 17, 3(April 2019), 748-757. https://doi.org/10.1016/j.cell.2011.03.020
[6]
Ruichu Cai, Xuexin Chen, Yuan Fang, Min Wu, Yuexing Hao. 2020. Dual-dropout graph convolutional network for predicting synthetic lethality in human cancers. J. Bioinformatics 36, 16(August 2020), 4458-4465. https://doi.org/10.1016/j.cell.2011.03.020
[7]
Shike Wang, Fan Xu, Yunyang Li, Jie Wang, Ke Zhang, Yong Liu, Min Wu and Jie Zheng. 2021. KG4SL: knowledge graph neural network for synthetic lethality prediction in human cancers. J.Bioinformatics 37,1(July 2021), i418-i425. https://doi.org/10.1016/j.cell.2011.03.020
[8]
Guo Jing; Liu Hui; Zheng Jie. 2016. SynLethDB: synthetic lethality database toward discovery of selective and sensitive anticancer drug targets. J. Nucleic Acids Research 44, D1(May 2016), 1011-1017. https://doi.org/10.1016/j.cell.2011.03.020
[9]
Livnat Jerby-Arnon, Nadja Pfetzer, Yedael Y Waldman, Lynn McGarry, Eytan Ruppin. 2014. Predicting cancer-specific vulnerability via data-driven detection of synthetic lethality. J. Cell 158, 5(August 2014), 1199-1209. https://doi.org/10.1016/j.cell.2011.03.020
[10]
Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. In Proceedings of the 32nd International Conference on Neural Information Processing Systems. Curran Associates Inc. NY, United States, 5171–5181. https://doi.org/10.48550/arXiv.1802.09691
[11]
Peter Shaw, Jakob Uszkoreit, Ashish Vaswani. 2018. Self-Attention with Relative Position Representations. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies.PA, New Orleans, 464-468. https://doi.org/10.48550/arXiv.1802.09691
[12]
Michael Schlichtkrull, Thomas Kipf, Peter Bloem, RVD Berg, Ivan Titov, Max Welling. 2017. Modeling relational data with graph convolutional networks. In Proceedings of Extended Semantic Web Conference. Springer, Berlin, 23-26. https://doi.org/10.48550/arXiv.1703.06103
[13]
Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In Proceedings of the International Conference on Machine Learning. ACM, New York, 5453-5462. https://doi.org/10.48550/arXiv.1806.03536
[14]
Bryan Perozzi, Rami Al-Rfou, Steven Skiena. 2014. Deepwalk: online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, 701-710. https://doi.org/10.1145/2623330.2623732
[15]
Grover Aditya and Leskovec Jure. 2016. node2vec: scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. CA, San Francisco, 855–864. https://doi.org/10.1145/2623330.2623732
[16]
Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.CA, San Francisco, 1105–1114. https://doi.org/10.1145/2939672.2939751
[17]
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, Yoshua Bengio. 2017. Graph attention networks, In Proceedings of the International Conference of Learning Representation. https://doi.org/10.48550/arXiv.1710.10903

Recommendations

Comments

Information & Contributors

Information

Published In

BIC '23: Proceedings of the 2023 3rd International Conference on Bioinformatics and Intelligent Computing
February 2023
398 pages
ISBN:9798400700200
DOI:10.1145/3592686
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2023

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

BIC 2023

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 67
    Total Downloads
  • Downloads (Last 12 months)22
  • Downloads (Last 6 weeks)1
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy