.png){kind=icon}
返回
Protein functional annotation refinement based on graph regularized l1-norm PCA
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2016.05.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As various high-throughput experimental techniques are developed to characterize biological systems at the genome scale, vast protein function data have been collected. However, these functional tags are often imprecise and/or incomplete, resulting in unsatisfactory performances in function-related experiments and applications. Therefore, the refinement of protein functional annotation has been one of the fundamental challenges in post-genomic era. In this paper, the refinement problem is formulated as a decomposition of the available functional tag matrix X with noise and missing data into latent protein features U and function representations V. Specifically, we aim to minimize the sparse error between original tag matrix X and the recovery matrix, and incorporate the protein-protein interactions and the function-function correlations to regularize two latent feature matrices U and V respectively. Finally, all these components are integrated into a convex optimization model, named graph regularized l(1)-norm PCA, and an efficient convergence iterative procedure is proposed for the model based on augmented lagrangian multiplier method. We conduct extensive experiments on yeast database and the results indicate that our new refinement method outperforms consistently other related state-of-the-art approaches by the average precision and average Fl-score. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Graph regularization
Sparse coding
Tag refinement
Protein-Protein interaction networks
Function-Function correlations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏Late seroma during pregnancy, a rare complication in prosthetic breast augmentation: Case report
PREAI
分享收藏
查看更多内容