MedElevator Войти в исследования
← Поиск публикаций

DOI 10.1016/j.compbiolchem.2026.109475

Медицинская библиотека · Computational biology and chemistry · 2026

PDSFLRR: Low-rank representation with projection distance and sparsity constraints for clustering single-cell RNA sequencing data.

Wang Juan, Zhang Zhenduo

СтатьяПеревод пока не подготовлен

Аннотация

Single-cell RNA sequencing (scRNA-seq) has made it possible to dissect cellular heterogeneity at single-cell resolution, and clustering is a key step in this analysis. Because scRNA-seq data are high-dimensional, sparse, and corrupted by dropout effects, clustering them accurately remains challenging. This paper proposes PDSFLRR, a clustering method built upon low-rank representation (LRR). To overcome the limitation of classical LRR models, which fix the dictionary to the raw data matrix, PDSFLRR learns the dictionary adaptively through a projection matrix, imposes an orthonormality constraint, and adds a projection-distance regularization that preserves local structure in the projected space. A sparse constraint is further incorporated so that the global subspace structure and the local neighborhood structure of the data are captured simultaneously. In addition, the nuclear norm is replaced by the Frobenius norm to avoid expensive singular value decomposition (SVD) computations, and the resulting objective is solved efficiently with the Alternating Direction Method of Multipliers (ADMM). Extensive experiments on twelve real scRNA-seq datasets, comparisons with nine popular clustering methods, and an ablation study show that PDSFLRR delivers accurate clustering results, as measured by normalized mutual information (NMI) and adjusted Rand index (ARI).

Для цитирования: Wang Juan, Zhang Zhenduo. PDSFLRR: Low-rank representation with projection distance and sparsity constraints for clustering single-cell RNA sequencing data.. Computational biology and chemistry. 2026. DOI: 10.1016/j.compbiolchem.2026.109475.
Подготовка и перевод публикации
Обработка статьи · этапы, ошибки и управление
Загрузка состояния…

История · было → стало

Состояние обновляется каждые 5 секунд, пока блок открыт. Процент показывается только там, где известен объём работы. Пауза останавливает продолжение этапа; текущий запрос к источнику может завершиться.

Тип публикации указан по данным источника. Уровень доказательности автоматически не присваивается.