Litcius/Paper detail

One-step bipartite graph cut: A normalized formulation and its application to scalable subspace clustering

Si-Guo Fang, Dong Huang, Chang‐Dong Wang, Jianhuang Lai

2025Neural Networks5 citationsDOI

Topics & Concepts

Bipartite graphCluster analysisSubspace topologyScalabilityComputer scienceMaximum cutGraphArtificial intelligenceMathematicsTheoretical computer scienceAlgorithmPattern recognition (psychology)CombinatoricsDatabaseFace and Expression RecognitionAdvanced Clustering Algorithms ResearchText and Document Classification Technologies
One-step bipartite graph cut: A normalized formulation and its application to scalable subspace clustering | Litcius