Hongyuan Zha 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. Hongyuan Zha 6 Hongyuan Zha, Xiaofeng He , Chris H. Q. Ding , Ming Gu , Horst D. Simon : Bipartite Graph Partitioning and Data Clustering. CIKM 2001 : 25-32 5 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 4 Xiaofeng He , Chris H. Q. Ding , Hongyuan Zha, Horst D. Simon : Automatic Topic Identification Using Webpage Clustering. ICDM 2001 : 195-202 3 Chris H. Q. Ding , Xiaofeng He , Hongyuan Zha: A spectral method to separate disconnected and nearly-disconnected web graph components. KDD 2001 : 275-280 2 Hongyuan Zha, Osni Marques , Horst D. Simon : Large-Scale SVD and Subspace-Based Methods for Information Retrieval. IRREGULAR 1998 : 29-42 1 Shang-Sheng Tung , Hongyuan Zha, Thomas F. Keefe : Indexing Management for Distributed Linear Hash Files. DEXA Workshop 1996 : 106-114 DiSC'02 © 2003 Association for Computing Machinery