<HashMap><database>biostudies-literature</database><scores/><additional><submitter>Gao Z</submitter><funding>Support Project of Gansu Colleges</funding><funding>Gansu Natural Science Foundation Project</funding><funding>National Natural Science Foundation of China</funding><pagination>btad357</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC10275904</full_dataset_link><repository>biostudies-literature</repository><omics_type>Unknown</omics_type><volume>39(6)</volume><pubmed_abstract>&lt;h4>Motivation&lt;/h4>An imperative step in drug discovery is the prediction of drug-disease associations (DDAs), which tries to uncover potential therapeutic possibilities for already validated drugs. It is costly and time-consuming to predict DDAs using wet experiments. Graph Neural Networks as an emerging technique have shown superior capacity of dealing with DDA prediction. However, existing Graph Neural Networks-based DDA prediction methods suffer from sparse supervised signals. As graph contrastive learning has shined in mitigating sparse supervised signals, we seek to leverage graph contrastive learning to enhance the prediction of DDAs. Unfortunately, most conventional graph contrastive learning-based models corrupt the raw data graph to augment data, which are unsuitable for DDA pred</pubmed_abstract><journal>Bioinformatics (Oxford, England)</journal><pubmed_title>Similarity measures-based graph co-contrastive learning for drug-disease association prediction.</pubmed_title><pmcid>PMC10275904</pmcid><funding_grant_id>61762078</funding_grant_id><funding_grant_id>21JR7RA114</funding_grant_id><funding_grant_id>61363058</funding_grant_id><pubmed_authors>Wu Z</pubmed_authors><pubmed_authors>Zhang X</pubmed_authors><pubmed_authors>Ma H</pubmed_authors><pubmed_authors>Gao Z</pubmed_authors><pubmed_authors>Wang Y</pubmed_authors></additional><is_claimable>false</is_claimable><name>Similarity measures-based graph co-contrastive learning for drug-disease association prediction.</name><description>&lt;h4>Motivation&lt;/h4>An imperative step in drug discovery is the prediction of drug-disease associations (DDAs), which tries to uncover potential therapeutic possibilities for already validated drugs. It is costly and time-consuming to predict DDAs using wet experiments. Graph Neural Networks as an emerging technique have shown superior capacity of dealing with DDA prediction. However, existing Graph Neural Networks-based DDA prediction methods suffer from sparse supervised signals. As graph contrastive learning has shined in mitigating sparse supervised signals, we seek to leverage graph contrastive learning to enhance the prediction of DDAs. Unfortunately, most conventional graph contrastive learning-based models corrupt the raw data graph to augment data, which are unsuitable for DDA pred</description><dates><release>2023-01-01T00:00:00Z</release><publication>2023 Jun</publication><modification>2025-04-22T01:57:45.244Z</modification><creation>2025-04-05T20:14:03.415Z</creation></dates><accession>S-EPMC10275904</accession><cross_references><pubmed>37261859</pubmed><doi>10.1093/bioinformatics/btad357</doi></cross_references></HashMap>