Correlation clustering with noisy input

MaRDI QIDQ5417661zbMATH OpenFDO

Authors Claire Mathieu, Warren Schudy

Publication date 22 May 2014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Semidefinite programming (90C22)

Recommendations

• Correlation clustering
• Correlation clustering with partial information
• Correlation clustering with a fixed number of clusters
• Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
• Correlation clustering

Cited in

(23)

• Convex optimization for the densest subgraph and densest submatrix problems
• On semidefinite relaxations for the block model
• Convex relaxation methods for community detection
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• An improved approximation algorithm for capacitated correlation clustering problem
• Approximation algorithm for min-max correlation clustering problem with outliers
• Approximation algorithms for two variants of correlation clustering problem
• Learning representations from dendrograms
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Approximation algorithms for the lower bounded correlation clustering problem
• Clustering with Local Restrictions
• scientific article; zbMATH DE number 2089226 (Why is no real title available?)
• Corrigendum to ``Noise enhanced clustering and competitive learning algorithms
• Exact clustering of weighted graphs via semidefinite programming
• Guaranteed clustering and biclustering via semidefinite programming
• A smooth inexact penalty reformulation of convex problems with linear constraints
• An optimal-storage approach to semidefinite programming using approximate complementarity
• Concentration and moment inequalities for polynomials of independent random variables
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
• An improved approximation algorithm for the capacitated correlation clustering problem
• Fair community detection and structure learning in heterogeneous graphical models

This page was built for publication: Correlation clustering with noisy input

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