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)

• 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
• Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
• Semi-supervised graph clustering: a kernel approach
• Title not available (Why is that?)
• Clustering with qualitative information
• A polyhedral study of lifted multicuts
• Adaptive trajectory analysis of replicator dynamics for data clustering
• Multicuts and perturb \& MAP for probabilistic graph clustering
• Clustering on \(k\)-edge-colored graphs
• Fixed-parameter enumerability of cluster editing and related problems
• Finding the closest ultrametric
• Evaluating entity-description conflict on duplicated data
• 2-approximation algorithms for two graph clustering problems
• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• Regularized \(k\)-means clustering of high-dimensional data and its asymptotic consistency
• Ranking inter-relationships between clusters
• Clustering with Partial Information
• Convergence and approximation in potential games
• 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
• Clustering data that are graph connected
• Graph clustering
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• Branch-and-cut approaches for \(p\)-cluster editing
• Ensemble clustering using semidefinite programming with applications
• Correlation clustering on networks
• Correlation clustering with a fixed number of clusters
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Improved approximations for the max \(k\)-colored clustering problem
• Guaranteed clustering and biclustering via semidefinite programming
• Recovery guarantees for exemplar-based clustering
• 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

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)