Correlation Clustering and Biclustering With Locally Bounded Errors

DOI10.1109/TIT.2018.2819696zbMath1395.62172arXiv1506.08189OpenAlexW2963815604WikidataQ129990269 ScholiaQ129990269MaRDI QIDQ5375565

Gregory J. Puleo, Olgica Milenković

Publication date: 14 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08189

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (8)

Fair correlation clustering with global and local guarantees ⋮ Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithms for two variants of correlation clustering problem ⋮ \(\ell_p\)-norm multiway cut ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ Complexity of modification problems for reciprocal best match graphs ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms

This page was built for publication: Correlation Clustering and Biclustering With Locally Bounded Errors