Publication:3093399
From MaRDI portal
zbMath1222.68179MaRDI QIDQ3093399
Tijl De Bie, Nello Cristianini
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/debie06a.html
combinatorial optimization; relaxation; semi-definite programming; max-cut; semisupervised learning; convex transduction; normalized graph cut
90C35: Programming involving graphs or networks
90C22: Semidefinite programming
68T05: Learning and adaptive systems in artificial intelligence
90C27: Combinatorial optimization
Related Items
An efficient algorithm for maximal margin clustering, Spectral methods for graph clustering - a survey, Iterative ensemble normalized cuts, Using SeDuMi to find various optimal designs for regression models, Enhanced balanced min cut, Approximating Spectral Clustering via Sampling: A Review
Uses Software