INCOMPLETE multi-view clustering based on low-rank adaptive graph learning

The challenge of acquiring complete data has led to substantial progress in incomplete multi-view clustering (IMVC) methods. Because graph structures can be excellent representations of data structure relationships, exceptional performance in handling incomplete data is demonstrated by graph-based methods at present. However, these methods still have their limitations. Most incomplete multi-view algorithms primarily focus on local information, neglecting global information. Therefore, these methods cannot dynamically recover the structural relationships in incomplete data by harnessing potential information from multiple perspectives and overall structural information. In response to the aforementioned concerns, we introduced an IMVC based on low-rank adaptive graph learning (IMVC-LAGL). This method initially constructs an affinity matrix based on the inter-view adjacency relationships. It also utilizes tensor low-rank constraints and consensus representation learning to explore higher-order correlations among different views. Subsequently, it adaptively reconstructs the incomplete graph structure to ultimately obtain a complete affinity relationship. It leads to excellent clustering results by integrating relevant information within views, overall structural information and potential information from multiple perspectives. We conducted experiments comparing our algorithm with eight incomplete multi-view algorithms using five different evaluation metrics. The results show that our algorithm achieves the best clustering results across eight datasets with varying missing rates. Particularly in the BBCSport dataset and YaleB dataset, the clustering accuracy of our algorithm is improved by 19.83 % and 16.41 %, respectively, compared with the second-best algorithm, under a 50 % missing rate.