Correlation clustering
From MaRDI portal
Publication:703079
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
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?)
- Title not available (Why is that?)
- An improved approximation algorithm for capacitated correlation clustering problem
- On generic complexity of the graph clustering problem with bounded clusters
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Learning representations from dendrograms
- Embedding signed graphs in the line
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
- Graph orientation with edge modifications
- Logic on Similarity Based Rough Sets
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
- Graph-Based Data Clustering with Overlaps
- Approximation algorithms on \(k\)-correlation clustering
- Rough classification based on correlation clustering
- Clustering with Local Restrictions
- Design and analysis of bipartite experiments under a linear exposure-response model
- LP-based pivoting algorithm for higher-order correlation clustering
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Numerical methods for Gremban's expansion of signed graphs
- On cluster editing problem with clusters of small sizes
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
- 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 new temporal interpretation of cluster editing
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
- Resource-Bounded Information Gathering for Correlation Clustering
- A combinatorial multi-armed bandit approach to correlation clustering
- An efficient local search algorithm for correlation clustering on large graphs
- Agnostic clustering
- Shift of pairwise similarities for data clustering
- The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
- An improved approximation algorithm for the capacitated correlation clustering problem
- The branch and cut method for the clique partitioning problem
- Contraction methods for correlation clustering: the order is important
- Approximating sparse quadratic programs
- Title not available (Why is that?)
- Approximation algorithm for min-max correlation clustering problem with outliers
- Concise integer linear programming formulation for clique partitioning problems
- MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING
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)
