Please use this identifier to cite or link to this item:
|Title:||Preserving patterns in bipartite graph partitioning|
|Source:||Hu, T.,Qu, C.,Tan, C.L.,Sung, S.Y.,Zhou, W. (2006). Preserving patterns in bipartite graph partitioning. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI : 489-496. ScholarBank@NUS Repository. https://doi.org/10.1109/ICTAI.2006.97|
|Abstract:||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. © 2006 IEEE.|
|Source Title:||Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.