Nonlinear adaptive distance metric learning for clustering

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

Volumn , Issue , 2007, Pages 123-132

  Chen, Jianhui ^a   Zhao, Zheng ^a   Ye, Jieping ^a   Liu, Huan ^a  

^a Arizona State University   (United States)

Author keywords

Clustering; Convex programming; Distance metric; Kernel

Indexed keywords

CLUSTERING; CONVEX PROGRAMMING; DISTANCE METRIC; KERNEL;

ADAPTIVE SYSTEMS; CLUSTER ANALYSIS; DATA MINING; LEARNING ALGORITHMS; NONLINEAR SYSTEMS; PROJECT MANAGEMENT;

LEARNING SYSTEMS;

EID: 36849021609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281209     Document Type: Conference Paper

References (38)

1. E. D. Andersen and K. D. Andersen. The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In T. T. H. Frenk, K. Roos and S. Zhang, editors, High Performance Optimization, pages 197-232. Kluwer Academic Publishers, 2000.
2. A. Argyriou, R. Hauser, C. Micchelli, and M. Pontil. A DC-programming algorithm for kernel selection. In Proceedings of the Twenty-third International Conference on Machine Learning, pages 41-48, 2006.
3. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In Proceedings of the Twenty-first International Conference on Machine Learning, 2004.
4. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Advances in Neural Information Processing Systems, 15, 2003.
5. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
7. I. S. Dhillon, Y. Guan, and B. Kulis. A unified view of kernel k-means, spectral clustering and graph partitioning. Technical report, TR-04-25, UTCS, 2004.
8. P. Diaconis and D. Freedman. Asymptotics of graphical projection pursuit. Annuals of Statistics, 12:793-815, 1984.
9. C. Ding and T. Li. Adaptive dimension reduction using discriminant analysis and k-means clustering. In Proceedings of the Twenty-fourth International Conference on Machine Learning, 2007.
10. C. Domeniconi, D. Papadopoulos, D. Gunopulos, and S. Ma. Subspace clustering of high dimensonal data. In Proceedings of the SIAM International Conference on Data Mining, 2004.
11. J. H. Friedman. Regularized discriminant analysis. Journal of the American Statistical Association, 84(405):165-175, 1989.
12. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 2nd edition, 1990.
13. G. Fung, M. Dundar, J. Bi, and B. Rao. A fast iterative algorithm for Fisher discriminant using heterogeneous kernels. In Proceedings of the Twenty-first International Conference on Machine Learning, 2004.
14. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, third edition, 1996.
15. P. Hall and K. Li. On almost linearity of low dimensional projections from high dimensional data. Annuals of Statistics, 21:867-889, 1993.
16. T. Jebara. Multi-task feature and kernel selection for SVMs. In Proceedings of the Twenty-first International Conference on Machine Learning, 2004.
17. I. Jolliffe. Principal Component Analysis. Springer; 2nd edition, 2002.
18. S.-J. Kim, A. Magnani, and S. Boyd. Optimal kernel selection in kernel Fisher discriminant analysis. In Proceedings of the Twenty-third International Conference on Machine Learning, pages 465-472, 2006.
19. F. D. la Torre Frade and T. Kanade. Discriminative cluster analysis. In Proceedings of the Twenty-third International Conference on Machine Learning, pages 241-248, 2006.
20. G. Lanckriet, N. Cristianini, P. Bartlett, L. E. Ghaoui, and M. I. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27-72, 2004.
21. D. Lewis, T. Jebara, and W. S. Noble. Nonstationary kernel combination. In Proceedings of the Twenty-third International Conference on Machine Learning, pages 553-560, 2006.
22. L. Lovasz and M. Plummer. Matching Theory. North Holland, 1986.
23. L. K. Saul and S. T. Roweis. Think globally, fit locally: Unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research, 4:119-155, 2003.
24. S. Schölkopf and A. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization and Beyond. MIT Press, 2002.
25. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
26. N. Shental, T. Hertz, D. Weinshall, and M. Pavel. Adjustment learning and relevant component analysis. In Proceedings of the Seventh European Conference on Computer Vision, pages 776-792, London, UK, 2002. Springer-Verlag.
27. A. Smola and I. Kondor. Kernels and regularization on graphs. In Proceedings of the Annual Conference on Computational Learning Theory, 2003.
28. S. Sonnenburg, G. Rätsch, C. Schäfer, and B. Schölkopf. Large Scale Multiple Kernel Learning. Journal of Machine Learning Research, 7:1531-1565, July 2006.
29. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
30. H. Valizadegan and R. Jin. Generalized maximum margin clustering and unsupervised kernel learning. In Advances in Neural Information Processing Systems, 2006.
31. K. Weinberger, J. Blitzer, and L. Saul. Distance metric learning for large margin nearest neighbor classification. In Advances in Neural Information Processing Systems, 2005.
32. E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning with application to clustering with side-information. In Advances in Neural Information Processing Systems, 2002.
33. B. Yan and C. Domeniconi. An adaptive kernel method for semi-supervised clustering. In Proceedings of the Seventeenth European Conference on Machine Learning, 2006.
34. L. Yang and R. Jin. Distance metric learning: A comprehensive survey. Technical report, Department of Computer Science and Engineering, Michigan State University, 2006.
35. L. Yang, R. Jin, R. Sukthankar, and Y. Liu. An efficient algorithm for local distance metric learning. In Proceedings of the Twenty-first National Conference on Artificial Intelligence, 2006.
36. J. Ye, S. Ji, and J. Chen. Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming. In Proceedings of the Thirteenth A CM SIGKDD International Conference On Knowledge Discovery and Data Mining, 2007.
37. J. Ye, Z. Zhao, and H. Liu. Adaptive distance metric learning for clustering. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2007.
38. H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Spectral relaxation for k-means clustering. In Advances in Neural Information Processing Systems, 2001.