On a semi-superwized graph clustering problem

DOI10.17223/20710410/42/5OpenAlexW2922234675WikidataQ128233647 ScholiaQ128233647MaRDI QIDQ5151244

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)

Related Items (3)

Unnamed Item ⋮ ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM ⋮ The generic complexity of the bounded problem of graphs clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Correlation clustering
• Semi-supervised graph clustering: a kernel approach
• NP-hard problems in hierarchical-tree clustering
• La reduction minimale d'un graphe à une reunion de cliques
• Cluster graph modification problems
• Clustering with qualitative information
• Computational complexity of the graph approximation problem
• Short Survey on Graph Correlation Clustering with Minimization Criteria
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Approximating Symmetric Relations by Equivalence Relations
• Aggregating inconsistent information

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