Proceedings of the AAAI Conference on Artificial Intelligence · 2023 · 18 citations · 24 references
ComputingComputer ScienceBig Data AnalyticsData VisualizationInformation VisualizationGraph AnalyticsGraph-based LearningAnchorsBenchmark DatasetsClusteringMulti-view ClusteringRegularizationRegularization TechniquesScalable ClusteringViews
Although multi-view clustering (MVC) has achieved remarkable performance by integrating the complementary information of views, it is inefficient when facing scalable data. Proverbially, anchor strategy can mitigate such a challenge a certain extent. However, the unsupervised dynamic strategy usually cannot obtain the optimal anchors for MVC. The main reasons are that it does not consider the fairness of different views and lacks the priori supervised guidance. To completely solve these problems, we first propose the priori anchor graph regularization (PAGG) for scalable multi-view bipartite graph clustering, dubbed as SMGC method. Specifically, SMGC learns a few representative consensus anchors to simulate the numerous view data well, and constructs a bipartite graph to bridge the affinities between the anchors and original data points. In order to largely improve the quality of anchors, PAGG predefines prior anchor labels to constrain the anchors with discriminative cluster structure and fair view allocation, such that a better bipartite graph can be obtained for fast clustering. Experimentally, abundant of experiments are accomplished on six scalable benchmark datasets, and the experimental results fully demonstrate the effectiveness and efficiency of our SMGC.
24
Zheng Zhang, Li Liu, Fumin Shen et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2018 · 587 citations
Multiview Consensus Graph Clustering
Kun Zhan, Feiping Nie, Jing Wang et al. · IEEE Transactions on Image Processing · 2018 · 532 citations
Multi-view low-rank sparse subspace clustering
Maria Brbić, Ivica Kopriva · Pattern Recognition · 2017 · 476 citations · Full text