Maximum margin clustering made practical

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 1119-1126

  Zhang, Kai ^a   Tsang, Ivor W ^a   Kwok, James T ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

LAPLACIAN LOSS; MAXIMUM MARGIN CLUSTERING (MMC); NON-CONVEX OPTIMIZATION; SEMIDEFINITE PROGRAMS (SDP);

UNSUPERVISED LEARNING;

EID: 34547987546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273637     Document Type: Conference Paper

References (15)

1. Bezdek, J., & Hathaway, R. (2003). Convergence of alternating optimization. Neural, Parallel & Scientific Computations, 11, 351-368.
2. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge, UK: Cambridge University Press.
3. Figueiredo, M., & Jain, A. (2002). Unsupervised learning of finite mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 381-396.
4. Jain, A., & Dubes, R. (1988). Algorithms for clustering data. Englewood Cliffs, NJ: Prentice Hall.
5. Lanckriet, G., Cristianini, N., Bartlett, P., El Ghaoui, L., & Jordan, M. (2004). Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5, 27-72.
6. Lobo, M., Vandenberghe, L., Boyd, S., & Lebret, H. (1998). Applications of second-order cone programming. Linear Algebra Applications, 284, 193-228.
7. Nesterov, Y., & Nemirovskii, A. (1994). Interior-point polynomial algorithms in convex programming. Philadelphia, PA: Society for Industrial and Applied Mathematics.
8. Platt, J. (1999). Fast training of support vector machines using sequential minimal optimization. In B. Schölkopf, C. Burges and A. Smola (Eds.), Advances in kernel methods - Support vector learning, 185-208. Cambridge, MA: MIT Press.
9. Schölkopf, B., & Smola, A. (2002). Learning with kernels. Cambridge, MA: MIT Press.
10. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888-905.
11. Suykens, J., & Vandewalle, J. (1999). Least squares support vector machine classifiers. Neural Processing Letters, 9, 293-300.
12. Valizadegan, H., & Jin, R. (2007). Generalized maximum margin clustering and unsupervised kernel learning. Advances in Neural Information Processing Systems 19. Cambridge, MA: MIT Press.
13. Xu, L., Neufeld, J., Larson, B., & Schuurmans, D. (2005). Maximum margin clustering. Advances in Neural Information Processing Systems 17. Cambridge, MA: MIT Press.
14. Xu, L., & Schuurmans, D. (2005). Unsupervised and semi-supervised multi-class support vector machines. Proceedings of The Twentieth National Conference on Artificial Intelligence, (pp. 904-910). Pittsburgh, PA, USA.
15. Xu, L., Wilkinson, D., Southey, F., & Schuurmans, D. (2006). Discriminative unsupervised learning of structured predictors. Proceedings of the 23rd International Conference on Machine Learning.