Accumulating scientific evidence highlights the pivotal role of miRNA-disease association research in elucidating disease pathogenesis and developing innovative diagnostics. Consequently, accurately identifying disease-associated miRNAs has emerged as a prominent research topic in bioinformatics. Advances in graph neural networks (GNNs) have catalyzed methodological breakthroughs in this field. However, existing methods are often plagued by data noise and struggle to effectively integrate local and global information, which hinders their predictive performance. To address this, we introduce HGTMDA, an innovative hypergraph learning framework that incorporates random walk with restart-based association masking and an enhanced GCN-Transformer model to infer miRNA-disease associations. HGTMDA starts by constructing multiple homogeneous similarity networks. A novel enhancement of our approach is the introduction of a restart-based random walk association masking strategy. By stochastically masking a subset of association data and integrating it with a GCN enhanced by an attention mechanism, this strategy enables better capture of key information, leading to improved information utilization and reduced impact of noisy data. Next, we build an miRNA-disease heterogeneous hypergraph and adopt an improved GCN-Transformer encoder to effectively solve the effective extraction of local and global information. Lastly, we utilize a combined Dice cross-entropy (DCE) loss function to guide the model training and optimize its performance. To evaluate the performance of HGTMDA, comprehensive comparisons were conducted with state-of-the-art methods. Additionally, in-depth case studies on lung cancer and colorectal cancer were performed. The results demonstrate HGTMDA's outstanding performance across various metrics and its exceptional effectiveness in real-world application scenarios, highlighting the advantages and value of this method.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11273495 | PMC |
http://dx.doi.org/10.3390/bioengineering11070680 | DOI Listing |
Neural Netw
December 2024
Hubei Key Laboratory of Smart Internet Technology, School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, 430074, China. Electronic address:
Document-level event causality identification (ECI) aims to detect causal relations in between event mentions in a document. Some recent approaches model diverse connections in between events, such as syntactic dependency and etc., with a graph neural network for event node representation learning.
View Article and Find Full Text PDFSci Rep
December 2024
School of Marxism, China University of Political Science and Law (CUPL), Beijing, 100091, China.
To improve students' understanding of physical education teaching concepts and help teachers analyze students' cognitive patterns, the study proposes an association learning-based method for understanding physical education teaching concepts using deep learning algorithms, which extracts image features related to teaching concepts using convolutional neural networks. Moreover, a neurocognitive diagnostic model based on hypergraph convolution is constructed to mine the data of students' long-term learning sequences and identify students' cognitive outcomes. The findings revealed that the highest accuracy of the association graph convolutional neural network was 0.
View Article and Find Full Text PDFWhile deep brain stimulation (DBS) remains an effective therapy for Parkinson's disease (PD), sources of variance in patient outcomes are still not fully understood, underscoring a need for better prognostic criteria. Here we leveraged routinely collected T1-weighted (T1-w) magnetic resonance imaging (MRI) data to derive patient-specific measures of brain structure and evaluate their usefulness in predicting changes in PD medications in response to DBS. Preoperative T1-w MRI data from 231 patients with PD were used to extract regional measures of fractal dimension (FD), sensitive to the structural complexities of cortical and subcortical areas.
View Article and Find Full Text PDFBrief Bioinform
November 2024
State Key Laboratory of Organic Electronics and Information Displays & Institute of Advanced Materials (IAM), Nanjing University of Posts & Telecommunications, 9 Wenyuan, Nanjing 210023, China.
High-throughput sequencing methods have brought about a huge change in omics-based biomedical study. Integrating various omics data is possibly useful for identifying some correlations across data modalities, thus improving our understanding of the underlying biological mechanisms and complexity. Nevertheless, most existing graph-based feature extraction methods overlook the complementary information and correlations across modalities.
View Article and Find Full Text PDFJ Mach Learn Res
January 2024
Department of Statistics, Texas A&M University, College Station, TX 77843-3143, USA.
We consider the problem of clustering grouped data with possibly non-exchangeable groups whose dependencies can be characterized by a known directed acyclic graph. To allow the sharing of clusters among the non-exchangeable groups, we propose a Bayesian nonparametric approach, termed graphical Dirichlet process, that jointly models the dependent group-specific random measures by assuming each random measure to be distributed as a Dirichlet process whose concentration parameter and base probability measure depend on those of its parent groups. The resulting joint stochastic process respects the Markov property of the directed acyclic graph that links the groups.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!