Correlation clustering
From MaRDI portal
Publication:703079
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
Cited in
(only showing first 100 items - show all)- Recovery guarantees for exemplar-based clustering
- The cluster deletion problem for cographs
- Approximate clustering of incomplete fingerprints
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
- A fast branching algorithm for cluster vertex deletion
- scientific article; zbMATH DE number 7559245 (Why is no real title available?)
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- An improved approximation algorithm for capacitated correlation clustering problem
- Cluster editing: kernelization based on edge cuts
- A \(2k\) kernel for the cluster editing problem
- Chromatic kernel and its applications
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Cluster editing: kernelization based on edge cuts
- Learning representations from dendrograms
- Fair correlation clustering with global and local guarantees
- Correlation Clustering
- On generic complexity of the graph clustering problem with bounded clusters
- Embedding signed graphs in the line
- Correlation clustering in general weighted graphs
- A more effective linear kernelization for cluster editing
- scientific article; zbMATH DE number 7561398 (Why is no real title available?)
- scientific article; zbMATH DE number 7650100 (Why is no real title available?)
- Six signed Petersen graphs, and their automorphisms
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Cluster editing with locally bounded modifications
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
- Graph orientation with edge modifications
- On detecting maximal quasi antagonistic communities in signed graphs
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Logic on Similarity Based Rough Sets
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- 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-based data clustering with overlaps
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
- Graph-Based Data Clustering with Overlaps
- Graph clustering with a constraint on cluster sizes
- A modeling and computational study of the frustration index in signed networks
- Hardness of edge-modification problems
- Parameterized algorithms for min-max 2-cluster editing
- Approximate algorithms for graph clustering problem
- Approximation algorithms on \(k\)-correlation clustering
- Correlation clustering
- Rough classification based on correlation clustering
- Clustering with Local Restrictions
- Improved Algorithms for Bicluster Editing
- Partition signed social networks via clustering dynamics
- Strong triadic closure in cographs and graphs of low maximum degree
- Design and analysis of bipartite experiments under a linear exposure-response model
- Editing graphs into disjoint unions of dense clusters
- Parameterized Dynamic Cluster Editing
- Correlation clustering with noisy input
- Branch-and-price for \(p\)-cluster editing
- 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
- Random Laplacian matrices and convex relaxations
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On the approximation of correlation clustering and consensus clustering
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
- Even better fixed-parameter algorithms for bicluster editing
- On cluster editing problem with clusters of small sizes
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- A simple and improved parameterized algorithm for bicluster editing
- 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
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
- On a correlational clustering of integers
- A complete characterization of statistical query learning with applications to evolvability
- Resource-Bounded Information Gathering for Correlation Clustering
- A combinatorial multi-armed bandit approach to correlation clustering
- Cluster editing
- Parameterized dynamic cluster editing
- Agnostic clustering
- An efficient local search algorithm for correlation clustering on large graphs
- Algorithms and Computation
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Pairwise data clustering and applications
- Graph Clustering in All Parameter Regimes
- Shift of pairwise similarities for data clustering
- Local guarantees in graph cuts and 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
- The biclique partitioning polytope
- Faster parameterized algorithm for cluster vertex deletion
- Cluster deletion on interval graphs and split related graphs
- Cluster ensembles: a survey of approaches with recent extensions and applications
- Alternative parameterizations for cluster editing
- Online correlation clustering
- scientific article; zbMATH DE number 5633849 (Why is no real title available?)
- Contraction methods for correlation clustering: the order is important
- Correlation clustering in data streams
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)
