Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization)

Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization).pdf	1.04MB

Type: Paper
Tags:

Bibtex:

@article{7:52,author={Tijl De Bie and Nello Cristianini}, Title={Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization)},journal={Journal of Machine Learning Research},volume={7}, url={http://www.jmlr.org/papers/volume7/debie06a/debie06a.pdf}}

Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization) Tijl De Bie and Nello Cristianini

Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization)
Tijl De Bie and Nello Cristianini