Jump to main content
Jump to site search


Dual-network sparse graph regularized matrix factorization for predicting miRNA–disease associations

Author affiliations

Abstract

With the development of biological research and scientific experiments, it has been discovered that microRNAs (miRNAs) are closely related to many serious human diseases; however, finding the correct miRNA–disease associations is both time consuming and challenging. Therefore, it is very necessary to develop some new methods. Although the existing methods are very helpful in this regard, they all present some shortcomings; thus, some new methods need to be developed to overcome these shortcomings. In this study, a method based on dual network sparse graph regularized matrix factorization (DNSGRMF) was proposed, which increased the sparsity by adding the L2,1-norm. Moreover, Gaussian interaction profile kernels were introduced. The experiments showed that our method was feasible and had a high AUC value. Additionally, the five-fold cross-validation method was used to evaluate this method. A simulation experiment was used to predict some new associations on the datasets, and the obtained experimental results were satisfactory, which proved that our method was indeed feasible.

Graphical abstract: Dual-network sparse graph regularized matrix factorization for predicting miRNA–disease associations

Back to tab navigation

Publication details

The article was received on 23 Oct 2018, accepted on 21 Jan 2019 and first published on 22 Jan 2019


Article type: Research Article
DOI: 10.1039/C8MO00244D
Citation: Mol. Omics, 2019, Advance Article

  •   Request permissions

    Dual-network sparse graph regularized matrix factorization for predicting miRNA–disease associations

    M. Gao, Z. Cui, Y. Gao, J. Liu and C. Zheng, Mol. Omics, 2019, Advance Article , DOI: 10.1039/C8MO00244D

Search articles by author

Spotlight

Advertisements