1 code implementation • 14 Jun 2013 • Thomas Bühler, Syama Sundar Rangapuram, Simon Setzer, Matthias Hein
While a globally optimal solution for the resulting non-convex problem cannot be guaranteed, we outperform the loose convex or spectral relaxations by a large margin on constrained local clustering problems.
2 code implementations • NeurIPS 2010 • Matthias Hein, Thomas Bühler
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems.