Constrained Coclustering for Textual Documents

In this paper, we present a constrained co-clustering approach for clustering textual documents. Our approach combines the benefits of information-theoretic co-clustering and constrained clustering. We use a two-sided hidden Markov random field (HMRF) to model both the document and word constraints. We also develop an alternating expectation maximization (EM) algorithm to optimize the constrained coclustering model. We have conducted two sets of experiments on a benchmark data set: (1) using human-provided category labels to derive document and word constraints for semi-supervised document clustering, and (2) using automatically extracted named entities to derive document constraints for unsupervised document clustering. Compared to several representative constrained clustering and co-clustering approaches, our approach is shown to be more effective for high-dimensional, sparse text data.

Authors

• Yangqiu Song The Hong Kong University of Science and Technology
• Shimei Pan University of Maryland Baltimore County
• Shixia Liu
• Furu Wei Microsoft
• Michelle Zhou IBM Research - Almaden Center
• Weihong Qian IBM Research - China

Keywords

No keywords are indexed for this paper.