Please use this identifier to cite or link to this item:
Title: Co-clustering bipartite with pattern preservation for topic extraction
Authors: Hu, T.
Tan, C.L. 
Tang, Y.
Sung, S.Y.
Xiong, H.
Qu, C.
Keywords: Bipartite partitioning
Hyperclique pattern
Pattern preserving
Topic extraction
Issue Date: 2008
Citation: Hu, T., Tan, C.L., Tang, Y., Sung, S.Y., Xiong, H., Qu, C. (2008). Co-clustering bipartite with pattern preservation for topic extraction. International Journal on Artificial Intelligence Tools 17 (1) : 87-107. ScholarBank@NUS Repository.
Abstract: The duality between document and word clustering naturally leads to the consideration of storing the document dataset in a bipartite. With documents and words modeled as vertices on two sides respectively, partitioning such a graph yields a co-clustering of words and documents. The topic of each cluster can then be represented by the top words and documents that have highest within-cluster degrees. However, such claims may fail if top words and documents are selected simply because they are very general and frequent. In addition, for those words and documents across several topics, it may not be proper to assign them to a single cluster. In other words, to precisely capture the cluster topic, we need to identify those micro-sets of words/documents that are similar among themselves and as a whole, representative of their respective topics. Along this line, in this paper, we use hyperclique patterns, strongly affiliated words/documents, to define such micro-sets. We introduce a new bipartite formulation that incorporates both word hypercliques and document hypercliques as super vertices. By co-preserving hyperclique patterns during the clustering process, our experiments on real-world data sets show that better clustering results can be obtained in terms of various external clustering validation measures and the cluster topic can be more precisely identified. Also, the partitioned bipartite with co-preserved patterns naturally lends itself to different clustering-related functions in search engines. To that end, we illustrate such an application, returning clustered search results for keyword queries. We show that the topic of each cluster with respect to the current query can be identified more accurately with the words and documents from the patterns than with those top ones from the standard bipartite formulation. © 2008 World Scientific Publishing Company.
Source Title: International Journal on Artificial Intelligence Tools
ISSN: 02182130
DOI: 10.1142/S0218213008003790
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 23, 2019


checked on Mar 13, 2019

Page view(s)

checked on Mar 17, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.