On The Correlation Clustering Problem: Algorithm for Correlation Clustering Problem - Sriram Penumatcha
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
We consider the correlation clustering problem which was initially introduced by Bansal, Blum, Chawla et al. Given a complete graph G on n vertices, with weights of +1 or -1 defined on the edges, we want to find a partition which maximizes the sum of the number of edges with positive weights inside the clusters plus the number of edges with negative weights between different clusters. In this thesis we pres ... Full description
You May Also Like
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-20% with code BOOKS
In stock at our supplier
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-20% with code BOOKS
In stock at our supplier
TOP
The Feynman Lectures on Physics. The New Millennium Edition
Matthew Sands, Robert Leighton, Richard Feynman
-20% with code BOOKS
In stock at our supplier
TOP
How to Solve it: A New Aspect of Mathematical Method
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-20% with code BOOKS
In stock at our supplier
Description
We consider the correlation clustering problem which was initially introduced by Bansal, Blum, Chawla et al. Given a complete graph G on n vertices, with weights of +1 or -1 defined on the edges, we want to find a partition which maximizes the sum of the number of edges with positive weights inside the clusters plus the number of edges with negative weights between different clusters. In this thesis we present a deterministic polynomial time approximation scheme for finding such a partition. Our approach is different from the one given by Bansal, Blum, Chawla et al. as it relies on the Szemeredi's Regularity Lemma. We start by introducing the problem, then we introduce the concepts of regularity lemma and give a proof of Szemeredi's Regularity Lemma. Then we present the algorithm and the proof of the correctness of the algorithm.
More Information
| Author | Sriram Penumatcha |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2009 |
| Cover type | Softcover |
| EAN | 9783838313542 |