Correlation clustering

DOI10.1023/B:MACH.0000033116.57574.95zbMATH Open1089.68085OpenAlexW2914959486WikidataQ57534946 ScholiaQ57534946MaRDI QIDQ703079FDOQ703079

Authors: N. Bansal, Shuchi Chawla, Avrim 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

Recommendations

• Correlation clustering
• Correlation Clustering
• Algorithms and Computation
• Correlation clustering generalized
• Cluster correspondence analysis
• Correlation clustering on networks
• scientific article; zbMATH DE number 7650100
• Correlation clustering with a fixed number of clusters
• Clusterization of Correlation Functions
• Correlation clustering in data streams

zbMATH Keywords

Clusteringapproximation algorithmdocument classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cited In (only showing first 100 items - show all)

• Approximate clustering of incomplete fingerprints
• Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
• Fair correlation clustering with global and local guarantees
• A modeling and computational study of the frustration index in signed networks
• On detecting maximal quasi antagonistic communities in signed graphs
• Approximate algorithms for graph clustering problem
• Strong triadic closure in cographs and graphs of low maximum degree
• Parameterized Dynamic Cluster Editing
• Partition signed social networks via clustering dynamics
• Branch-and-price for \(p\)-cluster editing
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Even better fixed-parameter algorithms for bicluster editing
• A simple and improved parameterized algorithm for bicluster editing
• On a correlational clustering of integers
• Parameterized dynamic cluster editing
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• Pairwise data clustering and applications
• Local guarantees in graph cuts and clustering
• Online correlation clustering
• The biclique partitioning polytope
• Faster parameterized algorithm for cluster vertex deletion
• Cluster deletion on interval graphs and split related graphs
• Cluster deletion on interval graphs and split related graphs
• Correlation clustering with constrained cluster sizes and extended weights bounds
• A parallel hybrid metaheuristic for bicluster editing
• A multi-agent brokerage platform for media content recommendation
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
• Cluster structure in the correlation coefficient matrix can be characterized by abnormal eigenvalues
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
• On the approximability of the maximum agreement subtree and maximum compatible tree problems
• On the hardness of labeled correlation clustering problem: a parameterized complexity view
• A note on the inapproximability of correlation clustering
• Online clique clustering
• Integer programming formulations and efficient local search for relaxed correlation clustering
• Clusters from higher order correlations
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
• Dichotomy results on the hardness of \(H\)-free edge modification problems
• New heuristics for the bicluster editing problem
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• Title not available (Why is that?)
• TAP free energy, spin glasses and variational inference
• Network modelling and variational Bayesian inference for structure analysis of signed networks
• Approximation algorithms for bounded degree phylogenetic roots
• On a semi-supervised graph clustering problem
• Approximation algorithms for the capacitated correlation clustering problem with penalties
• Approximation algorithm for the capacitated correlation clustering problem with penalties
• Approximation algorithms for two variants of correlation clustering problem
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Algorithms and complexity results for labeled correlation clustering problem
• Iterated local transitivity model for signed social networks
• Metric-Constrained Optimization for Graph Clustering Algorithms
• Parameterized lower bound and NP-completeness of some \(H\)-free edge deletion problems
• A unified framework for strong price of anarchy in clustering games
• Cluster Editing in Multi-Layer and Temporal Graphs.
• Approximation algorithms for the lower bounded correlation clustering problem
• Title not available (Why is that?)
• The cluster deletion problem for cographs
• A fast branching algorithm for cluster vertex deletion
• Cluster editing: kernelization based on edge cuts
• Correlation Clustering
• A \(2k\) kernel for the cluster editing problem
• Chromatic kernel and its applications
• Cluster editing: kernelization based on edge cuts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Correlation clustering in general weighted graphs
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems
• A more effective linear kernelization for cluster editing
• Six signed Petersen graphs, and their automorphisms
• Cluster editing with locally bounded modifications
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
• Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
• 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
• Graph clustering with a constraint on cluster sizes
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• Graph-based data clustering with overlaps
• Parameterized algorithms for min-max 2-cluster editing
• Hardness of edge-modification problems
• Correlation clustering
• Correlation clustering with noisy input
• Improved Algorithms for Bicluster Editing
• Editing graphs into disjoint unions of dense clusters
• Random Laplacian matrices and convex relaxations
• On the approximation of correlation clustering and consensus clustering
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Cluster editing
• A complete characterization of statistical query learning with applications to evolvability
• Algorithms and Computation
• Graph Clustering in All Parameter Regimes
• Alternative parameterizations for cluster editing
• Correlation clustering with partial information
• Cluster ensembles: a survey of approaches with recent extensions and applications
• Correlation clustering in data streams
• Correlation clustering, maximizing agreements via semidefinite programming
• Constant ratio fixed-parameter approximation of the edge multicut problem
• Additive approximation algorithms for modularity maximization
• On the parameterized complexity of consensus clustering
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• Closest 4-leaf power is fixed-parameter tractable

This page was built for publication: Correlation clustering

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