LNCS 2764 Correlation Clustering with Partial Information 1st Edition by Erik Demaine, Nicole Immorlica ISBN 3540380450 9783540380450

LNCS 2764 – Correlation Clustering with Partial Information 1st Edition by Erik D. Demaine, Nicole Immorlica – Ebook PDF Instant Download/Delivery. 3540380450, 9783540380450

Full download LNCS 2764 – Correlation Clustering with Partial Information 1st Edition after payment

 

 

Product details:

ISBN 10: 3540380450

ISBN 13: 9783540380450

Author: Erik D. Demaine, Nicole Immorlica

LNCS 2764 – Correlation Clustering with Partial Information 1st Edition: 

We consider the following general correlation-clustering problem [1]: given a graph with real edge weights (both positive and negative), partition the vertices into clusters to minimize the total absolute weight of cut positive edges and uncut negative edges. Thus, large positive weights (representing strong correlations between endpoints) encourage those endpoints to belong to a common cluster; large negative weights encourage the endpoints to belong to different clusters; and weights with small absolute value represent little information. In contrast to most clustering problems, correlation clustering specifies neither the desired number of clusters nor a distance threshold for clustering; both of these parameters are effectively chosen to be the best possible by the problem definition.

Correlation clustering was introduced by Bansal, Blum, and Chawla [1], motivated by both document clustering and agnostic learning. They proved NP-hardness and gave constant-factor approximation algorithms for the special case in which the graph is complete (full information) and every edge has weight +1 or -1. We give an O(logn)-approximation algorithm for the general case based on a linear-programming rounding and the “region-growing” technique. We also prove that this linear program has a gap of Ω(logn), and therefore our approximation is tight under this approach. We also give an O(r ³)-approximation algorithm for K _r, r -minor-free graphs. On the other hand, we show that the problem is APX-hard, and any o(logn)-approximation would require improving the best approximation algorithms known for minimum multicut.

 

LNCS 2764 – Correlation Clustering with Partial Information 1st Edition Table of contents:

1 Introduction

2 Problem Definition and Linear-Programming Formulation

3 Approximation in General Graphs

4 Approximation in K-Minor-Free Grap

5 Lower Bounds

6 Conclusion

 

People also search for LNCS 2764 – Correlation Clustering with Partial Information 1st Edition:

hierarchical correlation clustering
    
online and consistent correlation clustering
    
weighted correlation clustering
    
correlation clustering python
    
correlation clustering morgan & claypool publishers