Multi-view clustering via double spaces structure learning and adaptive multiple projection regression learning

Abstract

Multi-view clustering aims to group objects with high similarity into one group according to the heterogeneous features of different views. The graph-based clustering methods have obtained excellent results. However, there remain a few common drawbacks. For example, some methods do not consider graphs' high-order structure information. Thus, fuller data information cannot be obtained. In addition, some methods remove noise, outliers, and redundant information in the graph learning phase, resulting in the loss of graph information. Furthermore, using predefined graphs cannot exploit complementary information between views. A triple strategy-based multi-view clustering method is presented to solve the above issues. First, Laplacian graphs are used for fusion learning, and the underlying first-order and second-order structure information among views are explored simultaneously. Then, a label fusion scheme is designed to eliminate noise, outliers, and redundant information and to mine the intrinsic characteristics of data labels. Besides, the consistent label matrix in adaptive regression learning is used to explore complementary information between views in a mutually guided learning way. Finally, the objective function is solved by using an efficient iterative method. Six types of experiments are conducted on eleven real-world multi-view datasets, and the conclusions that can be drawn are: (1) the proposed algorithm achieves the best results in terms of clustering accuracy on ten datasets with an average accuracy improvement of 5.11% compared to other algorithms. Specifically, the accuracy improved by 9.05% on dataset HW and 10.95% on dataset Reuters compared to the second results; (2) The ablation experiments confirm that the different learning strategies included in the proposed algorithm allow it to achieve better clustering performance.