Discrete correntropy-based multi-view anchor-graph clustering

Graph-based clustering commonly provides promising clustering effectiveness as it can preserve samples' local geometric information. Inspired by it, multi-view graph clustering was developed to integrate complementary information among graphs of diverse views and it has received intensive attention recently. Nevertheless, on the one hand, most existing methods require extra k-means after obtaining embedding representations to generate a discrete cluster indicator, which reduces effectiveness due to the two-stage mismatch. On the other hand, numerous complex noises in real-world multi-view data challenge the robustness of existing clustering methods. In this paper, we established a discrete correntropy-based multi-view anchor-graph clustering (DCMAC) model that not only emphasizes the aforementioned issues but also makes use of anchor graphs to improve the efficiency of the graph construction stage. To optimize this non-convex model, we propose a fast half-quadratic based coordinate descent strategy to acquire the discrete cluster indicator directly without extra k-means. Furthermore, we extend the DCMAC model to a single-view form and provide optimization strategies for it. Extensive experiments illustrate that the proposed method is effective and robust compared to those advanced baselines.