期刊
INTERNATIONAL JOURNAL OF COMPUTER VISION
卷 128, 期 8-9, 页码 2344-2361出版社
SPRINGER
DOI: 10.1007/s11263-020-01307-0
关键词
Multi-view representation learning; Subspace clustering; Low-rank tensor; Constraint matrix
资金
- National Natural Science Foundation of China [61976151, 61732011, 61925602, U1636214]
- Beijing Natural Science Foundation [4172068]
Self-representation based subspace learning has shown its effectiveness in many applications. In this paper, we promote the traditional subspace representation learning by simultaneously taking advantages of multiple views and prior constraint. Accordingly, we establish a novel algorithm termed as Tensorized Multi-view Subspace Representation Learning. To exploit different views, the subspace representation matrices of different views are regarded as a low-rank tensor, which effectively models the high-order correlations of multi-view data. To incorporate prior information, a constraint matrix is devised to guide the subspace representation learning within a unified framework. The subspace representation tensor equipped with a low-rank constraint models elegantly the complementary information among different views, reduces redundancy of subspace representations, and then improves the accuracy of subsequent tasks. We formulate the model with a tensor nuclear norm minimization problem constrained with l(2,1)-norm and linear equalities. The minimization problem is efficiently solved by using an Augmented Lagrangian Alternating Direction Minimization method. Extensive experimental results on diverse multi-view datasets demonstrate the effectiveness of our algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据