A dependence maximization view of clustering

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 815-822

  Song, Le ^a,b   Smola, Alex ^a,c   Gretton, Arthur ^d   Borgwardt, Karsten M ^e  

^a CSIRO   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

^c ANU ^*

^d MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^e UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PERTURBATION TECHNIQUES; STATISTICAL METHODS;

HILBERT-SCHMIDT INDEPENDENCE CRITERION; INPUT VARIABLES;

CLUSTERING ALGORITHMS;

EID: 34547972314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273599     Document Type: Conference Paper

References (25)

1. Dhillon, I. S., Guan, Y., & Kulis, B. (2004). Kernel kmeans, spectral clustering and normalized cuts. KDD.
2. Ding, C., &: He, X. (2004). K-means clustering via principal component analysis. ICML.
3. Fine, S., & Scheinberg, K. (2001). Efficient SVM training using low-rank kernel representations. JMLR, 2, 243-264.
4. Fukumizu, K., Bach, F. R., & Jordan, M. I. (2004). Dimensionality reduction for supervised learning with reproducing kernel hilbert spaces. JMLR, 5, 73-99.
5. Girolami, M. (2001). Mercer kernel based clustering in feature space. IEEE TNN, 4(13), 780-784.
6. Gretton, A., Bousquet, O., Smola, A., & Schölkopf, B. (2005). Measuring statistical dependence with Hilbert-Schmidt norms. In ALT.
7. Kannan, R., Vempala, S., & Vetta, A. (2004). On clusterings: good, bad and spectral. J. of ACM, 51, 497-515.
8. Loera, J. D., Hemmecke, R., Onn, S., Rothblum, U., & Weismantel, R. (2006). Integer convex maximization. arXiv:math. CO/0609019.
9. MacQueen, J. (1967). Some methods of classification and analysis of multivariate observations. In L. M. LeCam, & J. Neyman, eds., Proc. 5th Berkeley Symposium on Math., Stat., and Prob., 281. U. California Press.
10. Meilǎ, M. (2003). Data centering in feature space. AIS-TATS.
11. Meilǎ, M. (2005). The local equivalence of two distances between clustering: the misclassification error metric and the chi-squared distance. ICML.
12. Meilǎ, M. (2006). The uniqueness of a good optimal for k-means. ICML.
13. Nemenman, I., Shafee, F., & Bialek, W. (2002). Entropy and inference, revisited. In NIPS.
14. Ng, A., Jordan, M., & Weiss, Y. (2002). Spectral clustering: Analysis and an algorithm. In NIPS.
15. Pantic, M., &: Rothkrantz, L. (2000). Automatic analysis of facial expressions: The state of the art. PAMI, 22(12), 1424-1445.
16. Schölkopf, B., & Smola, A. (2002). Learning with Kernels. Cambridge, MA: MIT Press.
17. Schölkopf, B., Smola, A. J., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput., 10, 1299-1319.
18. Shi, J., & Malik, J. (1997). Normalized cuts and image segmentation. CVPR.
19. Slonim, N. (2002). The Information Bottleneck: Theory and Applications. Ph.D. thesis, The Hebrew University of Jerusalem.
20. Smola, A. J., & Kondor, I. R. (2003). Kernels and regularization on graphs. In COLT.
21. Song, L., Smola, A., Gretton, A., & Borgwardt, K. (2007). Clustering via dependence maximization. Tech. rep., NICTA, ANU.
22. Weinberger, K. Q., & Saul, L. K. (2006). An introduction to nonlinear dimensionality reduction by maximum variance unfolding. AAAI.
23. Xiao, L., Sun, J., & Boyd, S. (2006). A duality view of spectral methods for dimensionality reduction. ICML.
24. Zass, R., & Shashua, A. (2005). A unifying approach to hard and probablistic clustering. ICCV.
25. Zha, H., Ding, C., Gu, M., He, X., & Simon, H. (2001). Spectral relaxation for k-means clustering. In NIPS.