资源分类
》 资源 》论文》Analysis and Optimization of Graph Decompositions by Lifted Multicuts

Analysis and Optimization of Graph Decompositions by Lifted Multicuts

2020-03-09 | |  59 |   43 |   0

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 classes 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 efficie separation procedures and apply these in a branchand-cut algorithm.

上一篇：Risk Bounds for Transferring Representations With and Without Fine-Tuning

下一篇：Multilevel Clustering via Wasserstein Means

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...