Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

Computer Science

• Definite Program 100%
• Graph Cut 100%
• Combinatorial Problem 100%
• Machine Learning 60%
• Learning System 60%
• Polynomial Complexity 20%
• Large Problem Size 20%
• Convex Programming 20%
• Semisupervised Learning 20%
• Field Research 20%
• Polynomial Time 20%

Mathematics

• Combinatorial Problem 100%
• Polynomial 33%
• Convex Programming 33%
• Polynomial Time 33%
• Max-Cut 33%

Chemical Engineering

• Learning System 100%
• Supervised Learning 33%