Learning the best algorithm for max-cut, clustering, and other partitioning problems.
Maria-Florina BalcanVaishnavh NagarajanEllen VitercikColin WhitePublished in: CoRR (2016)
Keyphrases
- k means
- learning algorithm
- max cut
- graph partitioning
- clustering method
- computational complexity
- data clustering
- np hard
- search space
- benchmark problems
- unsupervised learning
- distance metric
- objective function
- information theoretic
- combinatorial optimization
- learning tasks
- min max
- expectation maximization
- spectral clustering
- simulated annealing
- optimal solution
- spectral graph
- probabilistic model