On a semi-supervised graph clustering problem

DOI10.17223/20710410/42/5MaRDI QIDQ5151244zbMATH OpenOpenAlexWikidataFDO

Authors Artëm Viktorovich V. Il'ev, Victor Petrovich Il'ev

Publication date 17 February 2021

Published in Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm643

zbMATH Keywords

clustergraphsemi-supervised clustering

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• An approximation algorithm for a semi-supervised graph clustering problem
• 2-approximation algorithms for two graph clustering problems
• Short survey on graph correlation clustering with minimization criteria
• Correlation clustering, maximizing agreements via semidefinite programming
• Semi-supervised graph clustering: a kernel approach

Cites work

• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Aggregating inconsistent information: ranking and clustering
• Approximating Symmetric Relations by Equivalence Relations
• Approximation algorithms for graph approximation problems
• Cluster graph modification problems
• Clustering with qualitative information
• Computational complexity of the graph approximation problem
• Computational complexity of the problem of approximation by graphs with connected components of bounded size
• Correlation clustering
• Correlation clustering with a fixed number of clusters
• Graph clustering
• scientific article; zbMATH DE number 3797792 (Why is no real title available?)
• La reduction minimale d'un graphe à une reunion de cliques
• NP-hard problems in hierarchical-tree clustering
• Semi-supervised graph clustering: a kernel approach
• Short survey on graph correlation clustering with minimization criteria

Cited in

(8)

• SELP: semi-supervised evidential label propagation algorithm for graph data clustering
• On semi-supervised active clustering of stable instances with oracles
• Short survey on graph correlation clustering with minimization criteria
• An approximation algorithm for a semi-supervised graph clustering problem
• 2-approximation algorithms for two graph clustering problems
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• The generic complexity of the bounded problem of graphs clustering
• On generic complexity of the graph clustering problem with bounded clusters

This page was built for publication: On a semi-supervised graph clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151244)