<p>Bipartite graph-based multi-view clustering conducts clustering of samples in accordance with the relationships between samples and anchors, and has demonstrated significant advancements in recent years. Predefined bipartite graphs with fixed anchors may not reflect the underlying clustering structure accurately, leading to the degradation of clustering performance. To address this problem, we propose a Structure Sparsity-Induced Bipartite Graph (SSBG) learning method to dynamically construct view-specific bipartite graphs with automatically learned anchors. Concretely, representative anchors of each view are learned by integrating key samples selected by introducing a selection matrix with structure sparsity. Meanwhile, the feature matrix of each view is reconstructed by the learned anchors and the corresponding bipartite graph in a self-representation manner. Due to the representativeness of the anchors and the advantages of the self-representation model in representing complex relationships, the consistent bipartite graph fused from multiple views possesses enhanced ability to represent the underlying clustering structure. A converged iterating algorithm is developed to optimize for the objective function, and the final clustering partition can be directly obtained according to the connected components of the fused consistent bipartite graph. Extensive experimental results demonstrate the advantages of SSBG in clustering performance across various benchmark datasets.</p>