Constrained Rank Aggregation and Correlation Clustering
summary
Proposes a correlation‑clustering variant that lets negative edge weights be arbitrarily large to enforce mutual exclusivity, adds per‑vertex penalties to enforce soft size bounds, and uses an LP relaxation plus a thresholded rounding step (alpha solved from a cubic) to get constant‑factor approximations (practical ratios around 6). Applies methods to TCGA breast cancer data (after filtering ~9,000→~600 genes) and recovers subtype‑specific modules (e.g., kinase vs CDH1 groups) from 504 patients, while greedy CCpivot performs poorly.
AI-written summary · about
chapters (18)
- 0:00Intro
- 1:57Mathematical Collaboration Communities
- 2:12New Functional Community Detection Paradigm
- 4:31Community Detection via Correlation Clustering?
- 6:10Correlation Clustering: Basics
- 7:27Extensions of the Basic Model: Edge Weights
- 9:10Is Correlation Clustering Suitable for Cancer Genomics?
- 10:59Correlation Clustering: Our Contributions
- 11:31CGW Algorithm - Step 1: LP Relaxation
- 14:31CGW Algorithm - Step 2: Rounding Up
- 15:44Extensions: Size Constraints and New Weights
- 16:53The New Algorithm: LP Part
- 17:20The New Algorithm: Rounding Up Part
- 18:49What is the Approximation Ratio?
- 19:40Changing the Rounding Up Procedure
- 20:12Other Extensions: Randomized Algorithms a la C-PIVOT
- 20:23Proof Techniques
- 20:34Some Results on Cancer Modules
related talks
47mCrowdsourcing for Clustering: Algorithms and Information-Theoretic Lower Bounds
37mPower to the Points: Local Certificates for Clusterings
40mTesting Correlation of Unlabeled Random Graphs
38mMixed and Covariate-Dependent Graphical Models
52mNew Algorithms For The Graph Alignment Problem
01h 07mA Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
46mEliciting and Enforcing Subjective Individual Fairness
38mThe Impact of Regularization in Spectral Clustering
