Name
Title | ||
|---|---|---|
Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization. |
Abstract | ||
|---|---|---|
Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises. Traditional matrix completion algorithms are always based on l2-norm minimization and are sensitive to non-Gaussian noise with outliers. In this paper, we propose a novel robust and fast matrix completion method based on the maximum correntropy criterion (MCC). The correntropy-bas... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TSP.2019.2952057 | IEEE Transactions on Signal Processing |
Keywords | DocType | Volume |
Signal processing algorithms,Kernel,Measurement uncertainty,Cost function,Minimization,Linear programming | Journal | 68 |
ISSN | Citations | PageRank |
1053-587X | 3 | 0.38 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yicong He | 1 | 15 | 1.94 |
| Fei Wang | 2 | 24 | 6.14 |
| Yingsong Li | 3 | 120 | 34.72 |
| Jing Qin | 4 | 15 | 1.64 |
| Badong Chen | 5 | 919 | 65.71 |