Siyuan Lu
ABSTRACT
In recent years, with the rapid development of big data technology, the matrix completion is often used for data recovery, and how to improve the accuracy of matrix completion is a key issue. This paper proposes a matrix completion method based on pattern classification, called PCRE, to improve data recovery performance. Since the hidden similarity within the data is a significant factor affecting the overall performance, the method PCRE uses non-negative matrix decomposition to extract the patterns of the data and accordingly rearranges the data matrix to fit for the matrix completion. Experiments are conducted by using PM 10 monitoring data collected by 34 sensors in Beijing in 2019 (totally 351 days). The results show that, compared with existing methods, PCRE improves the accuracy of data recovery with a shorter computation time.
- W.DAI,O.MILENKOVIC,E. KERMAN (2011). Subspace Evolution and Transfer form Low-Rank Matrix Completion[J].IEEE Transactions on Signal Processing, 59(7):3120-3132.Google Scholar
- PM 10 data in beijing, http://www.bjmemc.com.cn/jsps/jsp/zxgk/hjzljc.jsp.Google Scholar
- E. J. Candes, B. Recht (2008). Exact low-rank matrix completion via convex optimization, in: 2008 46th Annual Allerton Conference on Communication, Control, and Computing, pp. 806–812. doi:10.1109/ALLERTON.2008.4797640.Google ScholarCross Ref
- E. J. Candes, T. Tao (2010). The power of convex relaxation: Near-optimal matrix completion, IEEE Transactions on Information Theory 56 (5) 2053–2080. doi:10.1109/TIT.2010.2044061.Google ScholarDigital Library
- Qu L, Li L, Zhang Y , (2009). PPCA-Based Missing Data Imputation for Traffic Flow Volume: A Systematical Approach[J]. IEEE Transactions on Intelligent Transportation Systems, 10(3):512-522.Google ScholarDigital Library
- Le W (2017). Data collection and data completion based on the theory of sparse representation.Google Scholar
- Peng C, Jin X, Wong, K C, Shi, M., P Liò (2012). Collective human mobility pattern from taxi trips in urban area, PLOS ONE 7. doi:10.1371/journal.pone.0034487.Google Scholar
- Liu X, Liu, X, Wang Y, Pu J, Zhang X (2016). Detecting anomaly in traffic flow from road similarity analysis, Springer International Publishing. doi:10.1007/978-3-319-39958-4_8.Google ScholarCross Ref
- D. D. Lee, H. S. Seung (1999). Learning the parts of objects by nonnegative matrix factorization, Nature 401 (7). doi:10.1038/44565.Google Scholar
- J. Deng, K. Xie (2017). Typical algorithm for low rank matrix completion, Electronic production (9) 40–43.doi:10.16589.Google Scholar
- Chen L, Chen SC (2017). Survey on matrix completion models and algorithms. RuanJianXueBao/Journal of Software, 28(6):1547−1564 (in Chinese). http://www.jos.org.cn/1000-9825/5260.htmGoogle Scholar
- Liu Z, L. Vandenberghe L (2009). Interior-Point Method for Nuclear Norm Approximation with Application to System Identification[J]. SIAM Journal on Matrix Analysis and Applications, 31(3):1235-1256.Google ScholarDigital Library
- TOH K C, YUN S (2010). An Accelerated Proximal Gradient Algorithm form Nuclear Norm Regularized Least Squares Problems[J].Pacific J. Optimaization, 6.615-640.Google Scholar
- RECHT B, FAZEL M,PARRILO P A (2010). Guaranteed Minimum-Rank Solutions of Linear Matrix Equation Equations Via Nuclear Norm Minimization[J]. SIAM Rev., 52:471-501.Google ScholarDigital Library
- CAI J, CANDES E J, SHEN Z (2010). A Singular Value Thresholding Algorithm for Matrix Completion[J] SIAM J. Op, 20:1956-1982.Google Scholar
- MAS, GOLDFARB D, CHEN L (2011). Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization[J]. Mathematical Programming, 12:321-353.Google Scholar
- Raghunandan H. Keshava, Andrea Montanari, Sewoong Oh (2010). Matrix completion from a few entries[J]. IEEE Transactions on Information Theory, 56(6):2980-2998.Google ScholarDigital Library
- WEN Z,YIN W,ZHANG Y (2012). Solving A Low-Rank Factorization Model for Matrix Completion by A Nonlinear Successive Over-Relaxation Algorithm[J]. Math.Prog. Comp., 4(4):333-361.Google ScholarCross Ref
- D. Zhang, Y. Hu, J. Ye, X. Li and X. He (2012). Matrix completion by Truncated Nuclear Norm Regularization," 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2192-2199.Google Scholar
- Chen Y, Fan J, Ma C, (2019). Inference and uncertainty quantification for noisy matrix completion[J]. Proceedings of the National Academy of Sciences, 116(46): 22931-22937.Google ScholarCross Ref
- Nguyen L T, Kim J, Shim B (2019). Low-rank matrix completion: A contemporary survey[J]. IEEE Access, 7: 94215-94237.Google ScholarCross Ref
Index Terms
- Data Matrix Completion Based on Pattern Classification
Recommendations
On robust matrix completion with prescribed eigenvalues
Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and controlMatrix completion with prescribed eigenvalues is a special kind of inverse eigenvalue problems. Thus far, only a handful of specific cases concerning its existence and construction have been studied in the literature. The general problem where the ...
Real and integer Wedderburn rank reduction formulas for matrix decompositions
The Wedderburn rank reduction formula is a powerful method for developing matrix factorizations and many fundamental numerical linear algebra processes. We present a new interpretation of the Wedderburn rank reduction formula and its associated ...
Fast Deterministic Algorithms for Matrix Completion Problems
Ivanyos, Karpinski, and Saxena [SIAM J. Comput., 39 (2010), pp. 3736--3751] have developed a deterministic polynomial time algorithm for finding scalars $x_1, \dots, x_n$ that maximize the rank of the matrix $B_0 + x_1B_1 + \dots + x_nB_n$ for given matrices ...
Comments