Correlation clustering
From MaRDI portal
Publication:703079
DOI10.1023/B:MACH.0000033116.57574.95zbMath1089.68085OpenAlexW2914959486WikidataQ57534946 ScholiaQ57534946MaRDI QIDQ703079
Shuchi Chawla, Nikhil Bansal, Avrim L. Blum
Publication date: 19 January 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:mach.0000033116.57574.95
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Chromatic kernel and its applications, Combining clickstream analyses and graph-modeled data clustering for identifying common response processes, Partition signed social networks via clustering dynamics, Fair correlation clustering with global and local guarantees, An improved approximation algorithm for capacitated correlation clustering problem, Approximation algorithm for min-max correlation clustering problem with outliers, Approximation algorithm for the capacitated correlation clustering problem with penalties, Concise integer linear programming formulation for clique partitioning problems, Adaptive trajectory analysis of replicator dynamics for data clustering, Multicuts and perturb \& MAP for probabilistic graph clustering, Clustering on \(k\)-edge-colored graphs, Approximation algorithms for two variants of correlation clustering problem, A graph-theoretical clustering method based on two rounds of minimum spanning trees, A new temporal interpretation of cluster editing, Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability, Parameterized algorithms for min-max 2-cluster editing, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, Competitive Strategies for Online Clique Clustering, The cluster deletion problem for cographs, An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains, Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?, New heuristics for the bicluster editing problem, Approximation algorithms for the lower bounded correlation clustering problem, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, On the hardness of labeled correlation clustering problem: a parameterized complexity view, Design and analysis of bipartite experiments under a linear exposure-response model, Six signed Petersen graphs, and their automorphisms, Recovery guarantees for exemplar-based clustering, A \(2k\) kernel for the cluster editing problem, A randomized PTAS for the minimum consensus clustering with a fixed number of clusters, A polyhedral study of lifted multicuts, On a correlational clustering of integers, Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency, A complete characterization of statistical query learning with applications to evolvability, Convergence and approximation in potential games, Ensemble clustering using semidefinite programming with applications, Graph-based data clustering with overlaps, Graph clustering, Learning representations from dendrograms, Editing graphs into disjoint unions of dense clusters, Guaranteed clustering and biclustering via semidefinite programming, Approximation algorithms for bounded degree phylogenetic roots, Additive approximation algorithms for modularity maximization, Parameterized dynamic cluster editing, Finding the closest ultrametric, Tight bounds for parameterized complexity of cluster editing with a small number of clusters, On the approximation of correlation clustering and consensus clustering, TAP free energy, spin glasses and variational inference, Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions, Complexity of the cluster deletion problem on subclasses of chordal graphs, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, On detecting maximal quasi antagonistic communities in signed graphs, Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms, Branch-and-cut approaches for \(p\)-cluster editing, Approximate association via dissociation, Iterated local transitivity model for signed social networks, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Cluster ensembles: a survey of approaches with recent extensions and applications, Random Laplacian matrices and convex relaxations, Approximate clustering of incomplete fingerprints, Clustering data that are graph connected, Embedding signed graphs in the line, Algorithms and complexity results for labeled correlation clustering problem, Cluster editing: kernelization based on edge cuts, Fixed-parameter enumerability of cluster editing and related problems, Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data, Branch-and-price for \(p\)-cluster editing, A note on the inapproximability of correlation clustering, On the parameterized complexity of consensus clustering, Clustering with partial information, Cluster editing with locally bounded modifications, Even better fixed-parameter algorithms for bicluster editing, Correlation clustering in general weighted graphs, Constant ratio fixed-parameter approximation of the edge multicut problem, On the triangle clique cover and \(K_t\) clique cover problems, The biclique partitioning polytope, Faster parameterized algorithm for cluster vertex deletion, Correlation clustering in data streams, Cluster deletion on interval graphs and split related graphs, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, Closest 4-leaf power is fixed-parameter tractable, A more effective linear kernelization for cluster editing, Semi-supervised graph clustering: a kernel approach, A parallel hybrid metaheuristic for bicluster editing, Online clique clustering, A multi-agent brokerage platform for media content recommendation, Integer programming formulations and efficient local search for relaxed correlation clustering, Network modelling and variational Bayesian inference for structure analysis of signed networks, A simple and improved parameterized algorithm for bicluster editing, Learning directed acyclic graph SPNs in sub-quadratic time, On the approximability of the maximum agreement subtree and maximum compatible tree problems, Hardness of edge-modification problems, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review, Clustering with qualitative information, (Sub)linear kernels for edge modification problems toward structured graph classes, Approximation algorithms for the capacitated correlation clustering problem with penalties, A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs, A fast branching algorithm for cluster vertex deletion, The maximum balanced subgraph of a signed graph: applications and solution approaches, PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals, A Unified Framework for Strong Price of Anarchy in Clustering Games, Improved Approximations for the Max k-Colored Clustering Problem, Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems, Graph-Based Data Clustering with Overlaps, Cluster Editing, On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering, $2$-Approximation algorithms for two graph clustering problems, Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds, Dichotomy Results on the Hardness of $H$-free Edge Modification Problems, Rough Classification Based on Correlation Clustering, \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs, Correlation clustering and two-edge-connected augmentation for planar graphs, Approximating ( k,ℓ )-Median Clustering for Polygonal Curves, Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem, A modeling and computational study of the frustration index in signed networks, Structural parameterization of cluster deletion, Inapproximability of Maximum Weighted Edge Biclique and Its Applications, Improved Algorithms for Bicluster Editing, Logic on Similarity Based Rough Sets, \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs, Clustering in Hypergraphs to Minimize Average Edge Service Time, Graph clustering with a constraint on cluster sizes, Approximation algorithms on \(k\)-correlation clustering, Efficient enumeration of the optimal solutions to the correlation clustering problem, On the parameterized complexity of s-club cluster deletion problems, On the parameterized complexity of \(s\)-club cluster deletion problems, A combinatorial multi-armed bandit approach to correlation clustering, Unnamed Item, Shift of pairwise similarities for data clustering, Approximating sparse quadratic programs, Simple Iterative Heuristics for Correlation Clustering, A PTAS for the Cluster Editing Problem on Planar Graphs, Numerical Methods for Gremban's Expansion of Signed Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts, Sublinear Algorithms for MAXCUT and Correlation Clustering, On a semi-superwized graph clustering problem, APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM, ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM, Memory-Efficient Structured Convex Optimization via Extreme Point Sampling, Clustering with Local Restrictions, Unnamed Item, Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs, Clustering with Partial Information, Unnamed Item, Unnamed Item, Unnamed Item, Strong triadic closure in cographs and graphs of low maximum degree, Unnamed Item, Unnamed Item, Unnamed Item, Cluster Editing: Kernelization Based on Edge Cuts, Parameterized algorithms for module map problems, LP-based pivoting algorithm for higher-order correlation clustering, Evaluating entity-description conflict on duplicated data, Sum-of-squares hierarchies for binary polynomial optimization, Alternative Parameterizations for Cluster Editing, An Approximation Algorithm for a Semi-supervised Graph Clustering Problem, Sum-of-squares hierarchies for binary polynomial optimization, A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes, Can Everybody Sit Closer to Their Friends Than Their Enemies?, The Branch and Cut Method for the Clique Partitioning Problem, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing, Graph Clustering in All Parameter Regimes, Cluster Editing in Multi-Layer and Temporal Graphs., Parameterized Dynamic Cluster Editing, Contraction Methods for Correlation Clustering: The Order is Important, MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING, Graph Orientation with Edge Modifications, ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS, The generic complexity of the bounded problem of graphs clustering, Metric-Constrained Optimization for Graph Clustering Algorithms
