A Fast and Accurate Matrix Completion Method Based on QR Decomposition and L(2,1) -Norm Minimization.

Liu Q, Davoine F, Yang J, Cui Y, Jin Z, Han F

Open source

DOI
10.1109/tnnls.2018.2851957
Published
2019 Mar
Container
IEEE transactions on neural networks and learning systems
Publisher
Not recorded
Open access
no

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/tnnls.2018.2851957,
  title = {A Fast and Accurate Matrix Completion Method Based on QR Decomposition and L(2,1) -Norm Minimization.},
  author = {Liu Q and Davoine F and Yang J and Cui Y and Jin Z and Han F},
  year = {2019},
  journal = {IEEE transactions on neural networks and learning systems},
  doi = {10.1109/tnnls.2018.2851957},
  url = {https://doi.org/10.1109/tnnls.2018.2851957}
}

RIS

TY  - JOUR
TI  - A Fast and Accurate Matrix Completion Method Based on QR Decomposition and L(2,1) -Norm Minimization.
AU  - Liu Q
AU  - Davoine F
AU  - Yang J
AU  - Cui Y
AU  - Jin Z
AU  - Han F
PY  - 2019
JO  - IEEE transactions on neural networks and learning systems
DO  - 10.1109/tnnls.2018.2851957
UR  - https://doi.org/10.1109/tnnls.2018.2851957
ER  -

APA

Q, L., F, D., J, Y., Y, C., Z, J., & F, H. (2019). A Fast and Accurate Matrix Completion Method Based on QR Decomposition and L(2,1) -Norm Minimization.. IEEE transactions on neural networks and learning systems. https://doi.org/10.1109/tnnls.2018.2851957

Source records