-
Big Data and Information Analytics, 2016, 1(2): 139-161. doi: 10.3934/bdia.2016001
Article
-
Export file:
Format
- RIS(for EndNote,Reference Manager,ProCite)
- BibTex
- Text
Content
- Citation Only
- Citation and Abstract
A Review on Low-Rank Models in Data Analysis
1. Key Lab. of Machine Perception (MOE), School of EECS Peking University, Beijing, China;
2. Cooperative Medianet Innovation Center Shanghai Jiao Tong University, Shanghai, China
Nowadays we are in the big data era. The high-dimensionality of data imposes big challenge on how to process them effectively and efficiently. Fortunately, in practice data are not unstructured. Their samples usually lie around low-dimensional manifolds and have high correlation among them. Such characteristics can be effectively depicted by low rankness. As an extension to the sparsity of first order data, such as voices, low rankness is also an effective measure for the sparsity of second order data, such as images. In this paper, I review the representative theories, algorithms and applications of the low rank subspace recovery models in data processing.
Figure/Table
Supplementary
Article Metrics
