CoChat

netNMF-sc: leveraging gene–gene interactions for imputation and dimensionality reduction in single-cell expression analysis

Open access
Elyanow, Rebecca, Dumitrascu, Bianca, Engelhardt, Barbara E., Raphael, Benjamin J. · 2020 · Genome Research

Published version of a preprint

Cited by 109

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Abstract

Single-cell RNA-sequencing (scRNA-seq) enables high-throughput measurement of RNA expression in single cells. However, because of technical limitations, scRNA-seq data often contain zero counts for many transcripts in individual cells. These zero counts, or dropout events, complicate the analysis of scRNA-seq data using standard methods developed for bulk RNA-seq data. Current scRNA-seq analysis methods typically overcome dropout by combining information across cells in a lower-dimensional space, leveraging the observation that cells generally occupy a small number of RNA expression states. We introduce netNMF-sc, an algorithm for scRNA-seq analysis that leverages information across both cells and genes. netNMF-sc learns a low-dimensional representation of scRNA-seq transcript counts using network-regularized non-negative matrix factorization. The network regularization takes advantage of prior knowledge of gene–gene interactions, encouraging pairs of genes with known interactions to be nearby each other in the low-dimensional representation. The resulting matrix factorization imputes gene abundance for both zero and nonzero counts and can be used to cluster cells into meaningful subpopulations. We show that netNMF-sc outperforms existing methods at clustering cells and estimating gene–gene covariance using both simulated and real scRNA-seq data, with increasing advantages at higher dropout rates (e.g., >60%). We also show that the results from netNMF-sc are robust to variation in the input network, with more representative networks leading to greater performance gains.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/gr.251603.119

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 32

  1. Abadi M, Agarwal A, Barham P, Brevdo E, Chen Z, Citro C, Corrado GS, Davis A, Dean J, Devin M, et al . 2016. TensorFlow: large-scale machine learning on heterogeneous distributed systems. arXiv:1603.04467 [cs.DC]. · arXiv
  2. 10.18547/gcb.2017.vol3.iss1.e46 · DOI · Paper page
  3. Cai D , He X , Wu X , Han J . 2008. Non-negative matrix factorization on manifold. In Eighth IEEE International Conference on Data Mining, 2008 (ICDM'08), pp. 63–72. IEEE, New York. · DOI · Paper page
  4. 10.1093/nar/gkp1015 · DOI · Paper page
  5. 10.1038/cr.2016.84 · DOI
  6. 10.1093/bioinformatics/btz177 · DOI
  7. Févotte C , Cemgil AT . 2009. Nonnegative matrix factorizations as probabilistic inference in composite models. In 2009 17th European Signal Processing Conference, Glasgow, UK, pp. 1913–1917. IEEE, New York. · DOI
  8. 10.1002/dvdy.24485 · DOI
  9. Gong C , Tao D , Yang J , Fu K . 2014. Signed Laplacian embedding for supervised dimension reduction. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1847–1853. Québec City, Québec, Canada. · DOI
  10. 10.1038/s41587-019-0113-3 · DOI · Paper page
  11. 10.1038/nmeth.2651 · DOI · Paper page
  12. 10.1038/s41592-018-0033-z · DOI · Paper page
  13. Kingma DP , Ba J . 2014. Adam: a method for stochastic optimization. arXiv:1412.6980 [cs.LG]. · arXiv
  14. Kunegis J , Schmidt S , Lommatzsch A , Lerner J , De Luca EW , Albayrak S . 2010. Spectral analysis of signed graphs for clustering, prediction and visualization. In Proceedings of the 2010 SIAM International Conference on Data Mining, pp. 559–570. SIAM, Columbus, Ohio. · DOI · Paper page
  15. 10.1038/44565 · DOI · Paper page
  16. 10.1038/s41467-018-03405-7 · DOI · Paper page
  17. 10.1186/s13059-017-1188-0 · DOI · Paper page
  18. 10.1101/397588 · DOI · Paper page
  19. 10.1016/j.cell.2015.05.002 · DOI · Paper page
  20. 10.1093/nar/gku1163 · DOI · Paper page
  21. Prabhakaran S , Azizi E , Carr A , Peer D . 2016. Dirichlet process mixture model for correcting technical variation in single-cell gene expression data. In International Conference on Machine Learning, pp. 1070–1079. New York.
  22. 10.12688/f1000research.13511.3 · DOI · Paper page
  23. 10.3389/fimmu.2017.00198 · DOI · Paper page
  24. 10.1186/s12918-019-0699-6 · DOI
  25. 10.1038/s41587-019-0379-5 · doi:10.1038/s41587-019-0379-5 · Paper page
  26. 10.1038/nrg2484 · DOI · Paper page
  27. 10.1038/nmeth.4207 · DOI · Paper page
  28. 10.1186/gb-2010-11-5-r53 · DOI · Paper page
  29. 10.1371/journal.pcbi.1003777 · DOI · Paper page
  30. 10.1093/nar/gkw868 · DOI
  31. 10.1214/17-AOAS1110 · DOI · Paper page
  32. 10.1038/nprot.2016.154 · DOI · Paper page

Cited by

See all 109

Metadata

Authors
Elyanow, R., Dumitrascu, B., Engelhardt, B. E., & Raphael, B. J.
Venue
Genome Research
Published
2020-01-28
Volume
30
Issue
2
Pages
195-204
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W3003185417
Cited by
109
References
19
Type
posted content
Language
en
Open access
bronze
Funders
  • Chan Zuckerberg Initiative Donor-Advised Fund (2018-182608, 1005664, 1005667)
  • Silicon Valley Community Foundation
  • National Science Foundation (1750729)
  • National Institutes of Health (NIH),
  • National Human Genome Research Institute (R01HL133218)
  • NSF (CCF-1053753)
  • NIH, NHGRI (R01HG007069)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.