Co-clustering on manifolds

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 359-367

  Gu, Quanquan ^a   Zhou, Jie ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Algorithms, Experimentations

Indexed keywords

ALTERNATING MINIMIZATION; BENCHMARK DATA; CLUSTERING DATA; CO-CLUSTERING; DATA GRAPH; DATA MANIFOLDS; DATA POINTS; GEOMETRIC STRUCTURE; MATRIX; NON-NEGATIVE MATRIX; STATE OF THE ART; TWO-GRAPHS;

COBALT COMPOUNDS; EXPERIMENTS; FACTORIZATION; LABELS;

CLUSTERING ALGORITHMS;

EID: 70350697580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557063     Document Type: Conference Paper

References (25)

1. C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
2. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, Cambridge, 2004.
3. D. Cai, X. He, X. Wu, and J. Han. Non-negative matrix factorization on manifold. In ICDM, 2008.
4. O. Chapelle, B. SchÄolkopf, and A. Zien, editors. Semi-Supervised Learning. MIT Press, Cambridge, MA, 2006.
5. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, February 1997.
6. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269-274, 2001.
7. I. S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In KDD, pages 551-556, 2004.
8. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
9. C. H. Ding, T. Li, and M. I. Jordan. Convex and semi-nonnegative matrix factorizations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 99(1), 2008.
10. C. H. Q. Ding and X. He. On the equivalence of nonnegative matrix factorization and spectral clustering. In SDM, 2005.
11. C. H. Q. Ding, T. Li, W. Peng, and H. Park. Orthogonal nonnegative matrix t-factorizations for clustering. In KDD, pages 126-135, 2006.
12. X. He and P. Niyogi. Locality preserving projections. In NIPS, 2003.
13. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, pages 556-562, 2000.
14. T. Li and C. H. Q. Ding. The relationships among various nonnegative matrix factorization methods for clustering. In ICDM, pages 362-371, 2006.
15. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
16. P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15:1373-1396, 2003.
17. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, December 2000.
18. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888-905, 2000.
19. T. Sim, S. Baker, and M. Bsat. The cmu pose, illumination, and expression database. IEEE Trans. Pattern Anal. Mach. Intell., 25(12):1615-1618, 2003.
20. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. CoRR, physics/0004057, 2000.
21. U. von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
22. M. Wu and B. SchÄolkopf. A local learning approach for clustering. In NIPS, pages 1529-1536, 2006.
23. Xu, Wei, Liu, Xin, and Gong, Yihong. Document clustering based on non-negative matrix factorization. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 267-273, 2003.
24. H. Zha, X. He, C. H. Q. Ding, M. Gu, and H. D. Simon. Spectral relaxation for k-means clustering. In NIPS, pages 1057-1064, 2001.
25. X. Zhu. Semi-supervised learning literature survey. Technical report, Computer Sciences, University of Wisconsin-Madison, 2008.