2025
One-step Incomplete Multi-view Clustering based on Bipartite Graph Learning
ICASSP 2025accepted
Although previous graph-based multi-view clustering algorithms have made remarkable progress, most of them still face the following two limitations: 1. Many existing methods rely on k-means for the discretization of spectral embeddings, which cannot directly learn graphs with discrete cluster struct…