[1]WANG Zhongyuan,LIU Jinglei.Kernel approximation of a low-rank block matrix[J].CAAI Transactions on Intelligent Systems,2019,14(6):1209-1216.[doi:10.11992/tis.201904058]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
14
Number of periods:
2019 6
Page number:
1209-1216
Column:
学术论文—人工智能基础
Public date:
2019-11-05
- Title:
-
Kernel approximation of a low-rank block matrix
- Author(s):
-
WANG Zhongyuan; LIU Jinglei
-
School of Computer and Control Engineering, Yantai University, Yantai 264005, China
-
- Keywords:
-
low-rank approximation; block diagonal matrix; sparse matrix; kernel approximation; matrix factorization; alternating direction method of multipliers (ADMM); subspace clustering; image identification
- CLC:
-
TP181
- DOI:
-
10.11992/tis.201904058
- Abstract:
-
In order to explore the matrix decomposition problem under structural constraints, irrelevance of data representation between classes was enhanced in this paper by minimizing the diagonal outside the block, thus realizing the block constraint, i.e., the data is derived from different cluster structures. It is a local structure constraint. At the same time, by enhancing the self-expressing property of the sample and narrowing the gap between samples, the correlation of the data representation in the class was enhanced, thereby realizing the low-rank constraint, i.e., the redundancy of the data row was a constraint of the global structure, thereby realizing the low-rank constraint. A kernel approximation algorithm for low-rank block matrix was then designed and solved iteratively by alternating the direction method of multipliers (ADMM). Finally, the method was tested on face recognition and character recognition. Experimental results showed that the proposed low-rank block matrix decomposition algorithm has certain advantages in solving speed and approximate accuracy.