2022
DOI: 10.1093/bib/bbac379
|View full text |Cite
|
Sign up to set email alerts
|

GraphCDA: a hybrid graph representation learning framework based on GCN and GAT for predicting disease-associated circRNAs

Abstract: Motivation: CircularRNA (circRNA) is a class of noncoding RNA with high conservation and stability, which is considered as an important disease biomarker and drug target. Accumulating pieces of evidence have indicated that circRNA plays a crucial role in the pathogenesis and progression of many complex diseases. As the biological experiments are time-consuming and labor-intensive, developing an accurate computational prediction method has become indispensable to identify disease-related circRNAs. Results: We p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 45 publications
0
8
0
Order By: Relevance
“…Ten competitive approaches are selected for comparison with MIDTI and we evaluate them with ACC, AUC and AUPR metrics. They are Random Forests (RF) ( Pedregosa et al 2011 ), Support-Vector Machine (SVM) ( Chang and Lin 2011 ), eXtreme Gradient Boosting (XGBoost) ( Chen and Guestrin 2016 ), GCN ( Kipf and Welling 2016 ), Graph Attention Networks (GAT) ( Veličković et al 2017 ), DTI-CNN ( Peng et al 2020 ), GCNMDA ( Long et al 2020 ), MVGCN ( Fu et al 2022 ), MMGCN ( Tang et al 2021 ), GraphCDA ( Dai et al 2022 ), and DTINet ( Luo et al 2017 ). The description for these comparison approaches is presented in Supplementary Section S5 .…”
Section: Resultsmentioning
confidence: 99%
“…Ten competitive approaches are selected for comparison with MIDTI and we evaluate them with ACC, AUC and AUPR metrics. They are Random Forests (RF) ( Pedregosa et al 2011 ), Support-Vector Machine (SVM) ( Chang and Lin 2011 ), eXtreme Gradient Boosting (XGBoost) ( Chen and Guestrin 2016 ), GCN ( Kipf and Welling 2016 ), Graph Attention Networks (GAT) ( Veličković et al 2017 ), DTI-CNN ( Peng et al 2020 ), GCNMDA ( Long et al 2020 ), MVGCN ( Fu et al 2022 ), MMGCN ( Tang et al 2021 ), GraphCDA ( Dai et al 2022 ), and DTINet ( Luo et al 2017 ). The description for these comparison approaches is presented in Supplementary Section S5 .…”
Section: Resultsmentioning
confidence: 99%
“…Following previous studies (19, 28, 38), 5-fold cross-validation (CV) method is adopted to evaluate KGETCDA and compare with other SOTA models in this paper. Specially, in the 5-fold CV, all samples of the whole dataset are randomly divided into five equal parts and each part is selected for testing in turn while the remaining parts is utilized to train the model.…”
Section: Resultsmentioning
confidence: 99%
“…To further evaluate the effectiveness of KGETCDA, case studies are conducted on both two datasets. Following (23, 38, 62), we train the model KGETCDA on all known CDA, and then predict potential probabilities for all unknown CDA and sort them in descending order. Moreover, we collect experimental evidence to verify them in public databases and newly published literatures, and the results are listed in Table 2.…”
Section: Resultsmentioning
confidence: 99%
“…The random forest algorithm can make the optimal classification decision based on the extracted drug target features, thus improving the prediction performance of DTI [ 47 ]. In addition, although BG-DTI is mainly used to predict DTI, it is a portable method and it can be widely used to solve problems in bioinformatics fields such as predicting the correlation between circRNAs and diseases [ 48 , 49 , 50 , 51 ].…”
Section: Discussionmentioning
confidence: 99%