 Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization).pdf |
1.04MB |
Type: Paper
Metadata:
Tags:
Metadata:
@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}}
Citation:
Bie, T. D. & Cristianini, N.. (2014). Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems (Special Topic on Machine Learning and Optimization) [Data set]. Academic Torrents. https://academictorrents.com/details/1fae6dbfbf47b107eb5aacd990d57c63431ad610
