In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering.
In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering.
In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering.
Abstract. In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering.
XIA, Yu, 2007. "Constrained clustering via concavity cuts," LIDAM Reprints CORE 1969, Université catholique de Louvain, Center for Operations Research and ...
The algorithm employs a novel locally constrained geometrical boundary model which proposes greedy cuts through a local concavity graph. Only planar cuts are ...
Missing: Via | Show results with:Via
Dec 7, 2023 · This paper studies hierarchical clustering of words in short sentences, using graph coarsening and optimal cuts with horizontal and vertical ...
May 23, 2007 · In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering. We also ...
15h-15h30 Technical Session: Clustering. Constrained Clustering via Concavity Cuts. Yu Xia. 15h30-16h Coffee. 16h-18h00 Technical Session: Hybrid Local Search.
The set of valid cuts is essential in strengthening these relaxations. Both relaxations provide lower bounds on the optimal value of problem (1), and they both ...