Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COLT

2003

Springer

2003

Springer

We propose a new formulation of the clustering problem that diﬀers from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meaningful conjunctive descriptions of the clusters. Second, the clusters might overlap, i.e., a point can belong to multiple clusters. Third, the clusters might not cover all points, i.e., not every point is clustered. Finally, we allow a point to be assigned to a conjunctive cluster description even if it does not completely satisfy all of the attributes, but rather only satisﬁes most. A convenient way to view our clustering problem is that of ﬁnding a collection of large bicliques in a bipartite graph. Identifying one largest conjunctive cluster is equivalent to ﬁnding a maximum edge biclique. Since this problem is NP-hard [28] and there is evidence that it is diﬃcult to approximate [12], we solve a relaxed version where the objective is to ﬁnd a large subgraph that is close to being a biclique. We gi...

Related Content

Added |
06 Jul 2010 |

Updated |
06 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
COLT |

Authors |
Nina Mishra, Dana Ron, Ram Swaminathan |

Comments (0)