TY - JOUR
T1 - Adaptive Sample-Level Graph Combination for Partial Multiview Clustering
AU - Yang, Liu
AU - Shen, Chenyang
AU - Hu, Qinghua
AU - Jing, Liping
AU - Li, Yingbo
N1 - Funding Information:
Manuscript received November 12, 2018; revised June 27, 2019 and September 19, 2019; accepted November 2, 2019. Date of publication November 15, 2019; date of current version January 23, 2020. This work was supported in part by the National Natural Science Foundation of China under Grant 61702358, Grant 61822601, Grant 61732011, Grant 61773050, Grant 61632004, Grant 61432011, Grant U1435212, and Grant 91746107, in part by the Beijing Natural Science Foundation under Grant Z180006, in part by the Beijing Municipal Science and Technology Commission under Grant Z181100008918012, in part by the Key Scientific and Technological Support Projects of Tianjin Key R&D Program under Grant 18YFZCGX00390, in part by the National Key Research and Development Program under Grant 2017YFC1703506, and in part by the Fundamental Research Funds for the Central Universities under Grant 2019JBZ110). The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Sen-Ching Samson Cheung. (Corresponding author: Qinghua Hu.) L. Yang and Q. Hu are with the College of Intelligence and Computing, Tianjin University, Tianjin 300350, China (e-mail: yangliuyl@tju.edu.cn; huqinghua@tju.edu.cn).
Publisher Copyright:
© 1992-2012 IEEE.
PY - 2020
Y1 - 2020
N2 - Multiview clustering explores complementary information among distinct views to enhance clustering performance under the assumption that all samples have complete information in all available views. However, this assumption does not hold in many real applications, where the information of some samples in one or more views may be missing, leading to partial multiview clustering problems. In this case, significant performance degeneration is usually observed. A collection of partial multiview clustering algorithms has been proposed to address this issue and most treat all different views equally during clustering. In fact, because different views provide features collected from different angles/feature spaces, they might play different roles in the clustering process. With the diversity of different views considered, in this study, a novel adaptive method is proposed for partial multiview clustering by automatically adjusting the contributions of different views. The samples are divided into complete and incomplete sets, while a joint learning mechanism is established to facilitate the connection between them and thereby improve clustering performance. More specifically, the method is characterized by a joint optimization model comprising two terms. The first term mines the underlying cluster structure from both complete and incomplete samples by adaptively updating their importance in all available views. The second term is designed to group all data with the aid of the cluster structure modeled in the first term. These two terms seamlessly integrate the complementary information among multiple views and enhance the performance of partial multiview clustering. Experimental results on real-world datasets illustrate the effectiveness and efficiency of our proposed method.
AB - Multiview clustering explores complementary information among distinct views to enhance clustering performance under the assumption that all samples have complete information in all available views. However, this assumption does not hold in many real applications, where the information of some samples in one or more views may be missing, leading to partial multiview clustering problems. In this case, significant performance degeneration is usually observed. A collection of partial multiview clustering algorithms has been proposed to address this issue and most treat all different views equally during clustering. In fact, because different views provide features collected from different angles/feature spaces, they might play different roles in the clustering process. With the diversity of different views considered, in this study, a novel adaptive method is proposed for partial multiview clustering by automatically adjusting the contributions of different views. The samples are divided into complete and incomplete sets, while a joint learning mechanism is established to facilitate the connection between them and thereby improve clustering performance. More specifically, the method is characterized by a joint optimization model comprising two terms. The first term mines the underlying cluster structure from both complete and incomplete samples by adaptively updating their importance in all available views. The second term is designed to group all data with the aid of the cluster structure modeled in the first term. These two terms seamlessly integrate the complementary information among multiple views and enhance the performance of partial multiview clustering. Experimental results on real-world datasets illustrate the effectiveness and efficiency of our proposed method.
KW - Partial multiview clustering
KW - adaptive weights
KW - graph combination
UR - http://www.scopus.com/inward/record.url?scp=85078528194&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078528194&partnerID=8YFLogxK
U2 - 10.1109/TIP.2019.2952696
DO - 10.1109/TIP.2019.2952696
M3 - Article
C2 - 31751273
AN - SCOPUS:85078528194
SN - 1057-7149
VL - 29
SP - 2780
EP - 2794
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
M1 - 8902218
ER -