IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6659695.html
   My bibliography  Save this article

Prediction of circRNA-miRNA Associations Based on Network Embedding

Author

Listed:
  • Wei Lan
  • Mingrui Zhu
  • Qingfeng Chen
  • Jianwei Chen
  • Jin Ye
  • Jin Liu
  • Wei Peng
  • Shirui Pan
  • Hassan Zargarzadeh

Abstract

circRNA is a novel class of noncoding RNA with closed-loop structure. Increasing biological experiments have shown that circRNAs play an important role in many diseases by acting as a miRNA sponge to indirectly regulate the expression of miRNA target genes. Therefore, predicting associations between circRNAs and miRNAs can promote the understanding of pathogenesis of disease. In this paper, we propose a new computational method, NECMA, based on network embedding to predict potential associations between circRNAs and miRNAs. In our method, the Gaussian interaction profile (GIP) kernel similarities of circRNA and miRNA are calculated based on the known circRNA-miRNA associations, respectively. Then, the circRNA-miRNA association network, circRNA GIP kernel similarity network, and miRNA GIP kernel similarity network are utilized to construct the heterogeneous network. Furthermore, the network embedding algorithm is used to extract potential features of circRNA and miRNA from the heterogeneous network, respectively. Finally, the associations between circRNAs and miRNAs are predicted by using neighborhood regularization logic matrix decomposition and inner product. The performance of NECMA is evaluated by using ten-fold cross-validation. The results show that this method has better prediction accuracy than other state-of-the-art methods.

Suggested Citation

  • Wei Lan & Mingrui Zhu & Qingfeng Chen & Jianwei Chen & Jin Ye & Jin Liu & Wei Peng & Shirui Pan & Hassan Zargarzadeh, 2021. "Prediction of circRNA-miRNA Associations Based on Network Embedding," Complexity, Hindawi, vol. 2021, pages 1-10, September.
  • Handle: RePEc:hin:complx:6659695
    DOI: 10.1155/2021/6659695
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6659695.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6659695.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6659695?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6659695. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.