Clustering with qualitative information

We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. N. Bansal et al. (2002) cast the problem thus: given a graph G whose edges are labeled "+" (similar) or "-" (dissimilar), partition the vertices into clusters so that the number of pairs correctly (resp. incorrectly) classified with respect to the input labeling is maximized (resp. minimized). Complete graphs, where the classifier labels every edge, and general graphs, where some edges are not labeled, are both worth studying. We answer several questions left open by N. Bansal et al. (2002) and provide a sound overview of clustering with qualitative information. We give a factor 4 approximation for minimization on complete graphs, and a factor O(log n) approximation for general graphs. For the maximization version, a PTAS for complete graphs is shown by N. Bansal et al. (2002); we give a factor 0.7664 approximation for general graphs, noting that a PTAS is unlikely by proving APX-hardness. We also prove the APX-hardness of minimization on complete graphs.

[1]  Zhi-Zhong Chen,et al.  Computing Phylogenetic Roots with Bounded Degrees and Errors , 2003, SIAM J. Comput..

[2]  Roded Sharan,et al.  Cluster graph modification problems , 2002, Discret. Appl. Math..

[3]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.

[4]  David P. Williamson,et al.  Improved approximation algorithms for MAX SAT , 2000, SODA '00.

[5]  C. Stein,et al.  Better Rounding Algorithms for a Geometric Embedding Relaxation of Minimum Multiway Cut , 1999, Symposium on the Theory of Computing.

[6]  Chaitanya Swamy,et al.  Correlation Clustering: maximizing agreements via semidefinite programming , 2004, SODA '04.

[7]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[8]  R. Schapire,et al.  Toward Efficient Agnostic Learning , 1994 .

[9]  Yuval Rabani,et al.  An improved approximation algorithm for multiway cut , 1998, STOC '98.

[10]  Venkatesan Guruswami,et al.  Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses , 2004, Algorithmica.

[11]  Linda Sellie,et al.  Toward efficient agnostic learning , 1992, COLT '92.

[12]  Roded Sharan,et al.  Cluster Graph Modification Problems , 2002, WG.

[13]  Joseph Naor,et al.  Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications , 2000, SIAM J. Discret. Math..

[14]  Zohar Yakhini,et al.  Clustering gene expression patterns , 1999, J. Comput. Biol..

[15]  Mikkel Thorup,et al.  Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.

[16]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[17]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[18]  Mikkel Thorup,et al.  Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut , 2004, Math. Oper. Res..

[19]  Nikhil Bansal,et al.  Correlation Clustering , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  Amos Fiat,et al.  Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs , 2003, ESA.

[21]  Nicole Immorlica,et al.  Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques , 2003, Lecture Notes in Computer Science.

[22]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.