跳到主要导航 跳到搜索 跳到主要内容

KGLRR: A low-rank representation K-means with graph regularization constraint method for Single-cell type identification

  • Lin Ping Wang
  • , Jin Xing Liu
  • , Jun Liang Shang
  • , Xiang Zhen Kong
  • , Bo Xin Guan
  • , Juan Wang
  • Qufu Normal University

科研成果: 期刊稿件文章同行评审

4 引用 (Scopus)

摘要

Single-cell RNA sequencing technology provides a tremendous opportunity for studying disease mechanisms at the single-cell level. Cell type identification is a key step in the research of disease mechanisms. Many clustering algorithms have been proposed to identify cell types. Most clustering algorithms perform similarity calculation before cell clustering. Because clustering and similarity calculation are independent, a low-rank matrix obtained only by similarity calculation may be unable to fully reveal the patterns in single-cell data. In this study, to capture accurate single-cell clustering information, we propose a novel method based on a low-rank representation model, called KGLRR, that combines the low-rank representation approach with K-means clustering. The cluster centroid is updated as the cell dimension decreases to better from new clusters and improve the quality of clustering information. In addition, the low-rank representation model ignores local geometric information, so the graph regularization constraint is introduced. KGLRR is tested on both simulated and real single-cell datasets to validate the effectiveness of the new method. The experimental results show that KGLRR is more robust and accurate in cell type identification than other advanced algorithms.

源语言英语
文章编号107862
期刊Computational Biology and Chemistry
104
DOI
出版状态已出版 - 6月 2023
已对外发布

指纹图谱

探究 'KGLRR: A low-rank representation K-means with graph regularization constraint method for Single-cell type identification' 的科研主题。它们共同构成独一无二的指纹。

引用此