One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering

This is the source code for the OBCut algorithm, which is proposed in the following paper:

Si-Guo Fang, Dong Huang, Chang-Dong Wang, Jian-Huang Lai. One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering. Neural Networks, 2026.

Run "demo_OBCut.m" to test the algorithm.

Further Questions?

Don't hesitate to contact us if you have any questions regarding this work.
Email:
huangdonghere at gmail dot com