The matrix completion problem is restoring a given matrix with missing entries when handling incomplete data. In many existing researches, rank minimization plays a central role in matrix completion. In this paper, noticing that the locally linear reconstruction can be used to approximate the missing entries, we view the problem from a new perspective and propose an algorithm called locally linear approximation (LLA). The LLA method tries to keep the local structure of the data space while restoring the missing entries from row angle and column angle simultaneously. The experimental results have demonstrated the effectiveness of the proposed method.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1109/TCYB.2017.2713989 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!