RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat., 2018, Number 42, Pages 66–75 (Mi pdm643)  

This article is cited in 1 scientific paper (total in 1 paper)

Applied Graph Theory

On a semi-superwized graph clustering problem

A. V. Ilevab, V. P. Il'evac

a Omsk State Technical University, Omsk, Russia
b Sobolev Institute of Mathematics SB RAS, Omsk, Russia
c Dostoevsky Omsk State University, Omsk, Russia

Abstract: 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.

Funding Agency Grant Number
Russian Science Foundation 17-11-01117


DOI: https://doi.org/10.17223/20710410/42/5

Full text: PDF file (679 kB)
References: PDF file   HTML file

UDC: 519.1

Citation: A. V. Ilev, V. P. Il'ev, “On a semi-superwized graph clustering problem”, Prikl. Diskr. Mat., 2018, no. 42, 66–75

Citation in format AMSBIB
\Bibitem{IleIle18}
\by A.~V.~Ilev, V.~P.~Il'ev
\paper On a semi-superwized graph clustering problem
\jour Prikl. Diskr. Mat.
\yr 2018
\issue 42
\pages 66--75
\mathnet{http://mi.mathnet.ru/pdm643}
\crossref{https://doi.org/10.17223/20710410/42/5}


Linking options:
  • http://mi.mathnet.ru/eng/pdm643
  • http://mi.mathnet.ru/eng/pdm/y2018/i4/p66

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. N. Rybalov, “O genericheskoi slozhnosti problemy klasterizatsii grafov”, PDM, 2019, no. 46, 72–77  mathnet  crossref
  • Прикладная дискретная математика
    Number of views:
    This page:57
    Full text:19
    References:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020