20 March 2023 in IEEE Transactions on Fuzzy Systems
Performing an accurate clustering analysis is of great significance for us to understand the behavior of complex networks, and a variety of graph clustering algorithms have thus been proposed to do so by taking into account network topology and node attributes. Among them, FCAN is an established fuzzy clustering algorithm that optimizes the memberships of nodes based on dense structures and content relevance. This paper proposes an improved fuzzy-based graph clustering algorithm, namely FCAN-MOPSO, that retains all the benefits associated with FCAN while achieving significantly increased convergence rate using multi-objective particle swarm optimization (MOPSO). To do so, FCAN-MOPSO first modifies the original optimization model of FCAN by adopting an instance-frequency-weighted regularization, which enhances the ability of FCAN-MOPSO to handle the imbalance observed in the distribution of fuzzy memberships of nodes. After that, FCAN-MOPSO decomposes its optimization problem into a set of sub-optimization problems. Following the MOPSO framework, FCAN-MOPSO develops an effective solution to reach a consensus optimization among them by balancing the global exploration and local exploitation abilities of particles. A theoretical analysis is provided to prove the global convergence of FCAN-MOPSO. Extensive experiments have been conducted to evaluate the performance of FCAN-MOPSO on five real-world complex networks with different scale, and experimental results demonstrate that when compared with state-of-the-art clustering algorithms, FCAN-MOPSO achieves a better accuracy performance with improved convergence. Hence, FCAN-MOPSO is a promising graph clustering algorithm to precisely and efficiently discover clusters in complex networks.
1 April 2024 in IEEE Journal of Biomedical and Health Informatics
As post-transcriptional regulators of gene expression, micro-ribonucleic acids (miRNAs) are regarded as potential biomarkers for a variety of diseases. Hence, the prediction of miRNA-disease associations (MDAs) is of great significance for an in-depth understanding of disease pathogenesis and progression. Existing prediction models are mainly concentrated on incorporating different sources of biological information to perform the MDA prediction task while failing to consider the fully potential utility of MDA network information at the motif-level. To overcome this problem, we propose a novel motif-aware MDA prediction model, namely MotifMDA, by fusing a variety of high- and low-order structural information. In particular, we first design several motifs of interest considering their ability to characterize how miRNAs are associated with diseases through different network structural patterns. Then, MotifMDA adopts a two-layer hierarchical attention to identify novel MDAs. Specifically, the first attention layer learns high-order motif preferences based on their occurrences in the given MDA network, while the second one learns the final embeddings of miRNAs and diseases through coupling high- and low-order preferences. Experimental results on two benchmark datasets have demonstrated the superior performance of MotifMDA over several state-of-the-art prediction models. This strongly indicates that accurate MDA prediction can be achieved by relying solely on MDA network information. Furthermore, our case studies indicate that the incorporation of motif-level structure information allows MotifMDA to discover novel MDAs from different perspectives. The data and codes are available at https://github.com/stevejobws/MotifMDA.
8 August 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Protein-protein interactions (PPIs) play an essential role for most of biological processes in cells. Many computational algorithms have thus been proposed to predict PPIs. However, most of them heavily rest on the biological information of proteins while ignoring the latent structural features of proteins presented in a PPI network. In this paper, we propose an efficient network-based prediction algorithm, namely PPISB, based on a mixed membership stochastic blockmodel. By simulating the generative process of a PPI network, PPISB is able to capture the latent community structures. The inference procedure adopted by PPISB further optimizes the membership distributions of proteins over different complexes. After that, a distance measure is designed to compute the similarity between two proteins in terms of their likelihoods of being in the same complex, thus verifying whether they interact with each other or not. To evaluate the performance of PPISB, a series of extensive experiments have been conducted with five PPI networks collected from different species and the results demonstrate that PPISB has a promising performance when applied to predict PPIs in terms of several evaluation metrics. Hence, we reason that PPISB is preferred over state-of-the-art network-based prediction algorithms especially for predicting potential PPIs.
1 December 2022 in BMC Bioinformatics
Background: Drug repositioning is a very important task that provides critical information for exploring the potential efficacy of drugs. Yet developing computational models that can effectively predict drug–disease associations (DDAs) is still a challenging task. Previous studies suggest that the accuracy of DDA prediction can be improved by integrating different types of biological features. But how to conduct an effective integration remains a challenging problem for accurately discovering new indications for approved drugs. Methods: In this paper, we propose a novel meta-path based graph representation learning model, namely RLFDDA, to predict potential DDAs on heterogeneous biological networks. RLFDDA first calculates drug–drug similarities and disease–disease similarities as the intrinsic biological features of drugs and diseases. A heterogeneous network is then constructed by integrating DDAs, disease–protein associations and drug–protein associations. With such a network, RLFDDA adopts a meta-path random walk model to learn the latent representations of drugs and diseases, which are concatenated to construct joint representations of drug–disease associations. As the last step, we employ the random forest classifier to predict potential DDAs with their joint representations. Results: To demonstrate the effectiveness of RLFDDA, we have conducted a series of experiments on two benchmark datasets by following a ten-fold cross-validation scheme. The results show that RLFDDA yields the best performance in terms of AUC and F1-score when compared with several state-of-the-art DDAs prediction models. We have also conducted a case study on two common diseases, i.e., paclitaxel and lung tumors, and found that 7 out of top-10 diseases and 8 out of top-10 drugs have already been validated for paclitaxel and lung tumors respectively with literature evidence. Hence, the promising performance of RLFDDA may provide a new perspective for novel DDAs discovery over heterogeneous networks.