Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 61

The DOI matches its Crossref record.

Alternating Least-Squares for Low-Rank Matrix Reconstruction

Zachariah, Dave, Sundin, Martin, Jansson, Magnus, Chatterjee, Saikat · 2012 · IEEE Signal Processing Letters

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.1109/lsp.2012.2188026

Cites

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

No references could be resolved yet.

Research works printed but not linked: 19

  1. wen, 2010, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
  2. 10.1109/TSP.2011.2161471 · doi:10.1109/tsp.2011.2161471
  3. 10.1109/TIT.2010.2054251 · DOI · Paper page
  4. 10.1137/070697835 · DOI · Paper page
  5. 10.1137/100811404 · doi:10.1137/100811404
  6. 10.1016/S0024-3795(02)00505-0 · doi:10.1016/s0024-3795(02)00505-0
  7. kailath, 1980, Linear Systems
  8. kay, 1993, Fundamentals of Statistical Signal Processing Estimation Theory, 1
  9. zachariah, 2011, Supplement Alternating Least-Squares for Low-Rank Matrix Reconstruction
  10. hayes, 1996, Statistical Digital Signal Processing and Modeling
  11. 10.1109/GLOCOM.2010.5684139 · doi:10.1109/glocom.2010.5684139
  12. 10.1109/LSP.2011.2151856 · DOI
  13. cai, 2008, A Singular Value Thresholding Algorithm for Matrix Completion
  14. 10.1109/ACSSC.2010.5757666 · DOI
  15. balzano, 2010, Online Identification and Tracking of Subspaces from Highly Incomplete Information
  16. toh, 2010, An accelerated proximal gradient algorithm, Pac J Optim, 6, 615
  17. 10.1109/JPROC.2009.2035722 · DOI · Paper page
  18. 10.1109/TSP.2006.873502 · doi:10.1109/tsp.2006.873502
  19. 10.1109/TSP.2011.2144977 · doi:10.1109/tsp.2011.2144977

Cited by

Metadata

Authors
Zachariah, D., Sundin, M., Jansson, M., & Chatterjee, S.
Venue
IEEE Signal Processing Letters
Published
2012-04
Volume
19
Issue
4
Pages
231-234
ISSN
  • 1070-9908
  • 1558-2361
Cited by
61
References
0

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.