Background
With the rapid development of various advanced biotechnologies, researchers in related fields have realized that microRNAs (miRNAs) play critical roles in many serious human diseases. However, experimental identification of new miRNA–disease associations (MDAs) is expensive and time-consuming. Practitioners have shown growing interest in methods for predicting potential MDAs. In recent years, an increasing number of computational methods for predicting novel MDAs have been developed, making a huge contribution to the research of human diseases and saving considerable time. In this paper, we proposed an efficient computational method, named bipartite graph-based collaborative matrix factorization (BGCMF), which is highly advantageous for predicting novel MDAs.
Results
By combining two improved recommendation methods, a new model for predicting MDAs is generated. Based on the idea that some new miRNAs and diseases do not have any associations, we adopt the bipartite graph based on the collaborative matrix factorization method to complete the prediction. The BGCMF achieves a desirable result, with AUC of up to 0.9514 ± (0.0007) in the five-fold cross-validation experiments.
Conclusions
Five-fold cross-validation is used to evaluate the capabilities of our method. Simulation experiments are implemented to predict new MDAs. More importantly, the AUC value of our method is higher than those of some state-of-the-art methods. Finally, many associations between new miRNAs and new diseases are successfully predicted by performing simulation experiments, indicating that BGCMF is a useful method to predict more potential miRNAs with roles in various diseases.
With the development of research on the complex aetiology of many diseases, computational drug repositioning methodology has proven to be a shortcut to costly and inefficient traditional methods. Therefore, developing more promising computational methods is indispensable for finding new candidate diseases to treat with existing drugs. In this paper, a model integrating a new variant of message passing neural network and a novel-gated fusion mechanism called GLGMPNN is proposed for drug–disease association prediction. First, a light-gated message passing neural network (LGMPNN), including message passing, aggregation and updating, is proposed to separately extract multiple pieces of information from the similarity networks and the association network. Then, a gated fusion mechanism consisting of a forget gate and an output gate is applied to integrate the multiple pieces of information to extent. The forget gate calculated by the multiple embeddings is built to integrate the association information into the similarity information. Furthermore, the final node representations are controlled by the output gate, which fuses the topology information of the networks and the initial similarity information. Finally, a bilinear decoder is adopted to reconstruct an adjacency matrix for drug–disease associations. Evaluated by 10-fold cross-validations, GLGMPNN achieves excellent performance compared with the current models. The following studies show that our model can effectively discover novel drug–disease associations.
Heavy-duty NC machine tool is difficult and costly to evidently improve their precision via manufacturing technology only. It is proved being an effective approach to improve machine tool manufacturing precision based on software error compensation. In this paper, an error compensation algorithm based on reconstructing NC program is discussed. Following comprehensive discussion on basic algorithm of positioning error compensation in detail, linear interpolation and circular interpolation movement error compensation algorithm are further sketched in brief. To decrease the machining error, NC program is reconstructed before actual machining. The experiment results show that error compensation methods based on reconstructing NC program can improve profile accuracy of heavy-duty NC machine tools obviously.
In the analysis of three-phase unbalance in distribution network, the accuracy of daily load curve classification results determines the size of three-phase unbalance. Aiming at the shortcomings of Fuzzy C-Means (FCM), a fuzzy C-Means clustering algorithm (SSA-FCM) optimized based on Sparrow Search Algorithm (SSA) is proposed. The cluster validity evaluation index is introduced to get the optimal quantity of clusters, and the SSA is used to search for the initial cluster center, which solves the problem that the FCM algorithm relies on the initial value and is easy to converge to local optimal solution. The simulation results show that, compared with the FCM algorithm, the load curves classified into the same category by SSA-FCM are closer together.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.