%0 Book Section %1 Andritsos2004LIMBO %A Andritsos, Periklis %A Tsaparas, Panayiotis %A Miller, Renée J. %A Sevcik, Kenneth C. %D 2004 %J Advances in Database Technology - EDBT 2004 %K clustering discovery entityguides schema %P 531--532 %T LIMBO: Scalable Clustering of Categorical Data %U http://www.springerlink.com/content/bv76grdqnb2jlkg9 %X Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, when there is no inherent distance measure between data values. We introduce LIMBO, a scalable hierarchical categorical clustering algorithm that builds on the Information Bottleneck (IB) framework for quantifying the relevant information preserved when clustering. As a hierarchical algorithm, LIMBO has the advantage that it can produce clusterings of different sizes in a single execution. We use the IB framework to define a distance measure for categorical tuples and we also present a novel distance measure for categorical attribute values. We show how the LIMBO algorithm can be used to cluster both tuples and values. LIMBO handles large data sets by producing a memory bounded summary model for the data. We present an experimental evaluation of LIMBO, and we study how clustering quality compares to other categorical clustering algorithms. LIMBO supports a trade-off between efficiency (in terms of space and time) and quality. We quantify this trade-off and demonstrate that LIMBO allows for substantial improvements in efficiency with negligible decrease in quality.

@incollection{Andritsos2004LIMBO, abstract = {Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, when there is no inherent distance measure between data values. We introduce LIMBO, a scalable hierarchical categorical clustering algorithm that builds on the Information Bottleneck (IB) framework for quantifying the relevant information preserved when clustering. As a hierarchical algorithm, LIMBO has the advantage that it can produce clusterings of different sizes in a single execution. We use the IB framework to define a distance measure for categorical tuples and we also present a novel distance measure for categorical attribute values. We show how the LIMBO algorithm can be used to cluster both tuples and values. LIMBO handles large data sets by producing a memory bounded summary model for the data. We present an experimental evaluation of LIMBO, and we study how clustering quality compares to other categorical clustering algorithms. LIMBO supports a trade-off between efficiency (in terms of space and time) and quality. We quantify this trade-off and demonstrate that LIMBO allows for substantial improvements in efficiency with negligible decrease in quality.}, added-at = {2009-03-12T15:42:50.000+0100}, author = {Andritsos, Periklis and Tsaparas, Panayiotis and Miller, Ren\'{e}e J. and Sevcik, Kenneth C.}, biburl = {https://www.bibsonomy.org/bibtex/2c0bcecd11ce041977537a0a71d908e70/lillejul}, citeulike-article-id = {4016480}, comment = {* Input: 1 rel table * Output: Column matchings * Technique: \# Uses information theoretic measures to create a distance between tuples and between categorical values (categorical = no inherent distance measure exists) \# A hierarchical clustering algorithm (Agglomerative Information Bottleneck) uses then the measure to cluster tuples and/or values. \# The whole LIMBO clustering algo can be bounded in space and/or in time. Making it thus suitable for clustering streaming data.}, interhash = {6962913f0a8ab93a19250c457030edeb}, intrahash = {c0bcecd11ce041977537a0a71d908e70}, journal = {Advances in Database Technology - EDBT 2004}, keywords = {clustering discovery entityguides schema}, pages = {531--532}, posted-at = {2009-02-06 15:09:48}, priority = {0}, timestamp = {2009-03-12T15:42:50.000+0100}, title = {LIMBO: Scalable Clustering of Categorical Data}, url = {http://www.springerlink.com/content/bv76grdqnb2jlkg9 }, year = 2004 }