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)- Closest 4-leaf power is fixed-parameter tractable
- A more effective linear kernelization for cluster editing
- Semi-supervised graph clustering: a kernel approach
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- Hardness of edge-modification problems
- Partition signed social networks via clustering dynamics
- New heuristics for the bicluster editing problem
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- On detecting maximal quasi antagonistic communities in signed graphs
- Iterated local transitivity model for signed social networks
- Cluster ensembles: a survey of approaches with recent extensions and applications
- Random Laplacian matrices and convex relaxations
- Clustering data that are graph connected
- Cluster editing: kernelization based on edge cuts
- Regularized k-means clustering of high-dimensional data and its asymptotic consistency
- Ensemble clustering using semidefinite programming with applications
- Branch-and-price for \(p\)-cluster editing
- On the parameterized complexity of consensus clustering
- Even better fixed-parameter algorithms for bicluster editing
- 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
- Integer programming formulations and efficient local search for relaxed correlation clustering
- A simple and improved parameterized algorithm for bicluster editing
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- (Sub)linear kernels for edge modification problems toward structured graph classes
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Cluster structure in the correlation coefficient matrix can be characterized by abnormal eigenvalues
- 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
- Approximation algorithms for two variants of correlation clustering problem
- A new temporal interpretation of cluster editing
- Subexponential algorithm for d-cluster edge deletion: exception or rule?
- Learning representations from dendrograms
- Additive approximation algorithms for modularity maximization
- Parameterized dynamic cluster editing
- TAP free energy, spin glasses and variational inference
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
- Embedding signed graphs in the line
- Algorithms and complexity results for labeled correlation clustering problem
- Clustering with partial information
- On the triangle clique cover and \(K_t\) clique cover problems
- Online clique clustering
- Network modelling and variational Bayesian inference for structure analysis of signed networks
- Learning directed acyclic graph SPNs in sub-quadratic time
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- 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
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Local guarantees in graph cuts and clustering
- 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
- Clusters from higher order correlations
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Correlation clustering in general weighted graphs
- A fast branching algorithm for cluster vertex deletion
- Clustering with qualitative information
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- Chromatic kernel and its applications
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains
- Approximation algorithms for the lower bounded correlation clustering problem
- Design and analysis of bipartite experiments under a linear exposure-response model
- A polyhedral study of lifted multicuts
- A parallel hybrid metaheuristic for bicluster editing
- Competitive strategies for online clique clustering
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Rough classification based on correlation clustering
- Graph clustering with a constraint on cluster sizes
- A PTAS for the Cluster Editing Problem on Planar Graphs
- Correlation clustering with a fixed number of clusters
- Clustering with Local Restrictions
- Cluster editing: kernelization based on edge cuts
- Alternative parameterizations for cluster editing
- Pairwise data clustering and applications
- Can everybody sit closer to their friends than their enemies?
- Online correlation clustering
- Short survey on graph correlation clustering with minimization criteria
- Probabilistic correlation clustering and image partitioning using perturbed multicuts
- Adaptive trajectory analysis of replicator dynamics for data clustering
- Multicuts and perturb \& MAP for probabilistic graph clustering
- Clustering on \(k\)-edge-colored graphs
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- 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
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Improved Algorithms for Bicluster Editing
- Correlation clustering
- Clustering with Partial Information
- A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- scientific article; zbMATH DE number 5633849 (Why is no real title available?)
- Agnostic clustering
- Correlation clustering on networks
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)
