Relational clustering by symmetric convex coding

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 569-576

  Long, Bo ^a   Zhang, Zhongfei ^a   Wu, Xiaoyun ^b   Yu, Philip S ^c  

^a State University of New York at Binghamton

^b GOOGLE INC   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING SYSTEMS; OPTIMIZATION; RELATIONAL DATABASE SYSTEMS;

DISTANCE FUNCTIONS; EUCLIDEAN DISTANCE; GRAPH PARTITIONING FORMULATION; RELATIONAL DATA;

CLUSTERING ALGORITHMS;

EID: 34547985975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273568     Document Type: Conference Paper

References (28)

1. Banerjee, A., Dhillon, I. S., Ghosh, J., Merugu, S., & Modha, D. S. (2004). A generalized maximum entropy approach to bregman co-clustering and matrix approximation. KDD (pp. 509-514).
2. Bui, T. N., & Jones, C. (1993). A heuristic for reducing fill-in in sparse matrix factorization. PPSC (pp. 445-452).
3. Catral, M., Han, L., Neumann, M., & Plemmons, R. (2004). On reduced, rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Algebra and Its Application.
4. Chan, P. K., Schlag, M. D. F., & Zien, J. Y. (1993). Spectral k-way ratio-cut partitioning and clustering. DAC '93 (pp. 749-754).
5. D.D.Lee, & H.S.Seung (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401, 788-791.
6. Dhillon, I., Guan, Y., & Kulis, B. (2004). A unified view of kernel k-means, spectral clustering and graph cuts (Technical Report TR-04-25). University of Texas at Austin.
7. Dhillon, I., Guan, Y., & Kulis, B. (2005). A fast kernel-based multilevel algorithm for graph clustering. KDD '05.
8. Dhillon, I. S. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. KDD (pp. 269-274).
9. Dhillon, I. S., Mallela, S., & Modha, D. S. (2003). Information-theoretic co-clustering. KDD'03 (pp. 89-98).
10. Ding, C., He, X., & Simon, H. (2005). On the equivalence of nonnegative matrix factorization and spectral clustering. SDM'05.
11. Ding, C., Li, T., Peng, W., & Park, H. (2006). Orthogonal nonnegative matrix tri-factorizations for clustering, kdd'06.
12. Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2001). A min-max cut algorithm for graph partitioning and data clustering. Proceedings of ICDM 2001 (pp. 107-114).
13. Hendrickson, B., & Leland, R. (1995). A multilevel algorithm for partitioning graphs. Supercomputing '95 (p. 28).
14. Henzinger, M., Motwani, R., & Silverstein, C. (2003). Challenges in web search engines. Proc. of the 18th International Joint Conference on Artificial Intelligence (pp. 1573-1579).
15. Karypis, G. (2002). A clustering toolkit.
16. Karypis, G., & Kumar, V. (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20, 359-392.
17. Kernighan, B., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49, 291-307.
18. Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999). Trawling the Web for emerging cyber-communities. Computer Networks (Amsterdam, Netherlands: 1999), 31, 1481-1493.
19. Lang, K. (1995). News weeder: Learning to filter netnews. ICML.
20. Li, T. (2005). A general model for clustering binary data. KDD'05.
21. Long, B., Zhang, Z. M., & Yu, P. S. (2005). Co-clustering by block value decomposition. KDD '05.
22. Nasraoui, O., Krishnapuram, R., & Joshi, A. (1999). Relational clustering based on a new robust estimator with application to web mining. NAFIPS 99.
23. Salakhutdinov, R., & Roweis, S. (2003). Adaptive overrelaxed bound optimization methods. ICML'03.
24. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888-905.
25. Strehl, A., & Ghosh, J. (2002). Cluster ensembles - a knowledge reuse framework for combining partitionings. AAAI 2002 (pp. 93-98).
26. Yu, K., Yu, S., & Tresp, V. (2005). Soft clustering on graphs. NIPS'05.
27. Yu, S., & Shi, J. (2003). Multiclass spectral clustering. ICCV'03..
28. Zha, H., Ding, C., Gu, M., He, X., & Simon, H. (2001). Bi-partite graph partitioning and data clustering. ACM CIKM'01.