Single-cell RNA sequencing (scRNA-seq) data typically exhibit high dimensionality, sparsity, and noise, posing significant challenges for downstream tasks such as clustering and biomarker discovery. To address these issues, we propose a Self-Paced Framework Fusing Feature Selection and Clustering with Prior Knowledge (SPF-FS), which tightly integrates feature selection and clustering in an iterative feedback loop. SPF-FS constructs multiple base learners that, together with Gene Ontology information, assess gene importance. We design a joint optimization objective with two goals: enforcing intracluster compactness and maximizing inter-cluster separation. Through a self-paced strategy, the framework incrementally incorporates more challenging sample pairs at each iteration, simultaneously updating feature weights and cluster assignments. This design reduces noisy genes and enhances the selection of biologically relevant features. Comprehensive evaluations on 16 public scRNA-seq datasets show that SPF-FS outperforms nine mainstream methods in terms of the Adjusted Rand Index and normalized mutual information, with average improvements of 0.17 in ARI and 0.18 in NMI. Moreover, SPF-FS exhibits strong stability and biological interpretability in marker-gene selection, and functional pathway enrichment analyses.

Single-cell RNA sequencing (scRNA-seq) deciphers cellular heterogeneity at single-cell resolution, unmasking rare and dynamic cell types. Existing deep learning based methods for single-cell clustering mainly emphasize instance-level representations, while neglecting fundamental clustering principles: maximizing intra-population homogeneity and minimizing interpopulation similarity. Consequently, this oversight constrains clustering performance and compromises the accuracy of cell identification. To address these limitations, we propose sc3M, a novel multi-level graph contrastive learning framework that integrates instance-, cluster- and global-level contrastive learning for scRNA-seq data clustering. sc3M generates three augmented views (original, topological and semantic), utilizes Graph Attention Networks (GAT) and MLP to learn hierarchical cell representations, and enforces multi-level min-max mutual information to optimize cross-view consistency. We evaluated sc3M on nine scRNA-seq datasets. The extensive experiments demonstrated that$\operatorname{sc3M}$achieves superior clustering performance over other state-of-the-art methods. Furthermore, downstream analyses including marker gene identification and cell trajectory inference validate its biological utility. The source code is available at: https://github.com/Biostar1099/sc3M.

The emergence of single-cell RNA sequencing (scRNA-seq) has provided researchers with a powerful tool to investigate cell heterogeneity and human diseases at the level of individual cells. Cell clustering is a crucial step in scRNA-seq data analysis to identify marker genes and recognize cell types. However, scRNA-seq data present challenges for clustering tasks due to their high dimensionality, sparsity, and noise. Although some contrastive learning methods have achieved good results in clustering scRNA-seq data, they are highly sensitive to data augmentation schemes. Here, we propose scAFGCC, a novel augmentation-free graph contrastive clustering method that combines graph convolutional network (GCN) and contrastive learning to exploit inter-cell relationships. scAFGCC does not require data augmentations or negative samples to learn graph representations. Instead, we generate positive samples by exploring the local structural information and the global semantics of the target nodes. We integrate feature representation learning with clustering tasks. Additionally, we introduce a reconstruction module that pretrains the model, facilitating faster training and improved performance. Our experiments on 24 simulated and 13 real datasets show that scAFGCC outperforms seven state-of-the-art methods in terms of accuracy and robustness. We also apply scAFGCC to downstream tasks such as cell annotation and marker gene identification.

MicroRNAs (miRNA) are endogenous non-coding RNAs, typically around 23 nucleotides in length. Many miRNAs have been founded to play crucial roles in gene regulation though post-transcriptional repression in animals. Existing studies suggest that the dysregulation of miRNA is closely associated with many human diseases. Discovering novel associations between miRNAs and diseases is essential for advancing our understanding of disease pathogenesis at molecular level. However, experimental validation is time-consuming and expensive. To address this challenge, numerous computational methods have been proposed for predicting miRNA-disease associations. Unfortunately, most existing methods face difficulties when applied to large-scale miRNA-disease complex networks. In this paper, we present a novel subgraph learning method named SGLMDA for predicting miRNA-disease associations. For miRNA-disease pairs, SGLMDA samples K-hop subgraphs from the global heterogeneous miRNA-disease graph. It then introduces a novel subgraph representation algorithm based on Graph Neural Network (GNN) for feature extraction and prediction. Extensive experiments conducted on benchmark datasets demonstrate that SGLMDA can effectively and robustly predict potential miRNA-disease associations. Compared to other state-of-the-art methods, SGLMDA achieves superior prediction performance in terms of Area Under the Curve (AUC) and Average Precision (AP) values during 5-fold Cross-Validation (5CV) on benchmark datasets such as HMDD v2.0 and HMDD v3.2. Additionally, case studies on Colon Neoplasms and Triple-Negative Breast Cancer (TNBC) further underscore the predictive power of SGLMDA.

Rapid advances in single-cell RNA sequencing (scRNA-seq) have made it possible to characterize cell states at a high resolution view for large scale library. scRNA-seq data contains a great deal of biological information, which can be mainly used to discover cell subtypes and track cell development. However, traditional methods face many challenges in addressing scRNA-seq data with high dimensions and high sparsity. For better analysis of scRNA-seq data, we propose a new framework called MSVGAE based on variational graph auto-encoder and graph attention networks. Specifically, we introduce multiple encoders to learn features at different scales and control for uninformative features. Moreover, different noises are added to encoders to promote the propagation of graph structural information and distribution uncertainty. Therefore, some complex posterior distributions can be captured by our model. MSVGAE maps scRNA-seq data with high dimensions and high noise into the low-dimensional latent space, which is beneficial for downstream tasks. In particular, MSVGAE can handle extremely sparse data. Before the experiment, we create 24 simulated datasets to simulate various biological scenarios and collect 8 real-world datasets. The experimental results of clustering, visualization and marker genes analysis indicate that MSVGAE model has excellent accuracy and robustness in analyzing scRNA-seq data.

Single-cell RNA sequencing technology provides powerful support for researchers to understand the complex mechanisms of cells at the single-cell level. Due to the high sparsity, technical noise, and computational complexity of single-cell transcriptome data, the existing data analysis methods are unable to effectively extract the fine-grained characteristics of scRNA-seq data, resulting in inaccurately analyze the heterogeneity of the individual cell from a great quantity of cell mixtures. To address these shortcomings, we proposed an end-to-end analysis method called dhaSCA, which integrates the Graph convolutional neural network (GCN) feature learning and downstream tasks such as classification and imputation into a unified deep learning manner. dhaSCA uses hybrid GCN-MLP deep autoencoder and to capture structural information between cells, and learn the low dimensional cell representation. It also introduces downstream tasks as constraints to guide the model to learn more accurate cell features. We conducted various experiments to evaluate the performance of dhaSCA based on eight real RNA-Seq datasets, including classification, imputation, clustering, and visualization. The results show that dhaSCA outperforms other state-of-the-art methods in these downstream tasks. Therefore, dhaSCA is able to obtain a richer representation of cells, and provides strong support for efficient analysis of single-cell data.

CircRNAs have a stable structure, which gives them a higher tolerance to nucleases. Therefore, the properties of circular RNAs are beneficial in disease diagnosis. However, there are few known associations between circRNAs and disease. Biological experiments identify new associations is time-consuming and high-cost. As a result, there is a need of building efficient and achievable computation models to predict potential circRNA-disease associations. In this paper, we design a novel convolution neural networks framework(DMFCNNCD) to learn features from deep matrix factorization to predict circRNA-disease associations. Firstly, we decompose the circRNA-disease association matrix to obtain the original features of the disease and circRNA, and use the mapping module to extract potential nonlinear features. Then, we integrate it with the similarity information to form a training set. Finally, we apply convolution neural networks to predict the unknown association between circRNAs and diseases. The five-fold cross-validation on various experiments shows that our method can predict circRNA-disease association and outperforms state of the art methods.

Circular RNAs (circRNAs) are a category of noncoding RNAs that exist in great numbers in eukaryotes. They have recently been discovered to be crucial in the growth of tumors. Therefore, it is important to explore the association of circRNAs with disease. This paper proposes a new method based on DeepWalk and nonnegative matrix factorization (DWNMF) to predict circRNA-disease association. Based on the known circRNA-disease association, we calculate the topological similarity of circRNA and disease via the DeepWalk-based method to learn the node features on the association network. Next, the functional similarity of the circRNAs and the semantic similarity of the diseases are fused with their respective topological similarities at different scales. Then, we use the improved weightedK-nearest neighbor (IWKNN) method to preprocess the circRNA-disease association network and correct nonnegative associations by setting different parametersK1andK2in the circRNA and disease matrices. Finally, theL2,1-norm, dual-graph regularization term and Frobenius norm regularization term are introduced into the nonnegative matrix factorization model to predict the circRNA-disease correlation. We perform cross-validation on circR2Disease, circRNADisease, and MNDR. The numerical results show that DWNMF is an efficient tool for forecasting potential circRNA-disease relationships, outperforming other state-of-the-art approaches in terms of predictive performance.

Single-cell RNA sequencing (scRNA-seq) has rapidly emerged as a powerful technique for analyzing cellular heterogeneity at the individual cell level. In the analysis of scRNA-seq data, cell clustering is a critical step in downstream analysis, as it enables the identification of cell types and the discovery of novel cell subtypes. However, the characteristics of scRNA-seq data, such as high dimensionality and sparsity, dropout events and batch effects, present significant computational challenges for clustering analysis. In this study, we propose scGCC, a novel graph self-supervised contrastive learning model, to address the challenges faced in scRNA-seq data analysis. scGCC comprises two main components: a representation learning module and a clustering module. The scRNA-seq data is first fed into a representation learning module for training, which is then used for data classification through a clustering module. scGCC can learn low-dimensional denoised embeddings, which is advantageous for our clustering task. We introduce Graph Attention Networks (GAT) for cell representation learning, which enables better feature extraction and improved clustering accuracy. Additionally, we propose five data augmentation methods to improve clustering performance by increasing data diversity and reducing overfitting. These methods enhance the robustness of clustering results. Our experimental study on 14 real-world datasets has demonstrated that our model achieves extraordinary accuracy and robustness. We also perform downstream tasks, including batch effect removal, trajectory inference, and marker genes analysis, to verify the biological effectiveness of our model.

MicroRNAs (miRNAs) are a class of non-coding RNAs that play critical role in many biological processes, such as cell growth, development, differentiation and aging. Increasing studies have revealed that miRNAs are closely involved in many human diseases. Therefore, the prediction of miRNA-disease associations is of great significance to the study of the pathogenesis, diagnosis and intervention of human disease. However, biological experimentally methods are usually expensive in time and money, while computational methods can provide an efficient way to infer the underlying disease-related miRNAs. In this study, we propose a novel method to predict potential miRNA-disease associations, called SVAEMDA. Our method mainly consider the miRNA-disease association prediction as semi-supervised learning problem. SVAEMDA integrates disease semantic similarity, miRNA functional similarity and respective Gaussian interaction profile (GIP) similarities. The integrated similarities are used to learn the representations of diseases and miRNAs. SVAEMDA trains a variational autoencoder based predictor by using known miRNA-disease associations, with the form of concatenated dense vectors. Reconstruction probability of the predictor is used to measure the correlation of the miRNA-disease pairs. Experimental results show that SVAEMDA outperforms other stat-of-the-art methods. AUC values of SVAEMDA of global leave-one-out cross validation (LOOCV) and 5-fold cross validation (5-fold CV) are 0.9464 and 0.9428 respectively. In addition, case studies of three common human diseases indicate that SVAEMDA obtains 100 percent of the top 50 predicted candidates in the benchmark databases. Therefore, SVAEMDA can efficiently and accurately predict the potential associations between diseases and miRNAs.

MOTIVATION: MicroRNAs (miRNAs) are a class of non-coding RNAs that play critical roles in various biological processes. Many studies have shown that miRNAs are closely related to the occurrence, development and diagnosis of human diseases. Traditional biological experiments are costly and time consuming. As a result, effective computational models have become increasingly popular for predicting associations between miRNAs and diseases, which could effectively boost human disease diagnosis and prevention. RESULTS: We propose a novel computational framework, called AEMDA, to identify associations between miRNAs and diseases. AEMDA applies a learning-based method to extract dense and high-dimensional representations of diseases and miRNAs from integrated disease semantic similarity, miRNA functional similarity and heterogeneous related interaction data. In addition, AEMDA adopts a deep autoencoder that does not need negative samples to retrieve the underlying associations between miRNAs and diseases. Furthermore, the reconstruction error is used as a measurement to predict disease-associated miRNAs. Our experimental results indicate that AEMDA can effectively predict disease-related miRNAs and outperforms state-of-the-art methods. AVAILABILITY AND IMPLEMENTATION: The source code and data are available at https://github.com/CunmeiJi/AEMDA. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

microRNAs (miRNAs) are small non-coding RNAs related to a number of complicated biological processes. A growing body of studies have suggested that miRNAs are closely associated with many human diseases. It is meaningful to consider disease-related miRNAs as potential biomarkers, which could greatly contribute to understanding the mechanisms of complex diseases and benefit the prevention, detection, diagnosis and treatment of extraordinary diseases. In this study, we presented a novel model named Graph Convolutional Autoencoder for miRNA-Disease Association Prediction (GCAEMDA). In the proposed model, we utilized miRNA-miRNA similarities, disease-disease similarities and verified miRNA-disease associations to construct a heterogeneous network, which is applied to learn the embeddings of miRNAs and diseases. In addition, we separately constructed miRNA-based and disease-based sub-networks. Combining the embeddings of miRNAs and diseases, graph convolutional autoencoder (GCAE) was utilized to calculate association scores of miRNA-disease on two sub-networks, respectively. Furthermore, we obtained final prediction scores between miRNAs and diseases by adopting an average ensemble way to integrate the prediction scores from two types of subnetworks. To indicate the accuracy of GCAEMDA, we applied different cross validation methods to evaluate our model whose performances were better than the state-of-the-art models. Case studies on a common human diseases were also implemented to prove the effectiveness of GCAEMDA. The results demonstrated that GCAEMDA was beneficial to infer potential associations of miRNA-disease.