CoChat

Tensor Completion Algorithms in Big Data Analytics

Open access
Song, Qingquan, Ge, Hancheng, Caverlee, James, Hu, Xia · 2019 · ACM Transactions on Knowledge Discovery from Data
Cited by 229

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

Abstract

Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining, computer vision, signal processing, and neuroscience. In this survey, we provide a modern overview of recent advances in tensor completion algorithms from the perspective of big data analytics characterized by diverse variety, large volume, and high velocity. We characterize these advances from the following four perspectives: general tensor completion algorithms, tensor completion with auxiliary information (variety), scalable tensor completion algorithms (volume), and dynamic tensor completion algorithms (velocity). Further, we identify several tensor completion applications on real-world data-driven problems and present some common experimental frameworks popularized in the literature along with several available software repositories. Our goal is to summarize these popular methods and introduce them to researchers and practitioners for promoting future research and applications. We conclude with a discussion of key challenges and promising research directions in this community for future exploration.

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.1145/3278607

Cites

154 of 154 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

  • Compressed sensing

    Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994

  • Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

    Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639 · cited 1×

    “mes and show the rapid adaptivity of their method OLSTEC to the changed background. Other video completion examples could be found in [187,220]. 7.5 Compressed Sensing Compressed sensing initiated by [27, 43] in 2006 allows the recovery of a sparse signal from a small number of nonadaptive, linear random measurements…”
    MethodInfluential
  • Matrix Factorization Techniques for Recommender Systems

    Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673 · cited 1×

    “he tensor completion problem in recent years, to the best of our knowledge, we still lack a comprehensive survey to capture the many advances across domains. Existing surveys rest on the matrix level [88, 106, 115, 181] or focus on related topics, e.g., tensor decomposition [4 ,36 51 67 74 99 103 109 110 130 148 167 1…”
    Background
  • Tensor Decompositions and Applications

    Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301 · cited 5×

    “e of big data analytics. 3.1 Decomposition Based Approaches Tensor decompositions or factorizations are powerful tools for extracting meaningful, latent structures in heterogeneous, multi-aspect data [84, 121]. Since real-world datasets are o›en raw and incomplete, many early researches are conducted on tensor decompo…”
    BackgroundMethodInfluential
  • Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

    Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653 · cited 1×

    “s G i 2R I 1 ::: N via »G„X”…„i”=< G i;X >, where each tensor G i has i.i.d. standard normal entries. It enjoys sharp theoretical tools [138] and has been well-studied in signal processing •eld [195] especially in the compressed sensing area [43]. Another widely studied sampling measurement is random Fourier mea…”
    Background
  • Robust principal component analysis?

    Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921 · cited 1×

    “.3.2 Robust Tensor Completion. Robust data analysis plays an instrumental role in dealing with outliers, gross corruptions in completion problem [57]. Drawing upon the advances in robust PCA analysis [22], robust tensor completion is to complete a tensor B by separating it into a low-rank part X plus a sparse part E t…”
    BackgroundInfluential
  • A Singular Value Thresholding Algorithm for Matrix Completion

    Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809 · cited 2×

    “me of ADMM, fZ ng n and fY ng n could be iteratively updated as follows: Z n SVT αn η „A n Y n η ”; Y n Y n +η„Z n A n”; n = 1;2;:::;N; (24) where SVT αn η is the singular value thresholding operator [20] which is a shrinkage operator de•ned as SVT δ„A”= U„diagfσ i δg” +V>, where U„diagfσ ig 1ir”V>represents the…”
    Background
  • A Multilinear Singular Value Decomposition

    De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106 · cited 2×

    “to handle missing values and conduct imputation. 3.1.2 Tucker Based Methods. Tucker decomposition is proposed by Tucker [158] and further developed by Kroonenberg et al. [92] and De Lathauwer et al. [35]. Given an Nth-order tensor X, its Tucker decomposition is de•ned as an approximation of a core tensor C 2RΠNn =1 R…”
    BackgroundMethodInfluential
  • Factorization meets the neighborhood: a multifaceted collaborative filtering model

    Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852

Show all 154 references

Metadata

Authors
Song, Q., Ge, H., Caverlee, J., & Hu, X.
Venue
ACM Transactions on Knowledge Discovery from Data
Published
2019-01-09
Volume
13
Issue
1
Pages
1-48
ISSN
  • 1556-4681 (ISSN-L)
  • 1556-472X
OpenAlex
W2963472624
Cited by
229
References
154
FWCI
10.74
Type
journal article
Language
en
Open access
bronze

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Tensor Completion Algorithms in Big Data Analytics. https://app.cochat.ai/papers/10.1145/3278607
The paper
Song, Q., Ge, H., Caverlee, J., & Hu, X. (2019). Tensor Completion Algorithms in Big Data Analytics. ACM Transactions on Knowledge Discovery from Data. https://doi.org/10.1145/3278607

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.