IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i3p732-d1053672.html
   My bibliography  Save this article

Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning

Author

Listed:
  • Shilin Sun

    (College of Information and Computer, Taiyuan University of Technology, Jinzhong 030600, China)

  • Hua Tian

    (College of Information and Computer, Taiyuan University of Technology, Jinzhong 030600, China)

  • Runze Wang

    (College of Information and Computer, Taiyuan University of Technology, Jinzhong 030600, China)

  • Zehua Zhang

    (College of Information and Computer, Taiyuan University of Technology, Jinzhong 030600, China)

Abstract

Biomedical interaction prediction is essential for the exploration of relationships between biomedical entities. Predicted biomedical interactions can help researchers with drug discovery, disease treatment, and more. In recent years, graph neural networks have taken advantage of their natural structure to achieve great progress in biomedical interaction prediction. However, most of them use node embedding instead of directly using edge embedding, resulting in information loss. Moreover, they predict links based on node similarity correlation assumptions, which have poor generalization. In addition, they do not consider the difference in topological information between negative and positive sample links, which limits their performance. Therefore, in this paper, we propose an adaptive line graph contrastive (ALGC) method to convert negative and positive sample links into two kinds of line graph nodes. By adjusting the number of intra-class line graph edges and inter-class line graph edges, an augmented line graph is generated and, finally, the information of the two views is balanced by contrastive learning. Through experiments on four public datasets, it is proved that the ALGC model outperforms the state-of-the-art methods.

Suggested Citation

  • Shilin Sun & Hua Tian & Runze Wang & Zehua Zhang, 2023. "Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning," Mathematics, MDPI, vol. 11(3), pages 1-14, February.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:732-:d:1053672
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/3/732/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/3/732/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chao Li & Qiming Yang & Bowen Pang & Tiance Chen & Qian Cheng & Jiaomin Liu, 2021. "A Mixed Strategy of Higher-Order Structure for Link Prediction Problem on Bipartite Graphs," Mathematics, MDPI, vol. 9(24), pages 1-13, December.
    2. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    3. Haji Gul & Feras Al-Obeidat & Adnan Amin & Fernando Moreira & Kaizhu Huang, 2022. "Hill Climbing-Based Efficient Model for Link Prediction in Undirected Graphs," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    4. Katja Luck & Dae-Kyum Kim & Luke Lambourne & Kerstin Spirohn & Bridget E. Begg & Wenting Bian & Ruth Brignall & Tiziana Cafarelli & Francisco J. Campos-Laborie & Benoit Charloteaux & Dongsic Choi & At, 2020. "A reference map of the human binary protein interactome," Nature, Nature, vol. 580(7803), pages 402-408, April.
    5. Hang-Yuan Du & Wen-Jian Wang, 2022. "A Clustering Ensemble Framework with Integration of Data Characteristics and Structure Information: A Graph Neural Networks Approach," Mathematics, MDPI, vol. 10(11), pages 1-23, May.
    6. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xu-Wen Wang & Lorenzo Madeddu & Kerstin Spirohn & Leonardo Martini & Adriano Fazzone & Luca Becchetti & Thomas P. Wytock & István A. Kovács & Olivér M. Balogh & Bettina Benczik & Mátyás Pétervári & Be, 2023. "Assessment of community efforts to advance network-based prediction of protein–protein interactions," Nature Communications, Nature, vol. 14(1), pages 1-14, December.
    2. Yao Hongxing & Lu Yunxia, 2017. "Analyzing the Potential Influence of Shanghai Stock Market Based on Link Prediction Method," Journal of Systems Science and Information, De Gruyter, vol. 5(5), pages 446-461, October.
    3. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    4. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    5. Wu, Tao & Chen, Leiting & Zhong, Linfeng & Xian, Xingping, 2017. "Predicting the evolution of complex networks via similarity dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 662-672.
    6. Arun Sundararajan & Foster Provost & Gal Oestreicher-Singer & Sinan Aral, 2013. "Research Commentary ---Information in Digital, Economic, and Social Networks," Information Systems Research, INFORMS, vol. 24(4), pages 883-905, December.
    7. Zhang, Xue & Wang, Xiaojie & Zhao, Chengli & Yi, Dongyun & Xie, Zheng, 2014. "Degree-corrected stochastic block models and reliability in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 553-559.
    8. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    9. Zhou, Tao & Lee, Yan-Li & Wang, Guannan, 2021. "Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    10. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Xie, Zheng & Zhang, Shengjun & Yi, Dongyun, 2015. "Predicting link directions using local directed path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 260-267.
    11. Ankita Singh & Nanhay Singh, 2022. "An approach for predicting missing links in social network using node attribute and path information," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 944-956, April.
    12. Bütün, Ertan & Kaya, Mehmet, 2019. "A pattern based supervised link prediction in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 1136-1145.
    13. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    14. Xiaoji Wan & Fen Chen & Hailin Li & Weibin Lin, 2022. "Potentially Related Commodity Discovery Based on Link Prediction," Mathematics, MDPI, vol. 10(19), pages 1-27, October.
    15. Lee, Yan-Li & Dong, Qiang & Zhou, Tao, 2021. "Link prediction via controlling the leading eigenvector," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    16. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    17. Liao, Hao & Zeng, An & Zhang, Yi-Cheng, 2015. "Predicting missing links via correlation between nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 216-223.
    18. Xiaoling Sun & Hongfei Lin & Kan Xu & Kun Ding, 2015. "How we collaborate: characterizing, modeling and predicting scientific collaborations," Scientometrics, Springer;Akadémiai Kiadó, vol. 104(1), pages 43-60, July.
    19. Liu, Shuxin & Ji, Xinsheng & Liu, Caixia & Bai, Yi, 2017. "Extended resource allocation index for link prediction of complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 174-183.
    20. Sherkat, Ehsan & Rahgozar, Maseud & Asadpour, Masoud, 2015. "Structural link prediction based on ant colony approach in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 80-94.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:732-:d:1053672. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.