Maximum margin clustering

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages

  Xu, Linli ^a,b   Neufeld, James ^b   Larson, Bryce ^b   Schuurmans, Dale ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; CONVEX PROGRAMMING;

CLUSTERING TECHNIQUES; COMPUTATIONAL PROBLEM; CONVENTIONAL CLUSTERING; EQUIVALENCE RELATIONS; MAXIMUM MARGIN CLUSTERING; SEMI-SUPERVISED TRAININGS; SEMIDEFINITE PROGRAMS; STATE-OF-THE-ART PERFORMANCE;

INTEGER PROGRAMMING;

EID: 84898944155     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. Ben-Hur, D. Horn, H. Siegelman, and V. Vapnik. Support vector clustering. In Journal of Machine Learning Research 2 (2001), 2001.
2. K. Bennett and A. Demiriz. Semi-supervised support vector machines. In Advances in Neural Information Processing Systems 11 (NIPS-98), 1998.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge U. Press, 2004.
4. Chakra Chennubhotla and Allan Jepson. Eigencuts: Half-lives of eigenflows for spectral clustering. In In Advances in Neural Information Processing Systems 2002, 2002.
5. K. Crammer and Y. Singer. On the algorithmic interpretation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2, 2001.
6. T. De Bie and N. Cristianini. Convex methods for transduction. In Advances in Neural Information Processing Systems 16 (NIPS-03), 2003.
7. C. Helmberg. Semidefinite programming for combinatorial optimization. Technical Report ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum Berlin, 2000.
8. T. Joachims. Transductive inference for text classification using support vector machines. In International Conference on Machine Learning (ICML-99), 1999.
9. Y. Kluger, R. Basri, J. Chang, and M. Gerstein. Spectral biclustering of microarray cancer data: co-clustering genes and conditions. Genome Research, 13, 2003.
10. G. Lanckriet, N. Cristianini, P. Bartlett, L Ghaoui, and M. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5, 2004.
11. M. Laurent and S. Poljak. On a positive semidefinite relaxation of the cut polytope. Linear Algebra and its Applications, 223/224, 1995.
12. S. Chawla N. Bansal, A. Blum. Correlation clustering. In Conference on Foundations of Computer Science (FOCS-02), 2002.
13. J. Kandola N. Cristianini, J. Shawe-Taylor. Spectral kernel methods for clustering. In In Advances in Neural Information Processing System 2001, 2001.
14. A. Ng, M. Jordan, and Y Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14 (NIPS-01), 2001.
15. B. Schoelkopf and A. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, 2002.
16. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans PAMI, 22(8), 2000.
17. Y. Weiss. Segmentation using eigenvectors: A unifying view. In International Conference on Computer Vision (ICCV-99), 1999.
18. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In International Conference on Machine Learning (ICML-03), 2003.