Constrained co-clustering for textual documents

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 581-586

  Song, Yangqiu ^a   Pan, Shimei ^b   Liu, Shixia ^a   Wei, Furu ^a   Zhou, Michelle X ^c   Qian, Weihong ^a  

^a IBM CHINA RESEARCH LAB   (China)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; IMAGE SEGMENTATION; INFORMATION RETRIEVAL; INFORMATION THEORY; MARKOV PROCESSES; MAXIMUM PRINCIPLE;

BENCHMARK DATA; CONSTRAINED CLUSTERING; DOCUMENT CLUSTERING; EXPECTATION-MAXIMIZATION ALGORITHMS; HIDDEN MARKOV RANDOM FIELDS; HIGH-DIMENSIONAL; SEMI-SUPERVISED; TEXTUAL DOCUMENTS;

CONSTRAINED OPTIMIZATION;

EID: 77958597570     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Banerjee, A., and Basu, S. 2007. Topic models over text streams: A study of batch and online unsupervised learning. In SDM.
2. Banerjee, A.; Dhillon, I.; Ghosh, J.; Merugu, S.; and Modha, D. S. 2007. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Journal of Machine Learning Research 8:1919-1986.
3. Basu, S.; Banerjee, A.; and Mooney, R. J. 2002. Semi-supervised clustering by seeding. In ICML, 27-34.
4. Basu, S.; Bilenko, M.; and Mooney, R. J. 2004. A probabilistic framework for semi-supervised clustering. In SIGKDD, 59-68.
5. Basu, S.; Davidson, I.; and Wagstaff, K. 2008. Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman & Hall/CRC.
6. Bilenko, M; Basu, S.; and Mooney, R. J. 2004. Integrating constraints and metric learning in semi-supervised clustering. In ICML, 81-88.
7. Chen, Y.; Wang, L.; and Dong, M. 2009. Non-negative matrix factorization for semi-supervised heterogeneous data co-clustering. IEEE Trans, on Knowledge and Data Engineering.
8. Cheng, Y., and Church, G. M. 2000. Biclustering of expression data. In ISMB, 93-103.
9. Cho, H.; Dhillon, I. S.; Guan, Y.; and Sra, S. 2004. Minimum sum-squared residue co-clustering of gene expression data. In SDM.
10. Dhillon, I. S.; Mallela, S.; and Modha, D. S. 2003. Information-theoretic co-clustering. In KDD, 89-98.
11. Dhillon, I. S. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, 269-274.
12. Ding, C; Li, T.; Peng, W.; and Park, H. 2006. Orthogonal nonneg-ative matrix t-factorizations for clustering. In KDD, 126-135.
13. Ding, C. H. Q.; Li, T.; and Jordan, M. I. 2010. Convex and semi-nonnegative matrix factorizations. IEEE Trans, on Pattern Analysis and Machine Intelligence 32(1):45-55.
14. Jain, A.; Murty, M.; and Flynn, P. 1999. Data clustering: A review. ACM Computing Surveys 31(3):264-323.
15. Lu, Z., and Leen, T. K. 2007. Penalized probabilistic clustering. Neural Computation 19(6): 1528-1567.
16. Nigam, K.; McCallum, A. K.; Thrun, S.; and Mitchell, T. M. 2000. Text classification from labeled and unlabeled documents using EM. Machine Learning 39(2/3): 103-134.
17. Pensa, R. G., and Boulicaut, J.-F. 2008. Constrained co-clustering of gene expression data. In SDM, 25-36.
18. Shan, H., and Banerjee, A. 2008. Bayesian co-clustering. In ICDM, 530-539.
19. Strehl, A., and Ghosh, J. 2002. Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal on Machine Learning Research 3:583-617.
20. Wagstaff, K.; Cardie, C; Rogers, S.; and Schrodl, S. 2001. Constrained k-means clustering with background knowledge. In ICML, 577-584.
21. Wang, P.; Domeniconi, C; and Laskey, K. B. 2009. Latent dirichlet bayesian co-clustering. In ECMUPKDD, 522-537.
22. Wang, F.; Li, T.; and Zhang, C. 2008. Semi-supervised clustering via matrix factorization. In SDM, 1-12.
23. Xing, E. P.; Ng, A. Y; Jordan, M. I.; and Russell, S. J. 2002. Distance metric learning with application to clustering with side-information. In NIPS, 505-512.