Using Self-Similarity to Cluster Large Data Sets

@article{Barbara02KDDCluster, abstract = {Clustering is a widely used knowledge discovery technique. It helps uncovering structures in data that were not previously known. The clustering of large data sets has received a lot of attention in recent years, however, clustering is a still a challenging task since many published algorithms fail to do well in scaling with the size of the data set and the number of dimensions that describe the points, or in finding arbitrary shapes of clusters, or dealing effectively with the presence of noise. In this paper, we present a new clustering algorithm, based in self-similarity properties of the data sets. Self-similarity is the property of being invariant with respect to the scale used to look at the data set. While fractals are self-similar at every scale used to look at them, many data sets exhibit self-similarity over a range of scales. Self-similarity can be measured using the fractal dimension. The new algorithm which we call Fractal Clustering (FC) places points incrementally in the cluster for which the change in the fractal dimension after adding the point is the least. This is a very natural way of clustering points, since points in the same cluster have a great degree of self-similarity among them (and much less self-similarity with respect to points in other clusters). FC requires one scan of the data, is suspendable at will, providing the best answer possible at that point, and is incremental. We show via experiments that FC effectively deals with large data sets, high-dimensionality and noise and is capable of recognizing clusters of arbitrary shape.}, author = {Barbar\'{a}, Daniel and Chen, Ping }, citeulike-article-id = {1914886}, doi = {http://dx.doi.org/10.1023/A:1022493416690}, journal = {Data Mining and Knowledge Discovery}, keywords = {clustering, thesis}, month = {April}, number = {2}, pages = {123--152}, posted-at = {2008-03-27 15:24:25}, priority = {2}, title = {Using Self-Similarity to Cluster Large Data Sets}, url = {http://dx.doi.org/10.1023/A:1022493416690}, volume = {7}, year = {2003} }

TY - JOUR ID - Barbara02KDDCluster L3 - citeulike-article-id:1914886 TI - Using Self-Similarity to Cluster Large Data Sets JF - Data Mining and Knowledge Discovery VL - 7 IS - 2 SP - 123 EP - 152 N2 - Clustering is a widely used knowledge discovery technique. It helps uncovering structures in data that were not previously known. The clustering of large data sets has received a lot of attention in recent years, however, clustering is a still a challenging task since many published algorithms fail to do well in scaling with the size of the data set and the number of dimensions that describe the points, or in finding arbitrary shapes of clusters, or dealing effectively with the presence of noise. In this paper, we present a new clustering algorithm, based in self-similarity properties of the data sets. Self-similarity is the property of being invariant with respect to the scale used to look at the data set. While fractals are self-similar at every scale used to look at them, many data sets exhibit self-similarity over a range of scales. Self-similarity can be measured using the fractal dimension. The new algorithm which we call Fractal Clustering (FC) places points incrementally in the cluster for which the change in the fractal dimension after adding the point is the least. This is a very natural way of clustering points, since points in the same cluster have a great degree of self-similarity among them (and much less self-similarity with respect to points in other clusters). FC requires one scan of the data, is suspendable at will, providing the best answer possible at that point, and is incremental. We show via experiments that FC effectively deals with large data sets, high-dimensionality and noise and is capable of recognizing clusters of arbitrary shape. KW - clustering KW - thesis AU - Barbará, Daniel AU - Chen, Ping PY - 2003/04/01/ UR - http://dx.doi.org/10.1023/A:1022493416690 ER -