This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)
Preserving Patterns in Bipartite Graph Partitioning
Arlington, Virginia
November 13-November 15
ISBN: 0-7695-2728-0
Tianming Hu, DongGuan U. of Technology
Chao Qu, DongGuan U. of Technology
Chew Lim Tan, National U. of Singapore, Singapore
Sam Yuan Sung, South Texas College, USA
Wenjun Zhou, Rutgers University, USA
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to be split into different clusters. Our approach for pattern preserving clustering consists of three steps: mine maximal hyperclique patterns, form the bipartite, and partition it. With hyperclique patterns of documents preserved, the topic of each cluster can be represented by both the top words from that cluster and the documents in the patterns, which are expected to be more compact and representative than those in the standard bipartite formulation. Experiments with real-world datasets show that, with hyperclique patterns as starting points, we can improve the clustering results in terms of various external clustering criteria. Also, the partitioned bipartite with preserved topical sets of documents naturally lends itself to different functions in search engines.
Citation:
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung, Wenjun Zhou, "Preserving Patterns in Bipartite Graph Partitioning," ictai, pp.489-496, 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.