TY - GEN
T1 - Multi-view clustering via simultaneously learning graph regularized low-rank tensor representation and affinity matrix
AU - Chen, Yongyong
AU - Xiao, Xiaolin
AU - Zhou, Yicong
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - Low-rank tensor representation-based multi-view clustering has become an efficient method for data clustering due to the robustness to noise and the preservation of the high order correlation. However, existing algorithms may suffer from two common problems: (1) the local view-specific geometrical structures and the various importance of features in different views are neglected; (2) the low-rank representation tensor and the affinity matrix are learned separately. To address these issues, we propose a novel framework to learn the Graph regularized Low-rank Tensor representation and the Affinity matrix (GLTA) in a unified manner. Besides, the manifold regularization is exploited to preserve the view-specific geometrical structures, and the various importance of different features is automatically calculated when constructing the final affinity matrix. An efficient algorithm is designed to solve GLTA using the augmented Lagrangian multiplier. Extensive experiments on six real datasets demonstrate the superiority of GLTA over the state-of-the-arts.
AB - Low-rank tensor representation-based multi-view clustering has become an efficient method for data clustering due to the robustness to noise and the preservation of the high order correlation. However, existing algorithms may suffer from two common problems: (1) the local view-specific geometrical structures and the various importance of features in different views are neglected; (2) the low-rank representation tensor and the affinity matrix are learned separately. To address these issues, we propose a novel framework to learn the Graph regularized Low-rank Tensor representation and the Affinity matrix (GLTA) in a unified manner. Besides, the manifold regularization is exploited to preserve the view-specific geometrical structures, and the various importance of different features is automatically calculated when constructing the final affinity matrix. An efficient algorithm is designed to solve GLTA using the augmented Lagrangian multiplier. Extensive experiments on six real datasets demonstrate the superiority of GLTA over the state-of-the-arts.
KW - Adaptive weights
KW - Local manifold
KW - Low-rank tensor representation
KW - Multi-view clustering
KW - Tucker decomposition
UR - https://www.scopus.com/pages/publications/85071033152
U2 - 10.1109/ICME.2019.00234
DO - 10.1109/ICME.2019.00234
M3 - 会议稿件
AN - SCOPUS:85071033152
T3 - Proceedings - IEEE International Conference on Multimedia and Expo
SP - 1348
EP - 1353
BT - Proceedings - 2019 IEEE International Conference on Multimedia and Expo, ICME 2019
PB - IEEE Computer Society
T2 - 2019 IEEE International Conference on Multimedia and Expo, ICME 2019
Y2 - 8 July 2019 through 12 July 2019
ER -