On the public citation graph

On the Approximation of Correlation Clustering and Consensus Clustering

0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1998.1605openalex-snapshot
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
inferredcites →https://doi.org/10.1007/978-0-387-39940-9_2309openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1007/978-3-540-24745-6_8openalex-snapshot
Heterogeneous Data Integration with the Consensus Clustering Formalism
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_21openalex-snapshot
Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_1openalex-snapshot
Correlation Clustering with Partial Information
inferredcites →https://doi.org/10.1007/bf00289116openalex-snapshot
NP-hard problems in hierarchical-tree clustering
inferredcites →https://doi.org/10.1007/bf01589097openalex-snapshot
A cutting plane algorithm for a clustering problem
inferredcites →https://doi.org/10.1007/s101070100271openalex-snapshot
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
inferredcites →https://doi.org/10.1016/j.jcss.2004.10.012openalex-snapshot
Clustering with qualitative information
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-snapshot
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1017/cbo9780511546853openalex-snapshot
Algorithms on Strings
inferredcites →https://doi.org/10.1109/icde.2005.34openalex-snapshot
Clustering Aggregation
inferredcites →https://doi.org/10.1109/sfcs.2002.1181947openalex-snapshot
Correlation clustering
inferredcites →https://doi.org/10.1109/sfcs.2003.1238225openalex-snapshot
Clustering with qualitative information
inferredcites →https://doi.org/10.1109/tai.2003.1250220openalex-snapshot
Integrating microarray data by consensus clustering
inferredcites →https://doi.org/10.1137/s0097539799361683openalex-snapshot
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
inferredcites →https://doi.org/10.1142/s0218213004001867openalex-snapshot
INTEGRATING MICROARRAY DATA BY CONSENSUS CLUSTERING
inferredcites →https://doi.org/10.1145/1060590.1060692openalex-snapshot
Aggregating inconsistent information
inferredcites →https://doi.org/10.1145/1411509.1411513openalex-snapshot
Aggregating inconsistent information
inferredcites →https://doi.org/10.1145/5925.5933openalex-snapshot
A unified approach to approximation algorithms for bottleneck problems
inferredcites →https://doi.org/10.5555/982792.982866openalex-snapshot
Correlation Clustering: maximizing agreements via semidefinite programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-42266-0_9openalex-snapshot
PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals
inferred← citeshttps://doi.org/10.1007/978-3-319-39630-9_3openalex-snapshot
Clique Editing to Support Case Versus Control Discrimination
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_3openalex-snapshot
Short Survey on Graph Correlation Clustering with Minimization Criteria
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_7openalex-snapshot
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_4openalex-snapshot
Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_7openalex-snapshot
Average Parameterization and Partial Kernelization for Computing Medians
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_64openalex-snapshot
On the Parameterized Complexity of Consensus Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_16openalex-snapshot
On the Min-Max 2-Cluster Editing Problem
inferred← citeshttps://doi.org/10.1007/s00453-014-9874-8openalex-snapshot
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions
inferred← citeshttps://doi.org/10.1007/s10878-016-0059-zopenalex-snapshot
Parameterized algorithms for min–max 2-cluster editing
inferred← citeshttps://doi.org/10.1007/s11390-015-1514-5openalex-snapshot
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas
inferred← citeshttps://doi.org/10.1007/s43069-022-00156-6openalex-snapshot
A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis
inferred← citeshttps://doi.org/10.1016/j.artint.2015.07.001openalex-snapshot
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.01.074openalex-snapshot
Estimating the number of clusters in a dataset via consensus clustering
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1597openalex-snapshot
Differentially Private Maximum Consensus
inferred← citeshttps://doi.org/10.1016/j.isci.2022.104921openalex-snapshot
Multi-omics characterization reveals the pathogenesis of liver focal nodular hyperplasia
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.005openalex-snapshot
Average parameterization and partial kernelization for computing medians
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.185openalex-snapshot
Robust Conclusions in Mass Spectrometry Analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.022openalex-snapshot
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.002openalex-snapshot
On the parameterized complexity of consensus clustering
inferred← citeshttps://doi.org/10.1080/2474736x.2020.1787796openalex-snapshot
National internal security policies across Europe – a comparative analysis applying big data clustering techniques
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2858803openalex-snapshot
PolyCluster: Minimum Fragment Disagreement Clustering for Polyploid Phasing
inferred← citeshttps://doi.org/10.1109/tpami.2012.80openalex-snapshot
Consensus Clustering Based on a New Probabilistic Rand Index with Application to Subtopic Retrieval
inferred← citeshttps://doi.org/10.1137/1.9781611973075.59openalex-snapshot
A Polynomial Time Approximation Scheme for k-Consensus Clustering
inferred← citeshttps://doi.org/10.1145/3517804.3526227openalex-snapshot
The Gibbs-Rand Model
inferred← citeshttps://doi.org/10.1186/s13015-017-0096-xopenalex-snapshot
Approximating the correction of weighted and unweighted orthology and paralogy relations
inferred← citeshttps://doi.org/10.1287/ijoc.2021.0186openalex-snapshot
A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1840openalex-snapshot
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters
inferred← citeshttps://doi.org/10.65109/tvyl9134openalex-snapshot
Partition Aggregation for Participatory Budgeting
inferred← citeshttps://doi.org/10.70675/909bbe94z5fa8z4ba3z80bbzc56545575d65openalex-snapshot
Characterizing edges in signed and vector-valued graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.