Constrained Text Coclustering with Supervised and Unsupervised Constraints
- 6 March 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 25 (6) , 1227-1239
Abstract
In this paper, we propose a novel constrained coclustering method to achieve two goals. First, we combine information-theoretic coclustering and constrained clustering to improve clustering performance. Second, we adopt both supervised and unsupervised constraints to demonstrate the effectiveness of our algorithm. The unsupervised constraints are automatically derived from existing knowledge sources, thus saving the effort and cost of using manually labeled constraints. To achieve our first goal, we develop a two-sided hidden Markov random field (HMRF) model to represent both document and word constraints. We then use an alternating expectation maximization (EM) algorithm to optimize the model. We also propose two novel methods to automatically construct and incorporate document and word constraints to support unsupervised constrained clustering: 1) automatically construct document constraints based on overlapping named entities (NE) extracted by an NE extractor; 2) automatically construct word constraints based on their semantic distance inferred from WordNet. The results of our evaluation over two benchmark data sets demonstrate the superiority of our approaches against a number of existing approaches.Keywords
This publication has 24 references indexed in Scilit:
- Latent Dirichlet Bayesian Co-Clustering2009
- Constrained Co-clustering of Gene Expression Data2008
- Semi-Supervised Clustering via Matrix Factorization2008
- Co-clustering based classification for out-of-domain documents2007
- Penalized Probabilistic ClusteringNeural Computation, 2007
- Generative model-based document clustering: a comparative studyKnowledge and Information Systems, 2005
- Minimum Sum-Squared Residue Co-clustering of Gene Expression Data2004
- Data clusteringACM Computing Surveys, 1999
- WordNetCommunications of the ACM, 1995
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985