Analysis and Optimization of Graph Decompositions by Lifted Multicuts
Discrete Mathematics
2017-06-09 v6 Computational Geometry
Abstract
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join and must-cut constraints and related to the comparison of clusterings by metrics. To find optimal decompositions defined by minimum cost lifted multicuts, we establish some properties of some facets of lifted multicut polytopes, define efficient separation procedures and apply these in a branch-and-cut algorithm.
Keywords
Cite
@article{arxiv.1503.03791,
title = {Analysis and Optimization of Graph Decompositions by Lifted Multicuts},
author = {Andrea Horňáková and Jan-Hendrik Lange and Bjoern Andres},
journal= {arXiv preprint arXiv:1503.03791},
year = {2017}
}
Comments
ICML 2017