lncRNA-disease association prediction based on optimizing measures of multi-graph regularized matrix factorization

In this paper, we propose a novel lncRNA-disease association prediction algorithm based on optimizing measures of multi-graph regularized matrix factorization (OM-MGRMF). The method first calculates the semantic similarity of diseases, the functional similarity of lncRNAs, and the Gaussian similarity of both. It then constructs a new lncRNA-disease association matrix by using the K-nearest-neighbor (KNN) algorithm. Finally, the objective function is constructed through the utilization of ranking measures and multi-graph regularization constraints. This objective function is iteratively optimized by an adaptive gradient descent algorithm. The experimental results of OM-MGRMF outperform those of classical methods in both K-fold cross-validation.

Authors

Institutions

Publication Details

Journal
Computer Methods in Biomechanics & Biomedical Engineering
Published
2025-03-20
DOI
https://doi.org/10.1080/10255842.2025.2479854
Citations
4
Primary Topic
Cancer-related molecular mechanisms research
Type
article
Field-Weighted Citation Impact
3.75
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

lncRNA-disease association prediction based on optimizing measures of multi-graph regularized matrix factorization

Yunzhong Song, Bin Yao
4 citations
Computer Methods in Biomechanics & Biomedical Engineering
Cancer-related molecular mechanisms research
3.75
article

lncRNA-disease association prediction based on optimizing measures of multi-graph regularized matrix factorization

Yunzhong Song, Bin Yao
article en
4 citations

Abstract

In this paper, we propose a novel lncRNA-disease association prediction algorithm based on optimizing measures of multi-graph regularized matrix factorization (OM-MGRMF). The method first calculates the semantic similarity of diseases, the functional similarity of lncRNAs, and the Gaussian similarity of both. It then constructs a new lncRNA-disease association matrix by using the K-nearest-neighbor (KNN) algorithm. Finally, the objective function is constructed through the utilization of ranking measures and multi-graph regularization constraints. This objective function is iteratively optimized by an adaptive gradient descent algorithm. The experimental results of OM-MGRMF outperform those of classical methods in both K-fold cross-validation.

Computer Methods in Biomechanics & Biomedical Engineering
Henan Polytechnic University (CN)
Openalex Percentile: Top 7%
Cancer-related molecular mechanisms research
3.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.