Geodesic
On a semi-superwized graph clustering problem
Prikladnaâ diskretnaâ matematika, no. 4 (2018), pp. 66-75

Voir la notice de l'article provenant de la source Math-Net.Ru

In the clustering problems one has to partition a given set of objects into some subsets (called clusters) taking into consideration only similarity of the objects. In this paper we study a version of the graph correlation clustering that can be considered as a formalization of the semi-supervised clustering. We prove that the problem under consideration is NP-hard and propose a polynomial-time 3-approximation algorithm for a version of the problem.
Keywords: graph, cluster, semi-supervised clustering. 
@article{PDM_2018_4_a5,
     author = {A. V. Ilev and V. P. Il'ev},
     title = {On a semi-superwized graph clustering problem},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {66--75},
     publisher = {mathdoc},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2018_4_a5/}
}
TY  - JOUR
AU  - A. V. Ilev
AU  - V. P. Il'ev
TI  - On a semi-superwized graph clustering problem
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2018
SP  - 66
EP  - 75
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2018_4_a5/
LA  - ru
ID  - PDM_2018_4_a5
ER  - 
%0 Journal Article
%A A. V. Ilev
%A V. P. Il'ev
%T On a semi-superwized graph clustering problem
%J Prikladnaâ diskretnaâ matematika
%D 2018
%P 66-75
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2018_4_a5/
%G ru
%F PDM_2018_4_a5
A. V. Ilev; V. P. Il'ev. On a semi-superwized graph clustering problem. Prikladnaâ diskretnaâ matematika, no. 4 (2018), pp. 66-75. http://geodesic.mathdoc.fr/item/PDM_2018_4_a5/