Xiaofeng He Papers on DiSC'02 Bipartite graph partitioning and data clustering A Min-max Cut Algorithm for Graph Partitioning and Data Clustering Automatic Topic Identification Using Webpage Clustering A spectral method to separate disconnected and nearly-disconnected web graph components Publications Note: Links lead to the DBLP on the Web. Xiaofeng He 4 Hongyuan Zha , Xiaofeng He, Chris H. Q. Ding , Ming Gu , Horst D. Simon : Bipartite Graph Partitioning and Data Clustering. CIKM 2001 : 25-32 3 Chris H. Q. Ding , Xiaofeng He, Hongyuan Zha , Ming Gu , Horst D. Simon : A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. ICDM 2001 : 107-114 2 Xiaofeng He, Chris H. Q. Ding , Hongyuan Zha , Horst D. Simon : Automatic Topic Identification Using Webpage Clustering. ICDM 2001 : 195-202 1 Chris H. Q. Ding , Xiaofeng He, Hongyuan Zha : A spectral method to separate disconnected and nearly-disconnected web graph components. KDD 2001 : 275-280 DiSC'02 © 2003 Association for Computing Machinery